Similarity and bisimilarity for countable non-determinism and higher-order functions (extended abstract)

Electronic Notes in Theoretical Computer Science

Volumn 10, Issue , 1998, Pages 246-266

  Lassen, Sôren B ^a   Pitcher, Corin S ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Applicative bisimilarity; Countable non determinism; Lambda calculus

Indexed keywords

APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; SEMANTICS; THEOREM PROVING;

APPLICATIVE BISIMILARITY; CONCURRENT SYSTEMS; COUNTABLE NON-DETERMINISM; LAMBDA-CALCULUS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 19144368949     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80704-2     Document Type: Conference Paper

References (30)

1. Abramsky S. The lazy lambda calculus. Turner D.A. Research Topics in Functional Programming, The UT Year of Programming Series. 1990;65-117 Addison-Wesley
2. Aczel P. An introduction to inductive definitions. Barwise J. Handbook of Mathematical Logic, number 90 in Studies in Logic. North_Holland Publishing Company. 1977
3. Apt K.R., Plotkin G.D. Countable nondeterminism and random assignment. Journal of the ACM. 33:(4):October 1986;724-767
4. Bird R.J., de Moor O. The Algebra of Programming. 1997;Prentice Hall
5. Birkedal L., Harper R. Operational interpretations of recursive types in an operational setting (summary). Abadi M., Ito T. Symposium on Theoretical Aspects of Computer Science, Sendai, Japan, volume 1281 of Lecture Notes in Computer Science. 1997;Springer-Verlag
6. Cousot P., Cousot R. Inductive definitions, semantics and abstract interpretations. In Conference Record of the 19th ACM Symposium on Principles of Programming Languages. 1992;83-94
7. Gordon A.D. Functional Programming and Input/Output. Distinguished Dissertations in Computer Science. 1994;Cambridge University Press
8. Gordon A.D. Bisimilarity as a theory of functional programming. BRICS Notes Series NS-95-3, Department of Computer Science, University of Arhus. 1995
9. Gordon A.D. A tutorial on co-induction and functional programming. In Proceedings of the 1994 Glasgow Workshop on Functional Programming, workshops in Computing. 1995
10. Gunter C.A. Semantics of Programming Languages: Structures and Techniques. 1992;Foundations of Computing
11. Howe D.J. Equality in lazy computation systems. In Proceedings, 4th Annual Symposium on Logic in Computer Science. 1989;198-203 Computer Society Press, Washington
12. Howe D.J. Proving congruence of bisimulation in functional programming languages. Information and Computation. 124:(2):1996;103-112
13. Lassen S.B. Action semantics reasoning about functional programs. Math Struct. in Comp. Science. 1997;557-589
14. Lassen S.B. Relational reasoning about contexts. Gordon A.D., Pitts A.M. Higher Order Operational Techniques in Semantics of the Newton Institute. 1998;91-135 Cambridge University Press
15. S. B. Lassen. Relational Reasoning about Functions and Nondeterminism. PhD thesis, Department of Computer Science, University of Aarhus, February 1998. URL http://WWW.cl.cam.ac.uk/users/sb121/docs/phd.html.
16. Milner R. Communication and Concurrency. International Series in Computer Science. 1989;Prentice-Hall, New York
17. Moggi E. Notions of computations and monads. Information and Computation. 93:(1):1991;55-92
18. Moran A. Natural semantics for non-determinism. Licentiate thesis, Chalmers University of Technology and University of Göteborg. May 1994
19. Mosses P.D. Action Semantics. Number 26 in Cambridge Tracts in Theoretical Computer Science. 1992;Cambridge University Press
20. Odifreddi P. Classical Recursion Theory, volume 125 of Studies in Logic. 1989;Elsevier Science Publishers B.V
21. Ong C.-H.L. Concurrent lambda calculus, and a general pre-congruence theorem for applicative bisimulation. Preliminary version. August 1992
22. Ong C.-H.L. Non-determinism in a functional setting. In Proceedings, 8th Annual Symposium on Logic in Computer Science. 1993;275-286 Computer Society Press, Washington
23. Pitcher C.S. Functional Programming and Erratic Non-Determinism. September 1998;PhD thesis, Oxford University Computing Laboratory.. In preparation (expected)
24. A. M. Pitts. Parametric polymorphism and operational equivalence. Preliminary version. In this volume.
25. Pitts A.M. A note on logical relations between semantics and syntax. Logic Journal of the Interest Group in Pure and Applied Logics. 5:(4):July 1997;589-601
26. Pitts A.M. Operationally-based theories of program equivalence. Dybjer P., Pitts A.M. Semantics and Logics of Computation. 1997;Cambridge University Press. Lectures given at the CLICS-II Summer School on Semantics and Logics of Computation, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK, September 1995.
27. Plotkin G.D. Domains. URL http://hypatia.dcs.qmw.ac.uk.sites/other/ domain.notes.other/. 1983
28. Prasad S., Giacalone A., Mishra P. Operational and algebraic semantics for Facile: A symmetric integration of concurrent and functional programming: In. Paterson M.S. Automata, Languages and Programming, volume 443 of Lecture Notes in Computer Science. 1990;765-780 Springer-Verlag
29. Rogers H. Jr. Theory of Recursive Functions and Effective Computability. 1967;McGraw-Hill Series in Higher Mathematics
30. Roscoe A.W. Two papers on CSP. Technical Report PRG-67, Programming Resarch Group. July 1988;Oxford University Computing Laboratory. (An alternative order for the failures model & Unbounded nondeterminism in CSP)