Abstract. Functional languages are based on the notion of application: programs may be applied to data or programs. By application one may define algebraic functions; and a programming language is functionally complete when any algebraic function f(x 1,...,x n) is representable (i.e. there is a constant a such that f(x 1,...,x
|
227
|
Interpretation Fonctionelle et Elimination des Coupures dans l'Arithmetique d'Ordre Superieure
– Girard
- 1972
|
|
183
|
The lambda calculus, its syntax and semantics. Revised edition edn
– Barendregt
- 1984
|
|
165
|
Data Types as Lattices
– Scott
- 1976
|
|
58
|
The effective topos
– Hyland
- 1982
|
|
51
|
Introduction to Combinators and Lambda Calculus
– Hindley, Seldin
- 1986
|
|
43
|
What is a Model of the Lambda Calculus
– Meyer
- 1982
|
|
38
|
D.: T! as a universal domain
– Plotkin
- 1978
|
|
37
|
Set Theoretical Models of Lambda Calculus: Theory, Expansions and Isomorphisms
– Longo
- 1983
|
|
35
|
Lambda-calculus models and extensionality
– Hindley, Longo
- 1980
|
|
24
|
Relating theories of the lambda calculus
– SCOTT
- 1980
|
|
15
|
Some ordered sets in computer science
– Scott
- 1981
|
|
14
|
Models of the lambda calculus
– Koymans
- 1982
|
|
13
|
Categories for the Working Mathematician, Springer-Verlag
– MacLane
- 1971
|
|
12
|
Constructive natural deduction and its modest interpretation
– Longo, Moggi
- 1988
|
|
12
|
On specifications, theories, and models with higher types
– Poign'e
- 1986
|
|
9
|
Partiality, cartesian closedness, and toposes
– Curien, Obtulowicz
- 1989
|
|
9
|
Adjunction of semifunctors: Categorical structures in non-extensional lambda-calculus
– Hayashi
- 1985
|
|
9
|
Cartesian Closed Categories of Enumerations for effective TypeStructures
– Longo, Moggi
- 1984
|
|
8
|
Effectively given domains and lambda-calculus models
– Giannini, Longo
- 1984
|
|
8
|
Introduction to Higher Order Categorial Logic
– Lambek, Scott
- 1986
|
|
6
|
Comparing some classes of lambda calculus models
– Barendregt, Koymans
- 1980
|
|
5
|
Categorial, Functorial and algebraic aspects of the typefree lambda-calculus
– Obtulowicz
- 1982
|
|
4
|
A categorical characterization of lambda calculus models
– Adachi
- 1983
|
|
4
|
The hereditary partial recursive functionals and recursion theory in higher types
– Longo
- 1984
|
|
3
|
A small complete category" Lecture delivered at the Conference Church's Thesis after 50 years
– Hyland
- 1987
|
|
3
|
Limits, higher type computability and type free languages
– Longo
- 1984
|
|
3
|
Effectively given Domains." Theoret
– Smyth
- 1976
|
|
2
|
Categories of partial morphisms and the relation between typestructures " Lecture delivered at the Semester on theory
– Asperti, Longo
- 1988
|
|
2
|
The lambda calculus and its models
– Barendregt
- 1982
|
|
2
|
G��del numberings, principal morphisms, combinatory algebras" Prelim. version of this paper
– Longo, Moggi
- 1984
|
|
2
|
Modelli non estensionali del polimorfismo in programmazione funzionale" Tesi di Dottorato
– Martini
- 1988
|
|
1
|
Categories for denotational semantics: category theory for the working computer scientist
– Asperti, Longo
- 1989
|
|
1
|
Can Programming be liberated of the Von Neumann style? A functional style and its algebra of programs
– Backus
- 1978
|
|
1
|
1986], Berechenbarkeit in Hoheren Typen Nach Einem Ansatz Von Ju.L. Ersov, dissertation Munchen
– Berger
|
|
1
|
Some Syntactic and Categorial Constructions of lambda-calculus models
– Berry
- 1979
|
|
1
|
On Combinatory Algebras and their expansions
– Bruce, Longo
- 1984
|
|
1
|
Categorical Combinators" Info.&Co
– Curien
- 1986
|
|
1
|
Theorie der Numerierungen I", Zeitschr, f. math. Logik und Grundl. d
– Ershov
- 1973
|
|
1
|
Logik und Grundl. d
– Ershov
- 1975
|
|
1
|
Model C of the partial continuous functionals," Logic Colloquium 76
– unknown authors
- 1976
|
|
1
|
From lamba-calculus to cartesian closed categories
– Lambek
- 1980
|
|
1
|
G.(1987) "On Church's Formal Theory of functions and functionals," Lecture delivered at the Conference Church's Thesis after 50 years, Zeiss (NL
– Longo
- 1986
|
|
1
|
1988] "Categories of partial maps
– Robinson, Rosolini
|
|
1
|
Theory of recusive functions and effective computability, MacGraw
– Rogers
- 1967
|
