From Operational Semantics to Domain Theory

Information and Computation

Volumn 128, Issue 1, 1996, Pages 26-47

  Mason, Ian A ^a   Smith, Scott F ^b   Talcott, Carolyn L ^c  

^a UNIVERSITY OF NEW ENGLAND   (Australia)

^b JOHNS HOPKINS UNIVERSITY   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003056910     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0061     Document Type: Article

References (28)

1. Abadi, M., Cardelli, L., Pierce, B., and Plotkin, G. (1991a), Dynamic typing in a statically typed language, Trans. Programming Languages Systems 13(2), 237-268.
2. Abadi, M., Pierce, B., and Plotkin, G. (1991b), Faithful ideal models for recursive polymorphic types, Int. J. Foundations Comput. Sci. 2(1), 1-21.
3. Abramsky, S. (1990), The lazy lambda calculus, in "Research Topics in Functional Programming," pp. 65-116, Addison-Wesley, Reading, MA.
4. Bloom, B. (1990), Can LCF be topped? Inform. and Comput. 87, 264-301.
5. deBakker, J. W., and Scott, D. (1969), A theory of programs, unpublished notes.
6. Felleisen, M., Friedman, D., and Kohlbecker, E. (1987), A syntactic theory of sequential control, Theoret. Comput. Sci. 52, 205-237.
7. Gordon, A. D. (1994), "Functional Programming and Input/Output," Cambridge Univ. Press, London/New York.
8. Honsell, F., Mason, I. A., Smith, S. F., and Talcott, C. L. (1995), A variable typed logic of effects, Inform. and Comput. 119(1), 55-90.
9. Howe, D. J. (1989), Equality in lazy computation systems, in "Proceedings of the Fourth Annual Symposium on Logic in Computer Science," pp. 198-203, IEEE Press, New York.
10. Howe, D. J. (1995), Proving congruence of bisimulation in functional programming languages, preprint.
11. Hyland, J. M. E. (1976), A survey of some useful partial order relations on terms of the lambda calculus, in "Lambda Calculus and Computer Science Theory" (C. Boehm, Ed.), pp. 83-93, Lecture Notes in Computer Science, Vol. 37, Springer-Verlag, Berlin/New York.
12. Igarashi, S. (1972), "Admissibility of Fixed-Point Induction in First-Order Logic of Typed Theories," Technical Report Stan-CS-72-287, Stanford University Computer Science Department.
13. Jim, T., and Meyer, A. (1991), Full abstraction and the context lemma, in "Theoretical Aspects of Computer Science," pp. 131-151, Lecture Notes in Computer Science, Vol. 526, Springer-Verlag, Berlin/New York.
14. MacQueen, D. B., Plotkin, G., and Sethi, R. (1984), An ideal model of types, in "Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages."
15. Manna, Z. (1974), "Mathematical Theory of Computation," McGraw-Hill, New York.
16. Mason, I. A., and Talcott, C. L. (1991), Equivalence in functional languages with effects, J. Functional Programming 1, 287-327.
17. Meyer, A. R. (1982), What is a model of the lambda calculus? Inform. and Comput. 52, 87-122.
18. Milner, R. (1977), Fully abstract models of types λ-calculi, Theoret. Comput. Sci. 4, 1-22.
19. Ong, C.-H. L. (1988), Fully abstract models of the lazy lambda calculus, in "Symposium on the Foundations of Computer Science," pp. 368-376.
20. Ong, C.-H. L. (1992), The concurrent lambda calculus. I. A general precongruence theorem for applicative bisimulation, in "Proceedings on Seminars on Parallel Programming Systems," Department of Information Systems and Computer Science, National University of Singapore.
21. Paulson, L. C. (1987), "Logic and Computation: Interactive Proof with Cambridge LCF," Cambridge Univ. Press, London/New York.
22. Pitts, A. M. (1994), A co-induction principle for recursively defined domains, Theoret. Comput. Sci. 124, 195-219.
23. Pitts, A. M., and Stark, I. D. B. (1993), Observable properties of higher order functions that dynamically create local names, or: What's new? in "Mathematical Foundations of Computer Science, Proc. 18th Int. Symp., Gdańsk, 1993," pp. 122-141, Lecture Notes in Computer Science, Vol. 711, Springer-Verlag, Berlin.
24. Ritter, E., and Pitts, A. M. (1995), A fully abstract translation between a λ-calculus with reference types and standard ml, in "2nd Int. Conf. on Typed Lambda Calculus and Applications, Edinburgh, 1995," pp. 397-413, Lecture Notes in Computer Science, Vol. 902, Springer-Verlag, Berlin.
25. Smith, S. F. (1992), From operational to denotational semantics, in "MFPS 1991," pp. 54-76, Lecture Notes in Computer Science, Vol. 598, Springer-Verlag, Berlin/New York.
26. Stoughton, A. (1988), "Fully Abstract Models of Programming Languages," Research Notes in Theoretical Computer Science," Pitman, London.
27. Talcott, C. L. (1985), "The Essence of Rum: A Theory of the Intensional and Extensional Aspects of Lisp-Type Computation," Ph.D. thesis, Stanford University.
28. ∞ models of the λ-calculus, SIAM J. Comput.