Title
Principal Typings for Explicit Substitutions Calculi
Abstract
Having principal typings (for short PT) is an important property of type systems. In simply typed systems, this property guarantees the possibility of a complete and terminating type inference mechanism. It is well-known that the simply typed 驴-calculus has this property but recently J.B. Wells has introduced a system-independent definition of PT, which allows to prove that some type systems, e.g. the Hindley/Milner type system, do not satisfy PT. Explicit substitutions address a major computational drawback of the 驴-calculus and allow the explicit treatment of the substitution operation to formally correspond to its implementation. Several extensions of the 驴-calculus with explicit substitution have been given but some of which do not preserve basic properties such as the preservation of strong normalization. We consider two systems of explicit substitutions (驴seand 驴驴) and show that they can be accommodated with an adequate notion of PT. Specifically, our results are as follows:驴 We introduce PT notions for the simply typed versions of the 驴se- and the 驴驴-calculi and prove that they agree with Wells' notion of PT.驴 We show that these versions satisfy PT by revisiting previously introduced type inference algorithms.
Year
DOI
Venue
2008
10.1007/978-3-540-69407-6_60
CiE
Keywords
Field
DocType
important property,basic property,explicit treatment,short pt,explicit substitutions calculi,principal typings,milner type system,type inference algorithm,type system,type inference mechanism,pt notion,explicit substitution,satisfiability,lambda calculus,type inference
Discrete mathematics,Lambda calculus,Normalization (statistics),Simply typed lambda calculus,Computer science,Type inference,Explicit substitution,Normalization property,Type inhabitation
Conference
Volume
ISSN
Citations 
5028
0302-9743
0
PageRank 
References 
Authors
0.34
10
3
Name
Order
Citations
PageRank
Daniel Lima Ventura1224.88
Mauricio Ayala-Rincón215631.94
Fairouz Kamareddine332847.92