Domain-theoretic foundations of functional programming

Domain-Theoretic Foundations of Functional Programming

Volumn , Issue , 2006, Pages 1-121

  Streicher, Thomas ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAMMING THEORY; SEMANTICS;

DOMAIN-THEORETIC FOUNDATION; DOMAIN-THEORETIC SEMANTICS; KERNEL LANGUAGES; KRIPKE LOGICAL RELATIONS; LOGICAL RELATIONS; MATHEMATICAL PROPERTIES; PARALLEL LANGUAGES; RECURSIVE DOMAINS;

FUNCTIONAL PROGRAMMING;

EID: 84967642601     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/6284     Document Type: Book

References (35)

1. S. Abramsky, R. Jagadeesan, P. Malacaria Full Abstraction for PCF Inform, and Comput. 163, no. 2, 409-470 (2000).
2. R. Amadio and P.-L. Curien Domains and λ-Calculi. Cambridge Univ. Press (1998).
3. A. Asperti Stability and computability in coherent domains. Inform, and Comput. 86, no. 2, 115-139 (1990).
4. H. Barendregt The Lambda Calculus. Its Syntax and Semantics. North Holland (1981).
5. M. Barr and Ch. Wells Category theory for computing science. Prentice Hall International (1990).
6. G. Berry Modèles complètement adéquats et stables des lambda calculs typés Thése d’ Etat, Université Paris 7 (1979).
7. M. H. Escardó PCF extended with real numbers: a domain-theoretic approach to higher-order exact real number computation. PhD Thesis, Imperial College, Univ. of London (1997).
8. E. Griffor, I. Lindström and V. Stoltenberg-Hansen Mathematical Theory of Domains. Cambridge Univ. Press (1994).
9. J. M. E. Hyland First steps in synthetic domain theory, in Category Theory (Como 1990) pp.131-156, Lecture Notes in Math. 1488 Springer, Berlin, 1991.
10. M. Hyland, L. Ong On Full Abstraction for PCF; I, II and III. Inform, and Comput. 163, no. 2, pp.285-408 (2000).
11. A. Kanda, D. Park When are two effectively given domains identical? pp. 563-577, LNCS 67, Springer, Berlin-New York, 1979.
12. U. de’Liguoro PCF definability via Kripke logical relations (after O’Hearn and Riecke) Lab. Inf. ENS, Report LIENS-96-7, Paris (1996).
13. R. Loader Finitary PCF is not decidable TCS 266, no. 1-2, pp. 341-364 (2001).
14. J. Longley Sequentially Realizable Functionals APAL 117, no. 1-3, pp. 1-93 (2002).
15. S. MacLane Categories for the Working Mathematician Second edition. Graduate Texts in Mathematics 5, Springer (1998).
16. M. Marz A Fully Abstract Model for Sequential Computation PhD Thesis, TU Darmstadt (2000) electronically available from www.mathematik.tu-darmstadt.de/~streicher/THESES/marz.ps.gz
17. G. McCusker Games and full abstraction for a functional metalanguage with recursive types. CPHC/BCS Distinguished Dissertations, Springer Verlag London (1998).
18. R. Milner Fully Abstract Models of Typed X-Calculi TCS 4, pp. 1-22 (1977).
19. D. Normann On sequential functionals of type 3 to appear in Math. Struct. Cornput. Sc. as part of a Festschrift for K. Keimel (2006).
20. G. Plotkin LCF considered as a programming language TCS 5, pp. 223-255 (1977).
21. ω as a universal domain J. Comput. System Sci. 17 (1978), no. 2, 209-236.
22. P. O’Hearn, J. Riecke Kripke logical relations and PCF Inf. and Comp. 120, no. 1, pp. 107-116 (1995).
23. B. Reus, T. Streicher General synthetic domain theory-a logical approach. Math. Structures Comput. Sci. 9, no. 2, pp. 177-223 (1999).
24. J. Riecke, A. Sandholm A relational account of call-by-value sequentiality Inf. and Comp. 179, no. 2, pp. 296-331 (2002).
25. nd edition, MIT Press, Cambridge, MA, 1987.
26. A. Rohr A Universal Realizability Model for Sequential Computation. PhD Thesis, TU Darmstadt (2002) electronically available from www.mathematik.tu-darmstadt.de/~streicher/THESES/rohr.ps.gz
27. Dana S. Scott A type-theoretical alternative to ISWIM, CUCH, OWHY unpublished paper from 1969 reprinted in Bohm Festschrift TCS 121 №1-2, pp. 411-440 (1993).
28. Dana S. Scott Relating theories of the X-calculus in To H. B. Curry: essays on combinatory logic, lambda calculus and formalism pp. 403-450 Academic Press, London-New York (1980).
29. K. Sieber Reasoning about sequential functions via logical relations in Applications of category theory in computer science pp.258-269 London Math. Soc. Lecture Note Ser., 177, CUP (1992).
30. A. Simpson Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory. Ann. Pure Appl. Logic 130, no. 1-3, pp. 207-275 (2004).
31. A. Stoughton Equationally fully abstract models of PCF Proc. of Fifth International Conference on the Mathematical Foundations of Computer Science Springer Lecture Notes in Comput. Sci. 442, pp.271-283 (1990)
32. T. Streicher A universality theorem for PCF with recursive types, parallel-or and 3. Math. Struct. Comput. Sc. 4, no. 1, pp.111-115 (1994).
33. T. Streicher, B. Reus Classical logic, continuation semantics and abstract machines. J. Funct. Programming 8 (1998), no. 6, 543-572.
34. P. Taylor The fixed point property in synthetic domain theory, in Proc. 6th IEEE Symposium on Logic in Computer Science, pp.152-160 (1991).
35. G. Winskel The formal semantics of programming languages. An introduction. MIT Press, Cambridge MA (1993).