Title :
A congruence theorem for structured operational semantics of higher-order languages
Author :
Bernstein, Karen L.
Author_Institution :
Sch. of Comput. Sci., Telecommun., & Inf. Syst., DePaul Univ., Chicago, IL, USA
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 λ-calculus, CHOCS and the π-calculus
Keywords :
equivalence classes; formal languages; lambda calculus; process algebra; π-calculus; CHOCS; bisimulation; congruence; higher-order languages; lazy λ-calculus; tyft/tyxt rule format; Algebra; Computer languages; Computer science; Functional programming; Information systems; Testing;
Conference_Titel :
Logic in Computer Science, 1998. Proceedings. Thirteenth Annual IEEE Symposium on
Conference_Location :
Indianapolis, IN
Print_ISBN :
0-8186-8506-9
DOI :
10.1109/LICS.1998.705652
