Design And Implementation Of Apla Generic Constraint Matching Detection System

It is promising of the application of computers.Programming languages have further broadened their range of applications,but the "software crisis" that threatens software security remains.The process of software development is constrained by a variety of factors,such as the method of program design,the structure of the algorithm,the development time period,and the development cost.However,the most important thing in the development process is to ensure the correctness and reliability of the software.The two elements can not be ignored in all software development processes.How to solve these two elements in the process of development is a major problem that needs to be solved urgently in the current software industry.Generic programming(parameterized programming)is one of the effective ways to improve the correctness and reliability of software development.Current mainstream high-level programming languages support generic language mechanisms,such as Eiffel,C++,Java,Ada,C#,and ML.However,the generic language mechanisms in such high-level programming languages are of a single type.Most of them have only types as parameters and a few of them take services as parameters,and their generic constraints are restricted generic constraint mechanisms.This is due to the complexity of the implementation of generic language mechanisms in high-level programming languages.In recent years,the next development focus of the software industry at home and abroad is how to implement the generic language mechanism in the high-level programming language.The main research objective of this paper is to propose a type constraint mechanism based on Apla,design a generic constraint matching detection algorithm,and give a scheme to implement the generic constraint mechanism on PAR platform finally.This paper integrates the existing generic programming and its constraint definition through in-depth comparative study.It makes a thorough comparison and analysis of generic program design and its constraints.Based on the analysis,it studies the generic of high-level programming language and the method of the description of the generic constraint mechanism.Then proposes a generic constraint mechanism in the design of Apla language that subdivides its data type constraints into basic data type constraints and custom abstract data types.Further instantiates generic parameters with concrete types based on constraints.The instantiation parameters requirement must satisfy the constraints.Finally designs generic constraint matching detection algorithm,and implements the Apla generic constraints matching detection system.Apla generic languages are better than other programming languages to express generic constraint requirements in programs with display statements,and their constraint types are not as single as other programming languages'.Users can continuously update the constraint types in the constraint library according to their own requirements,and use the where keyword to invoke the generic constraint.Apla is an abstract generic programming language.It meets the requirements of generic concepts better.Compared with other programming languages,it has advantages in generic constraint requirements and strives to fully implement generic requirements.The main innovations of this paper are as follows: 1)In-depth comparison and analysis of generic constraint mechanisms for high-level programming languages;2)Putting forward Apla generic constraint mechanism;3)Designing constraint matching detection algorithm that can detect whether its formal parameters meet the constraint's grammatical requirements;4)Design and implementation of Apla generic constraint matching detection system.