Bisimilarity as a theory of functional programming

Theoretical Computer Science

Volumn 228, Issue 1-2, 1999, Pages 5-47

  Gordon, Andrew D ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Bisimilarity; Co induction; Functional programming; Streams

Indexed keywords

EID: 0346934040     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00353-3     Document Type: Article

References (50)

1. S. Abramsky, Domain theory and the logic of observable properties, Ph.D. Thesis, Queen Mary College, University of London, 1987.
2. S. Abramsky, L. Ong, Full abstraction in the lazy lambda calculus, Inform. Comput. 105 (1993) 159-267.
3. P. Aczel, An introduction to inductive definitions, in: J. Barwise (Ed.), Handbook of Mathematical Logic, North-Holland, Amsterdam, 1977, pp. 739-782.
4. K.L. Bernstein, E.W. Stark, Operational semantics of a focusing debugger, Proceedings MFPS'95, Electronic Notes in Theoretical Computer Science, vol. 1, Elsevier Science Publishers B.V., Amsterdam, 1995.
5. G. Berry, Some syntactic and categorical constructions of lambda-calculus models, Technical Report 80, INRIA, 1981.
6. R. Bird, P. Wadler, Introduction to Functional Programming, Prentice-Hall, Englewood Cliffs, NJ, 1988.
7. B. Bloom, Can LCF be topped? Flat lattice models of typed lambda calculus, Proceedings LICS'88, IEEE Computer Society Press, Silverspring, MD, 1988, pp. 282-295.
8. J. Camilleri, T. Melham, Reasoning with inductively defined relations in the HOL theorem prover, Technical Report 265, University of Cambridge Computer Laboratory, August 1992.
9. R.L. Crole, A.D. Gordon, A sound metalogical semantics for input/output effects, Proceedings CSL'94, Lecture Notes in Computer Science, vol. 933, Springer, Berlin, 1995, pp. 339-353.
10. B.A. Davey, H.A. Priestley, Introduction to Lattices and Order, Cambridge University Press, Cambridge, 1990.
11. M. Felleisen, D. Friedman, Control operators, the SECD-machine, and the λ-calculus, Formal Description of Programming Concepts III, North-Holland, Amsterdam, 1986, pp. 193-217.
12. M. Felleisen, D.P. Friedman, A syntactic theory of sequential state, Theoret. Comput. Sci. 69 (1989) 243-287.
13. J.-Y. Girard, P. Taylor, Y. Lafont, Proofs and Types, Cambridge University Press, Cambridge, 1989.
14. A.D. Gordon, Functional Programming and Input/Output, Cambridge University Press, Cambridge, 1994.
15. A.D. Gordon, Bisimilarity as a theory of functional programming, Proceedings MFPS'95, Electronic Notes in Theoretical Computer Science, vol. 1, Elsevier Science Publishers B.V., Amsterdam, 1995, pp. 369-389.
16. A.D. Gordon, A.M. Pitts (Eds.), Higher Order Operational Techniques in Semantics, Publications of the Newton Institute, Cambridge University Press, 1998.
17. C.A. Gunter, Semantics of Programming Languages: Structures and Techniques, MIT Press, Cambridge, MA, 1992.
18. F. Honsell, M. Lenisa, Final semantics for untyped lambda-calculus, Proceedings TLCA'95, Lecture Notes in Computer Science, vol. 902, Springer, Berlin, 1995, pp. 249-265.
19. D.J. Howe, Equality in lazy computation systems, Proceedings LICS'89, 1989, pp. 198-203.
20. J. Hughes, A. Moran, Making choices lazily, Proceedings FPCA'95, ACM Press, New York, June 1995.
21. A. Jeffrey, Semantics for core Concurrent ML using computation types, in: Gordon, Pitts [16], pp. 55-89.
22. S.B. Lassen, Relational reasoning about contexts, in: Gordon, Pitts [16].
23. I.A. Mason, S.F. Smith, C.L. Talcott, From operational semantics to domain theory, Inform. Comput. 128(1) (1996) 26-47.
24. A.R. Meyer, S.S. Cosmadakis, Semantical paradigms: notes for an invited lecture, Proceedings LICS'88, July 1988, pp. 236-253.
25. R. Milner, Fully abstract models of typed lambda-calculi, Theoret. Comput. Sci. 4 (1977) 1-23.
26. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
27. R. Milner, M. Tofte, Co-induction in relational semantics, Theoret. Comput. Sci. 87 (1991) 209-220.
28. J. H. Morris, Lambda-calculus models of programming languages, Ph.D. Thesis, MIT, December 1968.
29. C.-H.L. Ong, Non-determinism in a functional setting (extended abstract), Proceedings LICS'93, June 1993, pp. 275-286.
30. C.-H.L. Ong, Correspondence between operational and denotational semantics: the full abstraction problem for PCF, Handbook of Logic in Computer Science, vol. 3, Oxford University Press, Oxford, 1994.
31. D. Park, Fixpoint induction and proofs of program properties, Mach. Intell. 5 (1970) 59-78.
32. D. Park, Concurrency and automata on infinite sequences, in: P. Deussen (Ed.), Theoretical Computer Science: fifth GI-Conference, Karlsruhe, Lecture Notes in Computer Science, vol. 104, Springer, Berlin, March 1981, pp. 167-183.
33. L.C. Paulson, Co-induction and co-recursion in higher-order logic, Technical Report 304, University of Cambridge Computer Laboratory, 1993.
34. A.M. Pitts, Some notes on inductive and co-inductive techniques in the semantics of functional programs, BRICS Notes Series NS-94-5, BRICS, Aarhus University, December 1994.
35. G.D. Plotkin, LCF considered as a programming language, Theoret. Comput. Sci. 5 (1977) 223-255.
36. G. Rees, Observational equivalence for a polymorphic lambda calculus, University of Cambridge, Computer Laboratory, April 1994.
37. J.G. Riecke, Fully abstract translations between functional languages, Math. Struct. Comput. Sci. 3 (1993) 387-415.
38. E. Ritter, A.M. Pitts. A fully abstract translation between a λ-calculus with reference types and Standard ML, Proceedings TLCA'95, 1995.
39. H. Sander, A logic of functional programs with an application to concurrency, Ph.D. Thesis, Programming Methodology Group, Chalmers University of Technology and University of Gothenburg, 1992.
40. D. Sands, Operational theories of improvement in functional languages (extended abstract), Functional Programming, Glasgow 1991, Workshops in Computing, Springer, Berlin, 1992, pp. 298-311.
41. D. Sands, Total correctness by local improvement in program transformation, Proceedings POPL'95, ACM Press, New York, 1995.
42. D. Sands, Improvement theory and its applications, in: Gordon, Pitts [16], pp. 275-306.
43. D. Sangiorgi, On the bisimulation proof method, Technical Report ECS-LFCS-94-299, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, August 1994.
44. D.S. Scott, A type-theoretical alternative to ISWIM, CUCH, OWHY, Theoret. Comput. Sci. 121 (1993) 411-440.
45. S.F. Smith, From operational to denotational semantics, Proceedings MFPS'91, Lecture Notes in Computer Science, vol. 598, Springer, Berlin, 1991, pp. 54-76.
46. I. Stark, Names and higher-order functions, Ph.D. Thesis, University of Cambridge Computer Laboratory, December 1994.
47. C. Strachey, Fundamental concepts in programming languages, Unpublished lectures given at the International Summer School in Computer Programming, Copenhagen, August 1967.
48. D. Turner (Ed.), Research Topics in Functional Programming, Addison-Wesley, Reading, MA, 1990.
49. P. Wadler, Comprehending monads, Math. Struct. Comput. Sci. 2 (1992) 461-493.
50. G. Winskel, The Formal Semantics of Programming Languages, MIT Press, Cambridge, MA, 1993.