Syntax and Semantics of Type Assignment Systems

[1]  Richard Statman,et al.  Empty types in polymorphic lambda calculus , 1987, POPL '87.

[2]  de Ng Dick Bruijn,et al.  A survey of the project Automath , 1980 .

[3]  J. Gallier.  On Girard's "Candidats de Reductibilité" , 1989 .

[4]  F. Cardone,et al.  Two extensions of Curry's type inference system , 1990 .

[5]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[6]  Mariangiola Dezani-Ciancaglini,et al.  Combining Type Disciplines , 1994, Ann. Pure Appl. Log..

[7]  John C. Reynolds,et al.  Towards a theory of type structure , 1974, Symposium on Programming.

[8]  Mariangiola Dezani-Ciancaglini,et al.  A Characterization of F-Complete Type Assignments , 1986, Theor. Comput. Sci..

[9]  B. Pierce.  Programming with intersection types, union types, and polymorphism , 1991 .

[10]  John C. Mitchell,et al.  Kripke-Style Models for Typed lambda Calculus , 1991, Ann. Pure Appl. Log..

[11]  H B Curry,et al.  Functionality in Combinatory Logic. , 1934, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Ravi Sethi,et al.  A semantic model of types for applicative languages , 1982, LFP '82.

[13]  John C. Reynolds,et al.  Preliminary design of the programming language Forsythe , 1988 .

[14]  John C. Mitchell,et al.  Abstract types have existential type , 1988, TOPL.

[15]  Mariangiola Dezani-Ciancaglini,et al.  Functional Characters of Solvable Terms , 1981, Math. Log. Q..

[16]  Fabio Alessi,et al.  Strong Conjunction and Intersection Types , 1991, MFCS.

[17]  Mariangiola Dezani-Ciancaglini,et al.  The "Relevance" of Intersection and Union Types , 1997, Notre Dame J. Formal Log..

[18]  J. Roger Hindley,et al.  The Completeness Theorem for Typing lambda-Terms , 1983, Theor. Comput. Sci..

[19]  J. Roger Hindley.  Curry's Type-Rules are Complete with Respect to the F-Semantics too , 1983, Theor. Comput. Sci..

[20]  Hirofumi Yokouchi,et al.  F-Semantics for Type Assignment Systems , 1994, Theor. Comput. Sci..

[21]  Gordon D. Plotkin,et al.  A Semantics for Static Type Inference , 1994, Inf. Comput..

[22]  John C. Mitchell,et al.  Polymorphic Type Inference and Containment , 1988, Inf. Comput..

[23]  Benjamin C. Pierce,et al.  Intersection types and bounded polymorphism , 1993, Mathematical Structures in Computer Science.

[24]  Gordon D. Plotkin,et al.  An Ideal Model for Recursive Polymorphic Types , 1986, Inf. Control..

[25]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[26]  Hirofumi Yokouchi,et al.  Embedding a Second Order Type System into an Intersection Type System , 1995, Inf. Comput..

[27]  Mariangiola Dezani-Ciancaglini,et al.  A filter lambda model and the completeness of type assignment , 1983, Journal of Symbolic Logic.

[28]  Daniel Leivant,et al.  Typing and Computational Properties of Lambda Expressions , 1986, Theor. Comput. Sci..

[29]  Mariangiola Dezani-Ciancaglini,et al.  Intersection and Union Types: Syntax and Semantics , 1995, Inf. Comput..