Proving Congruence of Bisimulation in Functional Programming Languages

Information and Computation

Volumn 124, Issue 2, 1996, Pages 103-112

  Howe, Douglas J ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (18)

1. ABRAMSKY, S. (1990), The lazy lambda calculus, in "Research Topics in Functional Programming" (D. A. Turner, Ed.), pp. 65-116, Addison-Wesley, Reading, MA.
2. ACZEL, P. (1978), A general CR Theorem, preprint, Univ. of Manchester.
3. BERRY, G. (1981), "Some Syntactic and Categorical Constructions of Lambda-Calculus Models," Technical Report 80, INRIA.
4. BLOOM, B. (1990), Can LCF be topped? Flat lattice models of typed λ-calculus, Inform. and Comput. 87, 264-301.
5. GORDON, A. D. (1994), "Functional Programming and Input/Output," Cambridge Univ. Press.
6. GROOTE, J. F., AND VAANDRAGER, F. (1992), Structured operational semantics and bisimulation as a congruence, Inform. and Comput. 100, 202-260.
7. 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 Computer Society, Los Alamitos, CA.
8. HOWE, D. J. (1991), On computational open-endedness in Martin-Löf's type theory, in "Proceedings of the Sixth Annual Symposium on Logic in Computer Science," pp. 162-172, IEEE Computer Society, Los Alamitos, CA.
9. HOWE, D. J. (1995), "A Note on Proving Congruence of Bisimulation in a Generalized Lambda Calculus," unpublished technical memo, AT&T Bell Laboratories.
10. JAGADEESAN, R. (1991), "Investigations into Abstraction and Concurrency," Ph.D. thesis, Cornell Univ.
11. KAHN, G. (1987), Natural semantics, in "Proceedings of the Symposium on Theoretical Aspects of Computer Software," Lecture Notes in Computer Science, Vol. 247, p. 22-39, Springer-Verlag, Berlin/New York.
12. KLOP, J. W. (1980), Combinatory reduction systems, "Mathematical Centre Tracts," Vol. 127, CWI, Amsterdam.
13. ONG, L. (1992), The concurrent lambda calculus I: A general precongruence theorem for applicative bisimulation, in "Proceedings on Seminars on Parallel Programming Systems," pp. 139-164, Department of Information Systems and Computer Science, National Univ. of Singapore.
14. PLOTKIN, G. (1981), "A Structural Approach to Operational Semantics," Technical Report, Computer Science Department, Aarhus Univ.
15. RITTER, E., AND PITTS, A. M. (1995), A fully abstract translation between a λ-calculus with reference types and Standard ML, in "Proceedings of the Second International Conference on Typed Lambda Calculi and Applications," Lecture Notes in Computer Science, Vol. 902, pp. 397-413, Springer-Verlag, Berlin/New York.
16. SANDS, D. (1991), Operational theories of improvement in functional languages, in "Proceedings of the Glasgow Functional Programming Workshop," pp. 298-311, Springer Workshops in Computing, Springer-Verlag, Berlin/New York
17. SANGIORGI, D. (1992), The lazy lambda calculus in a concurrency scenario, Inform. and Comput. 111, 120-153.
18. TALCOTT, C. (1985), "The Essence of Rum: A Theory of the Intensional and Extensional Aspects of Lisp-Type Computation," Ph.D. thesis, Stanford Univ.