Invariance of interpretation by β-conversion is one of the minimal requirements for any standard model for the λ-calculus. With the intersection type systems being a general framework for the study of semantic domains for the λ-calculus, the present paper provides a (syntactic) characterisation of the above mentioned requirement in terms of characterisation results for intersection type assignment systems. Instead of considering conversion as a whole, reduction and expansion will be considered separately. Not only for usual computational rules like β, η, but also for a number of relevant restrictions of those. Characterisations will be also provided for (intersection) filter structures that are indeed λ-models. 1
|
894
|
The lambda calculus, its syntax and semantics
– Barendregt
- 1984
|
|
292
|
A Compendium of Continuous Lattices
– Gierz, Hofmann, et al.
- 1980
|
|
188
|
A filter lambda model and the completeness of type assignment
– Barendregt, Coppo, et al.
- 1983
|
|
186
|
Domain theory in logical form
– Abramsky
- 1987
|
|
120
|
Full abstraction in the lazy lambda calculus
– Abramsky, Ong
- 1993
|
|
105
|
Continuous lattices
– Scott
- 1972
|
|
87
|
Complete restrictions of the Intersection Type Discipline
– Bakel
- 1992
|
|
77
|
Topology via logic
– Vickers
- 1989
|
|
53
|
spaces
– Stone
- 1982
|
|
44
|
Extended Type Structures and Filter Lambda Models
– Coppo, Dezani-Ciancaglini, et al.
- 1984
|
|
41
|
Combinatory Logic, Volume I
– Curry, Feys
- 1958
|
|
35
|
Lambda-calculus models and extensionality
– Hindley, Longo
- 1980
|
|
34
|
Functional Character of Solvable Terms
– Coppo, Dezani-Ciancaglini, et al.
- 1981
|
|
33
|
Set-theoretical and other elementary models of the λ-calculus
– Plotkin
- 1993
|
|
25
|
An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
– Honsell, Rocca, et al.
- 1992
|
|
18
|
Algebras and combinators
– Engeler
- 1981
|
|
14
|
Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science 1(2):125–159
– Plotkin
- 1975
|
|
13
|
Compositional characterization of λ-terms using intersection types
– Dezani-Ciancaglini, Honsell, et al.
- 2005
|
|
12
|
Type theories, normal forms, and D∞-lambda-models
– Coppo, Dezani-Ciancaglini, et al.
- 1987
|
|
12
|
Some results on the full abstraction problem for restricted lambda calculi
– Honsell, Lenisa
- 1993
|
|
10
|
Filter models and easy terms
– Alessi, Dezani-Ciancaglini, et al.
- 2001
|
|
10
|
denotational and logical descriptions: a case study
– Operational
- 1992
|
|
9
|
Simple easy terms
– Alessi, Lusin
- 2002
|
|
8
|
Open problem
– Scott
- 1975
|
|
7
|
A complete characterization of the complete intersection-type theories
– Dezani-Ciancaglini, Honsell, et al.
- 2000
|
|
6
|
Semantical analysis of perpetual strategies in λcalculus. Theoret
– Honsell, Lenisa
- 1999
|
|
6
|
The Y-combinator in Scott’s λ-calculus models (revised version). Theory of Computation Report
– Park
- 1976
|
|
4
|
Behavioural inverse limit models
– Dezani-Ciancaglini, Ghilezan, et al.
- 2003
|
|
3
|
Two behavioural lambda models
– Dezani-Ciancaglini, Ghilezan
- 2003
|
|
2
|
Intersection types and computational rules
– Alessi, Barbanera, et al.
- 2003
|
|
2
|
Intersection types and domain operators. Theoret
– Alessi, Dezani-Ciancaglini, et al.
- 2004
|
|
1
|
Tailoring filter models
– Alessi, Barbanera, et al.
- 2004
|
