A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages

A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages (1997)

Cached

Download Links

[dpelab.cs.depaul.edu]
[dpelab.cs.depaul.edu]

Other Repositories/Bibliography

DBLP

by Karen L. Bernstein

Citations:

34 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages	user correction - Legacy Corrections
AUTHOR NAME	Karen L. Bernstein	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computer Science, Telecommunications, and Information Systems; DePaul University, Chicago	SVM HeaderParse 0.2
AUTHOR ADDR	IL 60604 USA	SVM HeaderParse 0.1
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. 1 Introduction For a programming language definition that uses bisimulation as the notion of equivalence, it is desirable for the bisimulation relation to be compatible with the language constructs; i.e. that bisimulation be a congruence. Several rule formats have been defined, so that as long as a definition satisfies certain syntactic constraints, then the defined bisimulation relation is guaranteed to be a congruence. However these rule formats have not been widely used for defining languages with higher-...	user correction - Legacy Corrections
YEAR	1997	user correction - Legacy Corrections
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	153--164	INFERENCE
CITATIONS	6 found	ParsCit 1.0