A congruence theorem for structured operational semantics of higher-order languages

Proceedings - Symposium on Logic in Computer Science

Volumn 1998-June, Issue , 1998, Pages 153-164

  Bernstein, Karen L ^a  

^a DEPAUL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); SEMANTICS;

BISIMULATIONS; HIGHER-ORDER LANGUAGES; LAMBDA CALCULUS; PI CALCULUS; RULE FORMATS; STRUCTURED OPERATIONAL SEMANTICS; TYFT/TYXT FORMAT;

COMPUTER CIRCUITS;

EID: 84945978005     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.1998.705652     Document Type: Conference Paper

References (25)

1. [Abr90] Samson Abramsky. The lazy lambda calculus. In David Turner, editor, Research Topics in Functional Programming, The UT Year of Programming Series, pages 65-116. Addison-Wesley Publishing Company, 1990.
2. [BG96] Roland Bol and Jan Friso Groote. The meaning of negative premises in transition system specifications. Journal of the ACM, 43(5):863-914, September 1996.
3. [BIM95] Bard Bloom, Sorin Istrail, and Albert R. Meyer. Bisimulation can't be traced. Journal of the ACM, 42(1):232-268, January 1995.
4. [BS95] Karen L. Bernstein and Eugene W. Stark. Operational semantics of a focusing debug-ger. In Eleventh Conference on the Mathematical Foundations of Programming Semantics, New Orleans, USA, March 1995.
5. [BV93] Jos Baeten and Chris Verhoef. A congruence theorem for structured operational se-mantics with predicates. In Proceedings of the 4th Conference on Concurrency Theory (CONCUR '93), volume 715 of LNCS, pages 477-492, Hildesheim, Germany, August 1993. Springer-Verlag.
6. [CG95] Roy L. Crole and Andrew D. Gordon. A sound metalogical semantics for input/output effects. In CSL'94 Computer Science Logic, Kazimierz, Poland, September 1994, volume 933 of Lecture Notes in Computer Science, pages 339-353. Springer-Verlag, 1995.
7. [dS85] Robert de Simone. Higher-level synchronising devices in Meije-SCCS. Theoretical Computer Science, 37:245-267, 1985.
8. [FHJ96] William Ferreira, Matthew Hennessy, and Alan Jeffrey. A theory of weak bisimulation for core CML. In Proc. ACM SICPLAN Int. Conf. Functional Programming. ACM Press, 1996. To appear in Journal of Functional Programming.
9. [FV97] Wan J. Fokkink and Chris Verhoef. A conservative look at term deduction systems and variable binding. Technical report, CWI, 1997. AP (Department of Software Technology), CS-R9508, To appear in Information and Computation.
10. [Gor95] Andrew D. Gordon. Bisimilarity as a theory of functional programming. In Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, volume 1 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 1995.
11. [GR96] Andrew D. Gordon and Gareth D. Rees. Bisimilarity for a first-order calculus of objects with subtyping. In Conference Record of the Twenty Third ACM Symposium on Principles of Programming Languages, pages 386-395. ACM Press, 1996.
12. [Gro93] J. F. Groote. Transition system specifications with negative premises. Theoretical Computer Science, 118(2):263-299, 27 September 1993.
13. [GV92] J. F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100:202-260, 1992.
14. [How95] Douglas J. Howe. A note on proving congruence of bisimulation in a generalized lambda calculus. AT&T Bell Laboratories, 1995.
15. [How96] Douglas J. Howe. Proving congruence of bisimulation in functional programming languages. Information and Control, 124(2): 103-112, February 1996.
16. [Jef95] Alan Jeffrey. A fully abstract semantics for a nondeterministic functional language with monadic types. In Eleventh Conference on Mathematical Foundations of Programming Semantics, volume 1 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 1995.
17. [Mil91] Robin Milner. The polyadic 7r-calculus: A tutorial. Technical Report ECS-LFCS-91- 180, lfcs, October 1991. Also in Logic and Algebra of Specification, ed. F. L. Bauer, W. Brauer and H. Schwichtenberg, sv, 1993.
18. [MPW92] Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, I & II. Information and Computation, 100(1):1-77, September 1992.
19. [Par81] D. M. R. Park. Concurrency and automata on infinite sequences. In Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science. Springer- Verlag, 1981.
20. [San92] Davide Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher- Order Paradigms. PhD thesis, Department of Computer Science, University of Edinburgh, 1992.
21. [San94] Davide Sangiorgi. The lazy lambda calculus in a concurrency scenario. Information and Computation, 111(1): 120-153, 15 May 1994.
22. [San97] David Sands. From SOS rules to proof principles: An operational metatheory for func-Tional languages. In 24th ACM Symposium on Principles of Programming Languages, Paris, France, January 1997. ACM Press.
23. [Tho95] Bent Thomsen. A theory of higher order communication systems. Information and Computation, 116:38-57, 1995.
24. [Ver95] Chris Verhoef. A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing, 2(2):274-302, Summer 1995.
25. [WB96] Sam Weber and Bard Bloom. Metatheory of the 7r-calculus. Technical report, Cornell University, January 1996.