Least fixpoints as meanings of recursive definitions.
|
751
|
Introduction to Lattices and Order
– Davey, Priestley
- 1991
|
|
280
|
A Compendium of Continuous Lattices
– Gierz, Hoffmann, et al.
- 1980
|
|
246
|
An initial algebra approach to the specification, correctness, and implementation of abstract data types’, in: Current Trends in Programming Methodology, edited by R.T
– Goguen, Thatcher, et al.
|
|
234
|
Semantics of Programming Languages: Structures and Techniques. Foundations of Computing
– Gunter
- 1992
|
|
197
|
The lazy lambda calculus
– Abramsky
- 1977
|
|
194
|
Domain theory in logical form
– Abramsky
|
|
166
|
Games and full completeness for multiplicative linear logic
– Abramsky, Jagadeesan
- 1994
|
|
149
|
An Introduction to Inductive Definitions
– Aczel
- 1977
|
|
129
|
Semantic domains
– Gunter, Scott
- 1990
|
|
122
|
The system F of variable types, fifteen years later
– Girard
- 1986
|
|
116
|
Full abstraction in the lazy lambda calculus
– Abramsky, Ong
- 1993
|
|
111
|
The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition
– Barendregt
- 1984
|
|
104
|
A Domain Equation for Bisimulation
– Abramsky
- 1991
|
|
85
|
Algebraically complete categories
– Freyd
- 1990
|
|
82
|
Full abstraction for a simple parallel programming language
– Hennessy, Plotkin
- 1979
|
|
71
|
Categorical Combinators, Sequential Algorithms and Functional Programming, Birkh ' 'auser, second edition
– Curien
- 1993
|
|
63
|
New foundations for the geometry of interaction
– Abramsky, Jagadeesan
- 1994
|
|
62
|
Dynamical systems, measures and fractals via domain theory
– Edalat
- 1995
|
|
57
|
Using powerdomains to generalize relational databases
– Buneman, Ohori
- 1989
|
|
56
|
Remarks on algebraically compact categories
– Freyd
- 1992
|
|
51
|
Domain theory and integration
– Edalat
- 1995
|
|
51
|
Hypercoherences: a strongly stable model of linear logic
– Ehrhard
|
|
50
|
A per model of polymorphism and recursive types
– Abadi, Plotkin
- 1990
|
|
48
|
Abtract interpretation, logical relations and Kan extensions
– Abramsky
- 1990
|
|
47
|
Local compactness and continuous lattices
– Hofmann, Mislove
- 1981
|
|
45
|
A fully abstract denotational model for higher-order processes
– Hennessy
- 1993
|
|
42
|
DI-domains as a model of polymorphism
– Coquand, Gunter, et al.
- 1987
|
|
41
|
New foundations for fixpoint computations: Fixhyperdoctrines and the fix-logic
– Crole, Pitts
- 1992
|
|
37
|
Domain Theory and the Logic of Observable Properties
– Abramsky
- 1987
|
|
36
|
A theory of programs
– Scott, Bakker
- 1969
|
|
35
|
Interaction categories and communicating sequential processes
– Abramsky
- 1994
|
|
35
|
Abramsky S. The theory of strictness analysis for higher order functions
– Burn, Hankin
- 1985
|
|
34
|
De operations in general algebras, and the theory of automata and charts, Programming Languages and Their De LNCS
– Bekic
- 1984
|
|
33
|
Lambda-Calculi for (strict) Parallel Functions. Rapport de Recherche INRIA
– Boudol
- 1387
|
|
31
|
Automata and Algebras in Categories
– Adámek, Trnková
- 1990
|
|
29
|
Stable models of typed -calculi
– Berry
- 1978
|
|
27
|
A semantics for complex objects and approximate queries
– Buneman, Davidson, et al.
- 1988
|
|
22
|
Extensional PERs
– Freyd, Mulry, et al.
- 1990
|
|
22
|
Power domain constructions
– Heckmann
- 1991
|
|
19
|
Two families of languages related to ALGOL
– Ginsburg, Rice
- 1962
|
|
17
|
A Generalized Kahn Principle for Abstract Asynchronous Networks
– Abramsky
|
|
16
|
The mixed powerdomain
– Gunter
- 1992
|
|
12
|
Categories of embeddings
– Coquand
- 1988
|
|
12
|
Power domains and second order predicates
– Heckmann
- 1993
|
|
11
|
Fundamentals of Algebraic Specification 1, volume 6
– Ehrig, Mahr
- 1985
|
|
9
|
Modèles complement adéquats et stables des λ-calculs typés, Thèse de Doctorat d’Etat
– Berry
- 1979
|
|
7
|
Retractions on dI-domains as a model for type:type
– Berardi
- 1991
|
|
7
|
Universal domains and the amalgamation property
– Droste, Gobel
- 1993
|
|
7
|
Coherence and consistency in domains
– Gunter, Jung
- 1988
|
|
7
|
The largest first-order axiomatizable cartesian closed category of domains
– Gunter
- 1986
|