|
213
|
Domain Theory in Logical Form
– Samson Abramsky
- 1991
|
|
402
|
Domain Theory
– Samson Abramsky, Achim Jung
- 1994
|
|
115
|
A domain equation for bisimulation
– S Abramsky
- 1991
|
|
87
|
Full Abstraction for a Simple Parallel Programming Language
– M. C. B. Hennessy, G. D. Plotkin
- 1979
|
|
45
|
Local compactness and continuous lattices
– K H Hofmann, M W Mislove
- 1981
|
|
196
|
A powerdomain construction
– G. D. Plotkin
- 1976
|
|
93
|
Topology via Logic
– S Vickers
- 1989
|
|
815
|
Categories for the Working Mathematician
– S Mac Lane
- 1971
|
|
57
|
Post-graduate lecture notes in advanced domain theory (incorporating the “Pisa Notes
– G Plotkin
- 1981
|
|
303
|
A Compendium of Continuous Lattices
– G Gierz, K Hofmann, K Keimel, J Lawson, M Mislove, D Scott
- 1980
|
|
127
|
Games and Full Abstraction for the Lazy lambda-calculus
– Samson Abramsky, Guy Mccusker
- 1995
|
|
103
|
Fully abstract models of typed lambda-calculi
– Robin Milner
- 1977
|
|
363
|
LCF considered as a programming language
– Gordon D Plotkin
- 1977
|
|
23
|
domains and predicate transformers: A topological view
– Power
- 1983
|
|
448
|
Algebraic laws for nondeterminism and concurrency
– Matthew Hennessy, Robin Milner
- 1985
|
|
2970
|
Communication and Concurrency
– R Milner
- 1989
|
|
909
|
Introduction to Lattices and Order
– B A Davey, H A Priestley
- 1990
|
|
1310
|
A disciplne of programming
– E W Dijkstra
- 1976
|
|
58
|
A Per Model of Polymorphism and Recursive Types
– M. Abadi, G. D. Plotkin
- 1990
|
