The Semantic Model Of The Type Inference Of Haskell Languages

As the size and complexity of software systems is growing dramatically, Functional languages have provided a particularly elegant framework to address these issues, but the running efficiency of Functional languages is slow. The author wants to dig out the advantages of the Functional language by studying the Semantic Model on the Type inference of the Haskell Functional language.Firstly, the thesis makes a brief introduction about the development and current situation of the Type inference through studying the background and development of the Haskell Functional language. It also discusses the characteristics of Haskell language and its advantages as a Functional language. The study has academic a realistic meaning for improving the quality and the exploring efficiency of the software and value for Haskell language.Secondly, the author puts forward the Semantic Model of the Type inference based on the Haskell language according to the related theory of the formal semantics. This Semantic Model includes two types of Semantic Model. One is Deductive Semantic Model of Singleton and Polymorphic types, which is illustrated from constraints and Function application respectively. The constraints are relatively simply for the type can be deducted from the known directly and Function application needs to use the way of Unity to get the final Type. The other is the Deductive Semantic Model of the Function types, which is got by the type inference of Higher-order functions and mainly consists of Higher-order functions and Function composition.