The Convex Powerdomain in a Category of Posets Realized By Cpos (1995)

Cached

Download Links

by Alex K. Simpson
Venue:In Proc. Category Theory and Computer Science
Citations:1 - 0 self

Documents Related by Co-Citation

2 Some combinatory algebras for sequential computation – S Abramsky, J R Longley - 2000
1 Typed realizability. Talk given at CTCS – S Abramsky - 1995
5 From term models to domains – W Phoa - 1994
6 A relative PCF-definability result for strongly stable functions and some corollaries – T Ehrhard - 1999
19 A Uniform Approach to Domain Theory in Realizability Models – John R. Longley, Alex K. Simpson - 1996
7 Naive Synthetic Domain Theory—A Logical Approach – B Reus, T Streicher - 1994
31 Kripke Logical Relations and PCF – Peter W. O'Hearn, Jon G. Riecke - 1995
22 Projecting Sequential Algorithms on Strongly Stable Functions – Thomas Ehrhard - 1993
21 A Combinatory Algebra for Sequential Functionals of Finite Type – Jaap Van Oosten - 1997
16 Constructive natural deduction and its !-set interpretation – G Longo, E Moggi - 1991
22 Interpretation of analysis by means of functionals of finite type – G Kreisel - 1959
49 Fully abstract semantics for observably sequential languages – Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen - 1994
36 The sequentially realizable functionals – John Longley
13 Domain Theory in Realizability Toposes – Wesley Phoa - 1990
60 Realizability Toposes and Language Semantics – J Longley - 1994
52 Sequentiality and Strong Stability – A Bucciarelli, T Ehrhard - 1991
28 Interprétation functionelle et élimination des coupures de l’arithmétique d’ordre supérieur – Jean-Yves Girard - 1972
10 Ehrhard T., “A theory of sequentiality – A Bucciarelli - 1993
155 The Lambda Calculus: its Syntax and Semantics. North-Holland, Amsterdam, revised edition – H P Barendregt - 1984