Domain Theory in Logical Form (1991)

by Samson Abramsky
Venue:Annals of Pure and Applied Logic
Citations:230 - 10 self

Documents Related by Co-Citation

155 The Lambda Calculus: its Syntax and Semantics. North-Holland, Amsterdam, revised edition – H P Barendregt - 1984
239 The Lazy Lambda Calculus – Samson Abramsky - 1990
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
123 A domain equation for bisimulation – S Abramsky - 1991
395 LCF considered as a programming language – G Plotkin - 1977
1065 Introduction to lattices and order – B A Davey, H A Priestley - 2002
312 Calculi for synchrony and asynchrony – R Milner - 1983
495 Algebraic laws for nondeterminism and concurrency – Matthew Hennessy, Robin Milner - 1985
52 Extended type structure and filter lambda models – M Coppo, M Dezani-Ciancaglini, F Honsell, G Longo - 1984
103 Topology via Logic – Steven Vickers - 1989
40 Domain Theory and the Logic of Observable Properties – Samson Abramsky - 1987
90 Full Abstraction for a Simple Parallel Programming Language – M. C. B. Hennessy, G. D. Plotkin - 1979
130 Lambda-Calculus Models of Programming Languages – J H Morris - 1968
102 Parametricity and Local Variables – P. W. O'hearn, R. D. Tennent - 1995
730 Notions of Computation and Monads – Eugenio Moggi - 1991
210 Games and Full Completeness for Multiplicative Linear Logic – Samson Abramsky, Radha Jagadeesan - 1994
267 Semantics of Programming Languages: Structures and Techniques. Foundations of Computing Series – C Gunter - 1992
43 New Foundations for Fixpoint Computations: FIX-Hyperdoctrines and the FIX-Logic – R L Crole, A M Pitts - 1990
59 Hypercoherences: A Strongly Stable Model of Linear Logic – Thomas Ehrhard - 1993