Finitary PCF is not decidable (1996)

Cached

Download Links

by Ralph Loader
Venue:Theoretical Computer Science
Citations:25 - 0 self

Documents Related by Co-Citation

395 LCF considered as a programming language – G Plotkin - 1977
192 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
200 On full abstraction for PCF – J M E Hyland, C H L Ong
31 Kripke Logical Relations and PCF – Peter W. O'Hearn, Jon G. Riecke - 1995
86 Sequential algorithms on concrete data structures – G Berry, P-L Curien - 1982
27 Fully abstract models of typed λ-calculi – R Milner - 1977
36 The sequentially realizable functionals – John Longley
6 A relative PCF-definability result for strongly stable functions and some corollaries – T Ehrhard - 1999
49 Fully abstract semantics for observably sequential languages – Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen - 1994
32 A Semantic analysis of control – James David Laird - 1998
118 A fully abstract game semantics for general references – S Abramsky, K Honda, G McCusker - 1998
32 Reasoning about sequential functions via logical relations – K Sieber - 1992
110 Fully abstract models of typed lambda calculi – R Milner - 1977
461 Domain Theory – Samson Abramsky, Achim Jung - 1994
48 A type-theoretical alternative to ISWIM – D S Scott - 1993
35 Concrete Domains – Gilles Kahn, Inria Sophia Antipolis, Gordon D. Plotkin, George Gratzer - 1993
10 Ehrhard T., “A theory of sequentiality – A Bucciarelli - 1993
52 Sequentiality and Strong Stability – A Bucciarelli, T Ehrhard - 1991
39 Observable Sequentiality and Full Abstraction – Robert Cartwright, Matthias Felleisen - 1992