F-Semantics for Intersection Type Discipline

Aim of this paper is to investigate the soundness and completeness for the F-semantics (F-soundness and F-completeness) of some modifications of the intersection type discipline for terms of the (untyped) λ-calculus.

[1]  Elio Giovannetti,et al.  Completeness Results for a Polymorphic Type System , 1983, CAAP.

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

[3]  John C. Reynolds,et al.  Types, Abstraction and Parametric Polymorphism , 1983, IFIP Congress.

[4]  Mario Coppo,et al.  An Extended Polymorphic Type System for Applicative Languages , 1980, MFCS.

[5]  Marcel Crabbé.  H. B. Curry, J. R. Hindley, J. P. Seldin, Combinatory Logic. Vol. II , 1974 .

[6]  Nancy Jean Mccracken,et al.  An investigation of a programming language with a polymorphic type structure. , 1979 .

[7]  Mariangiola Dezani-Ciancaglini,et al.  A new type assignment for λ-terms , 1978, Arch. Math. Log..

[8]  Mario Coppo,et al.  Completeness of Type Assignment in Continuous Lambda Models , 1984, Theor. Comput. Sci..

[9]  Dana S. Scott,et al.  Some Domain Theory and Denotational Semantics in Coq , 2009, TPHOLs.

[10]  Daniel Leivant,et al.  Polymorphic type inference , 1983, POPL '83.

[11]  Dana S. Scott,et al.  Lambda Calculus: Some Models, Some Philosophy , 1980 .

[12]  P. Dembiński.  Mathematical Foundations of Computer Science 1980 , 1980, Lecture Notes in Computer Science.

[13]  Daniel Leivant,et al.  The Expressiveness of Simple and Second-Order Type Structures , 1983, JACM.

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

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

[16]  Robin Milner,et al.  Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[17]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..

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

[19]  M. Dezani-Ciancaglini,et al.  Extended Type Structures and Filter Lambda Models , 1984 .

[20]  Mariangiola Dezani-Ciancaglini,et al.  An extension of the basic functionality theory for the λ-calculus , 1980, Notre Dame J. Formal Log..

[21]  Giuseppe Longo,et al.  Set-theoretical models of λ-calculus: theories, expansions, isomorphisms , 1983, Ann. Pure Appl. Log..

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

[23]  R. Hindley.  The Principal Type-Scheme of an Object in Combinatory Logic , 1969 .

[24]  G. Longo,et al.  Lambda-Calculus Models and Extensionality , 1980, Math. Log. Q..

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

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