An Axiomatisation of Computationally Adequate Domain Theoretic Models of FPC (1994)

by Marcelo P. Fiore , Gordon D. Plotkin
Citations:34 - 6 self

Documents Related by Co-Citation

730 Notions of Computation and Monads – Eugenio Moggi - 1991
62 Axiomatic Domain Theory in Categories of Partial Maps – M P Fiore - 1994
92 Algebraically complete categories – P Freyd - 1990
395 LCF considered as a programming language – G Plotkin - 1977
99 Relational Properties of Domains – Andrew M. Pitts - 1996
43 New Foundations for Fixpoint Computations: FIX-Hyperdoctrines and the FIX-Logic – R L Crole, A M Pitts - 1990
134 Games and Full Abstraction for the Lazy lambda-calculus – Samson Abramsky, Guy Mccusker - 1995
192 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
68 Recursive Types Reduced to Inductive Types – P Freyd - 1990
169 The category-theoretic solution of recursive domain equations – M B Smyth, G D Plotkin - 1982
62 Remarks on algebraically compact categories – P J Freyd - 1991
28 Full abstraction in the lazy -calculus – S Abramsky, L Ong - 1989
427 Introduction to Higher Order Categorical Logic – J Lambek, P Scott - 1986
267 Semantics of Programming Languages: Structures and Techniques. Foundations of Computing Series – C Gunter - 1992
60 Realizability Toposes and Language Semantics – J Longley - 1994
105 Functional Programming and Input/Output – Andrew D Gordon - 1993
121 Bisimilarity as a theory of functional programming – A D Gordon
23 The lazy -calculus – S Abramsky - 1990
28 Lectures on Predomains and Partial Functions. Notes for a course at CSLI – G D Plotkin - 1985