A fully abstract semantics for a higher-order functional language with nondeterministic computation

Theoretical Computer Science

Volumn 228, Issue 1-2, 1999, Pages 105-150

  Jeffrey, Alan ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

Category theory; Programming languages; Semantics

Indexed keywords

EID: 0348194684     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00356-9     Document Type: Article

References (37)

1. 8807, I. LOTOS - A formal description technique based on the temporal ordering of observational behaviour 1989.
2. S. Abramsky, The lazy lambda calculus, in: D. Turner (Ed.), Declarative Programming, Addison-Wesley, Reading, MA, 1989.
3. S. Abramsky, Domain theory in logical form, Ann. Pure Appl. Logic 51 (1991) 1-77.
4. S. Abramsky, A. Jung, Domain Theory. Handbook of Logic in Computer Science, Vol. III, Clarendon Press, 1994, pp. 1-168.
5. B.A. Davey, H.A. Priestley, Introduction to Lattices and Order, Cambridge University Press, Cambridge, 1990.
6. A. Gordon et al., A proposal for monadic I/O in Haskell 1.3. WWW document, Haskell 1.3 Committee, http://www.cl.cam.ac.uk/users/adg/io.html, 1994.
7. A. Gordon, Bisimilarity as a theory of functional programming, Proc. MFPS 95, Electronic Notes in Comp. Sci., vol. 1, Springer, Berlin, 1995.
8. M. Hennessy, Algebraic Theory of Processes, MIT Press, Cambridge, MA, 1988.
9. M. Hennessy, A denotational model for higher-order processes, Technical Report 6/92, University of Sussex, 1992.
10. M. Hennessy, A fully abstract denotational model for higher-order processes, Inform. Comput. 112 (1) (1994) 55-95.
11. M. Hennessy, R. Milner, On observing nondeterminism and concurrency, in: J.W. De Bakker, J. Van Leeuwen (Eds.), Proc. ICALP 80, Lecture Notes in Computer Science, vol. 85, Springer, Berlin, 1980.
12. M. Hennessy, G. Plotkin, Full abstraction for a simple parallel programming language, Proc. MFPS 79, Lecture Notes in Computer Science, vol. 74, Springer, Berlin, 1979.
13. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall, Englewood Cliffs, NJ, 1985.
14. D. Howe, Equality in lazy computation systems, Proc. LICS '89, IEEE Computer Society Press, Silverspring, MD, 1989, pp. 198-203.
15. D. Howe, Proving congruence of simulation orderings in functional languages, unpublished manuscript, 1992.
16. P. Hudak, S.L. Peyton Jones P. Wadler et al., A report on the functional language Haskell, SIGPLAN Notices, 1992.
17. A. Jeffrey, A fully abstract semantics for concurrent graph reduction: extended abstract, Proc. LICS '94, IEEE Computer Society Press, Silverspring, MD, 1994.
18. A. Jeffrey, A fully abstract semantics for a concurrent functional language with monadic types, Proc. LICS '95, IEEE Computer Society Press, Silverspring, MD, 1995, pp. 255-264.
19. P.T. Johnstone, Stone Spaces, Cambridge University Press, Cambridge, 1982.
20. D. Kozen, Results on the prepositional mu-calculus, Theoret. Comput. Sci. 27 (1983) 333-354.
21. J. Lambek, P.J. Scott, Introduction to Higher Order Categorical Logic, Cambridge University Press, Cambridge, 1986.
22. K.G. Larsen, J.C. Godskesen, M. Zeeberg, M. TAV, tools for automatic verification, user manual, Tech. Report R 89-19, Dept. Math, and Comp. Sci., Ålborg University, 1989.
23. S. Mac Lane, Categories for the Working Mathematician, Graduate Texts in Mathematics, Springer, Berlin, 1971.
24. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
25. M. Mislove, F. Oles, A simple language supporting angelic nondeterminism and parallel composition, Proc. MFPS 91, Lecture Notes in Computer Science, vol. 598, Springer, Berlin, 1992.
26. E. Moggi, Notions of computation and monad, Inform. Comput. 93 (1991) 55-92.
27. J.-H. Morris, Lambda calculus models of programming languages, Dissertation, MIT, Cambridge, MA, 1968.
28. C.-H.L. Ong, The lazy Lambda calculus: an investigation into the foundations of functional programming, Ph.D. Thesis, Imperial College, London University, 1988.
29. C.-H.L. Ong, Non-determinism in a functional setting, Proc. LICS '93, IEEE Computer Soc. Press, Silverspring, MD, 1993, pp. 275-286.
30. B.C. Pierce, Basic Category Theory for Computer Scientists, MIT Press, Cambridge, MA, 1991.
31. G. Plotkin, LCF considered as a programming language, Theoret. Comput. Sci. 5 (1977) 223-256.
32. G. Plotkin, Postgraduate lecture notes in advanced domain theory, including the 'Pisa notes', 1981.
33. J. Reppy, A higher-order concurrent langauge, Proc. SIGPLAN 91, 1991, pp. 294-305.
34. J. Reppy, Higher-order concurrency, Ph.D. Thesis, Cornell Univ., 1992.
35. D.S. Scott, Domains for denotational semantics, in: M. Neilsen, E.M. Schmidt (Eds.), Proc. ICALP 82, Lecture Notes in Computer Science, vol. 140, Springer, Berlin, 1982, pp. 577-613.
36. B. Thomsen, A calculus of higher order communicating systems, Proc. POPL'89, 1989, pp. 143-154.
37. P. Wadler, Comprehending monads, Proc. 1990 ACM Conf. Lisp and Functional Programming, 1990, pp. 61-78.