Paper: A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages (at LICS 1998)

Authors: Karen L. Bernstein

Abstract

In this paper we describe the promoted tyft/tyxt rule format for defining higher-order languages. The rule format is a generalization of Groote and Vaandrager's tyft/tyxt format in which terms are allowed as labels on transitions in rules. We prove that bisimulation is a congruence for any language defined in promoted tyft/tyxt format and demonstrate the usefulness of the rule format by presenting promoted tyft/tyxt definitions for the lazy \lambda-calculus, CHOCS and the ?-calculus

BibTeX

  @InProceedings{Bernstein-ACongruenceTheoremf,
    author = 	 {Karen L. Bernstein},
    title = 	 {A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages},
    booktitle =  {Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science (LICS 1998)},
    year =	 {1998},
    month =	 {June}, 
    pages =      {153--164},
    location =   {Indianapolis, IN, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }