The semantics of second-order lambda calculus

Information and Computation

Volumn 85, Issue 1, 1990, Pages 76-134

  Bruce, Kim B ^a   Meyer, Albert R ^b   Mitchell, John C ^c  

^a WILLIAMS COLLEGE   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY - COMPUTABILITY AND DECIDABILITY;

LAMBDA CALCULUS; SEMANTIC MODELS;

COMPUTER METATHEORY;

EID: 0025405286     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/0890-5401(90)90044-I     Document Type: Article

References (78)

1. The finitary projection model for second order lambda calculus and solutions to higher order domain equations
2. Semantics for classical automath and related systems
3. A filter lambda model and the completeness of type assignment
4. Recursive models for constructive set theories
5. Lambda calculus with constrained types
6. Inheritance and explicit coercion
7. Provable isomorphisms and domain equations in models of typed languages
8. A modest model of records, inheritance and bounded quantification
9. A completeness theorem for second-order polymorphic lambda calculus
10. On understanding types, data abstraction, and polymorphism
11. Type inference and logical relations
12. The calculus of constructions
13. Domain-theoretic models of polymorphism
14. A survey of the project Automath
15. On the semantics of data type
16. The expressiveness of simple and second order type structures
17. On the notion of strong typing
18. Equality between functionals
19. Interpretation fonctionelle et élimination des coupures de l'arithmétique d'ordre supérieur
20. The system F of variable types, fifteen years later
21. A theory of data type representation independence
22. Completeness in the theory of types
23. The completeness theorem for typing lambda terms
24. Models of the lambda calculus
25. Interpretation of analysis by means of constructive functionals of finite types
26. From lambda calculus to Cartesian closed categories
27. A correspondence between Algol 60 and Church's lambda notation
28. A correspondence between Algol 60 and Church's lambda notation
29. Polymorphic type inference
30. Structural semantics for polymorphic types
31. CLU Reference Manual
32. A semantic model of types for applicative languages
33. An ideal model for recursive polymorphic types
34. Bounded quantifiers have interval models
35. About models for intuitionistic type theories and the notion of definitional equality
36. An Investigation of a Programming Language with a Polymorphic Type Structure
37. The typechecking of programs with implicit type structure
38. Relating models of polymorphism
39. What is a model of the lambda calculus?
40. Type is not a type
41. Empty types in polymorphic lambda calculus
42. Fully abstract models of typed lambda calculi
43. A theory of type polymorphism in programming
44. Coercion and type inference (Summary)
45. Semantic models for second-order lambda calculus
46. Abstract types have existential types
47. Second-order logical relations
48. Representation independence and data abstraction
49. A type-inference approach to reduction properties and semantics of polymorphic expressions
50. Kripke-style models for typed lambda calculus
51. Polymorphic type inference and containment
52. Effective operations on partial recursive functions
53. Polymorphism is set-theoretic, constructively
54. LCF considered as a programming language
55. Towards a theory of type structure
56. The essence of algol
57. Types, abstraction, and parametric polymorphism
58. Polymorpism is not set-theoretic
59. Continuity and Effectiveness in Topoi
60. Data types as lattices
61. Data types as objects
62. The typed lambda calculus is not elementary recursive
63. Number theoretic functions computable by polymorphic programs
64. Equality between functionals, revisited
65. From denotational to operational and axiomatic semantics for algol-like languages: An overview
66. Mathematical Investigation of Intuitionistic Arithmetic and Analysis