Matching typed and untyped realizability

Electronic Notes in Theoretical Computer Science

Volumn 23, Issue 1, 1999, Pages 74-100

  Longley, John ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL MODELS; NUMBER THEORY; THEOREM PROVING;

COMPUTABILITY; FUNCTIONAL PROGRAMMING LANGUAGES; REAL NUMBERS; REALIZABILITY;

FORMAL LOGIC;

EID: 18944391648     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00105-7     Document Type: Conference Paper

References (32)

1. S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Accepted for publication, 1996
2. Beeson M. Foundations of Constructive Mathematics. 1985;Springer
3. A. Bucciarelli and T. Ehrhard. Sequentiality and strong stability. In Proc. 6th Annual Symposium on Logic in Computer Science, pages 138-145. IEEE, 1991
4. Cartwright R., Curien P.-L., Felleisen M. Fully abstract semantics for observably sequential languages. Information and Computation. 111:(2):1994;297-401
5. M.H. Escardo. A metric model of PCF. Draft paper, March 1999
6. J.M.E. Hyland. The effective topos. In The L.E.J. Brouwer Centenary Symposium. North-Holland, 1982.
7. J.M.E. Hyland, and C.-H.L. Ong. On full abstraction for PCF: I, II and III. Accepted for publication, 1996
8. R. Kanneganti, R. Cartwright, and M. Felleisen. SPCF: its model, calculus, and computational power. In Proc. REX Workshop on Semantics and Concurrency
9. Kleene S.C. On the interpretation of intuitionistic number theory. Journal of Symbolic Logic. 10:1945
10. Kleene S.C., Vesley R.E. The Foundations of Intuitionistic Mathematics. 1965;North-Holland
11. J. Laird. A Semantic Analysis of Control. Ph D thesis, University of Edinburgh, 1998. Examined March 1999.
12. J.R. Longley. Realizability Toposes and Language Semantics. Ph D thesis, University of Edinburg, 1995. Available as ECS-LFCS-95-332.
13. J.R. Longley. Realizability; models for sequential computation. In preparation; draft available from the author's home page, 1998.
14. J.R. Longley. The sequentially realizable functionals. Technical Report ECSLFCS-98-402, Department of Computer Science, University of Edinburgh, 1998. Submitted to Annals of Pure and Applicd Logic.
15. J.R. Longley. Unifying typed untyped realizability. Electronic note, available at http://www.dcs.ed.ac.uk/home/jrl/unifying.txt, 1999.
16. J.R. Longley. When is a functional program not a functional program not a functional program? Accepted for ICFP'99; available from the author's home page, 1999.
17. J.R Longley and G.D. Plotkin. Logical full abstraction and PCF. In J. Ginzburg et al., editor, Tbilisi Symposium on Languafge, Logic and Computation, pages 333-352. SiLLI/CSLI, 1997.
18. Longley J.R., Simpson A.K. A uniform approach to domain theory in realizability models. Mathematical Structures in Computer Science. 7:1997;469-505
19. M. Marz, A. Rohr, and T. Streicher. Full abstraction via realisability. In Proc. 14th Annual IEEE Symposium on SLogic in Computer Science, IEEE, 1999.
20. H. Nickau. Hereditarily sequential functionals. In Proc. 3rd Symposium on Logical Foundations of Computer Science, Lecture Notes in Computer Science 813, pafges 253-264. Springer, 1994.
21. C.-H.L. Ong and C.A. Stewart. A Curryk-Howard foundation for functional computation with control. In Proc. Symposium on Principles of Programming Languages, lkpages 215-227, ACM Press, 1997.
22. J. van Oosten. Extensional realizability. Technical Report ML-93-18, University of Amsterdam, ILLC, 1993.
23. J. van Oosten. A combinatory algebra for sequential functionals of finite type. Technical Report 996, University of Utrecht, 1997. To appear in Proc. Logic Colliquium, Leeds.
24. van Oosten J. The modified realizability topos. Journal of Pure and Applied Algebra. 116:(289):1997
25. Plotkin G.D. LCF considered as a programming language. Theoretical Computer Science. 5:1977;223-255
26. ω as a universal domain. Journal of Computer and System Sciences. 17:1978;209-236
27. G.D. Plotkin. Full abstraction, totality and PCF. Accepted for publication, 1997.
28. Rogers H. Theory of Recursive Functions and Effective Computability. 1967;McGraw-Hill
29. Scot D.S. continuous lattices. Lawvere F.W. Toposes, Algebraic Geometry and Logic. 1972;Springer
30. Scott D.S. Data types as lattices. SIAM Journal of Computing. 5:(3):1976;522-587
31. D.S. Scott. A type-theoretical alternative to ISWIM, CU8CH, OWHY. Theoretical Computer Science, 121:411-440, 1993. First written in 1969 and widely circulated in unpublished form since then.
32. Troelstra A.S. Metamathematical Inverstigation of Intutionjistic Arithmetic and Analysis. 1973;Springer