Full abstraction, totality and PCF

Mathematical Structures in Computer Science

Volumn 9, Issue 1, 1999, Pages 1-20

  Plotkin, Gordon ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002118997     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129598002692     Document Type: Article

References (38)

1. Abramsky, S. (1990) Abstract interpretation, logical relations and Kan extensions. Journal of Logic and Computation 1 (1) 5–39.
2. Abramsky, S., Jagadeesan, R. and Malacaria, P. (1995) Games and full abstraction for PCF. Manuscript available from the site http://www.dcs.ed.ac.uk. Also, to appear in J. of Inf. and Comp.
3. Abramsky, S. and Jung, A. (1994) Domain theory. In: Abramsky, S., Gabbay, D. and Maibaum, T. S. E. (eds.) Handbook of Logic in Computer Science 3, Clarendon Press 1–168.
4. Barendregt, H. (1984) The Lambda Calculus, North-Holland.
5. Berger, U. (1990) Totale Objecte und Mengen in der Bereichstheorie, Ph. D. Thesis, Department of Mathematics, Ludwig-Maximilians-Universitat Munchen, Munich, Germany.
6. Berger, U. (1993) Total objects and sets in domain theory. Annals of Pure and Applied Logic 60 91–117.
7. Berger, U. (1997) Continuous Functionals of Dependent and Transfinite Types, Habilitationsschrift, Department of Mathematics, Ludwig-Maximilians-Universitat Miinchen Munich, Germany.
8. Berry, G., Curien, P.-L. and Levy, J.-J. (1985) Full abstraction for sequential languages: the state of the art. In: Nivat, M. and Reynolds, J. C. (eds.) Algebraic Methods in Semantics, Cambridge University Press 89–132. Cook, S. A. (1989) Computability and complexity of higher type functions. In: Moschovakis, Y. (ed.) Logic from Computer Science, Springer-Verlag 51–72.
9. Coppo, M., Damiani, F. and Giannini, P. (1997) On strictness and totality. In: Abadi, M. and Ito, T. (eds.) Proc. Third Int. Sym. on Theoretical Aspects of Computer Software. Springer-Verlag Lecture Notes in Computer Science 1281 138–164.
10. Denney, E. (1998) Refinement types for specification. In: Gries, D. and de Roever, W.-P. (eds.) Proc. Programming Concepts and Methods ’98, Chapman and Hall 148–166.
11. Ershov, Y. L. (1974) Maximal and everywhere-defined functionals. Algebra i Logika 13 (4) 347–392.
12. Ershov, Y. L. (1975) Theorie der numerierungen II. Zeitschr. f Math. Logik u. Grundl. d. Math. 21 473–584.
13. Ershov, Y. L. (1976) Hereditarily effective operations. Algebra i Logika 15 (6) 642–654.
14. Ershov, Y.L. (1977) Model C of partial continuous functionals. In: Gandy, R.O. and Hyland, J. M. E. (eds.) Logic Colloquium 76, North Holland 455–467.
15. Fiore, M.P., Jung, A., Moggi, E., O’Hearn, P., Riecke, J., Rosolini, G. and Stark, I. (1996) Do-mains and denotational semantics: history, accomplishments and open problems. Bulletin of the European Association for Theoretical Computer Science (59) 227–256.
16. Gandy, R. O. and Hyland, J. M. E. (1977) Computable and recursively countable functions of higher type. In: Gandy, R.O. and Hyland, J.M.E. (eds.) Logic Colloquium 76, North Holland 407–438.
17. Hyland, J. M. E. (1975) Recursion Theory on the Countable Functionals, D.Phil. thesis, Department of Mathematics, University of Oxford, Oxford, United Kingdom.
18. Hiyovhtyland, J. M. E. and Ong, C-H.L. (1994) On full abstraction for PCF: I, II and III. Manuscript avail-able by ftp in directory /pub/Documents/techpapers/Luke.Ong/pcf.ps.gz. at ftp.comlab.ox.ac.uk.
19. Kapron, B. M. and Cook, S.A. (1996) A new characterization of type-2 feasibility. SIAM J. on Computing 25 (1) 117–132.
20. Kristiansen, L. and Normann, D. (1995) Semantics for some constructors of type theory. In: Behara, M., Fritsch, R. and Lintz, R. (eds.) Symposia Gaussiana, de Gruyter 201–224.
21. Kristiansen, L. and Normann, D. (1997) Total objects in inductively defined types. Arch. Math. Logic 36 405–436.
22. Loader, R. (1997) Equational theories for inductive types. Annals of Pure and Applied Logic 84 175–217.
23. Longley, J. and Plotkin, G. (1998) Logical full abstraction and PCF. In: Ginzburg, J., Khasidashvili, Z., Vogel, C., Levy, J.-J. and Vallduvi, E. (eds.) Tbilisi Symposium on Logic, Language and Information: Selected Papers, CSLI 333–352.
24. Longo, G. and Moggi, E. (1984) The hereditarily partial effective functionals and recursion theory in higher types. Journal of Symbolic Logic 49 1319–1332.
25. Milner, R. (1977) Fully abstract models of typed 2-calculi. Theoretical Comp. Sci. 4 1–22.
26. Mitchell, J. (1996) Foundations for Programming Languages, MIT Press.
27. Nickau, H. (1996) Hereditarily Sequential Functionals: A Game-Theoretic Approach to Sequentiality, Ph. D. Thesis, Department of Mathematics, Universitat Siegen, Siegen, Germany. Shaker Verlag.
28. Normann, D. (1996) A hierarchy of domains with totality, but without density. In Cooper, S. B., Slaman, T. A. and Wainer, S. S. (eds.) Computability, Enumerability, Unsolvability, Cambridge University Press 233–257.
29. Normann, D. (1997) Categories of Domains with Totality. Preprint No. 4, Department of Mathe-matics, University of Oslo, Oslo, Norway.
30. Normann, D. (1997) Closing the gap between the continuous functionals and recursion in 3E. Arch. Math. Logic 36 269–287.
31. Normann, D. (1998) The continuous functionals. To appear in Griffor, E. R. (ed.) Handbook of Computability Theory, Elsevier. Plotkin, G. (1977) LCF considered as a programming language. Theoretical Comp. Sci. 5 223–255.
32. Scott, D. (1976) Data types as lattices. SIAM J. Comput. 5 522–587.
33. Scott, D. (1993) A type-theoretical alternative to CUCH, ISWIM and OWHY. In: Logic, Semantics and Theory of Programming. Theoretical Comp. Sci. 121 (1,2) 411–440.
34. Stoltenberg-Hansen, V., Lindstrom, I. and Griffor, E. R. (1994) Mathematical Theory of Domains, Cambridge University Press.
35. Stoughton, A. (1991) Interdefinability of parallel operations in PCF. Theoretical Comp. Sci. 79 357–358.
36. Troelstra, A. S. (1973) Metamathematical Investigations of Intuitionistic Arithmetic and Analysis. Springer-Verlag Lecture Notes in Mathematics 344.
37. Waagbo, G. (1998) Denotational semantics for intuitionistic type theory using a hierarchy of domains with totality. To appear in Arch. Math. Logic.
38. Winskel, G. (1993) The Formal Semantics of Programming Languages, MIT Press.