The Revised Report on the Syntactic Theories of Sequential Control and State

The Revised Report on the Syntactic Theories of Sequential Control and State (1992)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Matthias Felleisen , Matthias Felleisen , Robert Hieb , Robert Hieb

Venue:	Theoretical Computer Science
Citations:	237 - 35 self

Versions

Version History

Metadata Version 4

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	The Revised Report on the Syntactic Theories of Sequential Control and State	user correction - Legacy Corrections
AUTHOR NAME	Matthias Felleisen	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, Rice University, Houston	SVM HeaderParse 0.2
AUTHOR ADDR	TX 77251-1892	SVM HeaderParse 0.2
AUTHOR NAME	Matthias Felleisen	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, Rice University, Houston	SVM HeaderParse 0.2
AUTHOR ADDR	TX 77251-1892	SVM HeaderParse 0.2
AUTHOR NAME	Robert Hieb	SVM HeaderParse 0.1
AUTHOR AFFIL	y; Computer Science Department, Indiana University, Bloomington, IN 47405	SVM HeaderParse 0.2
AUTHOR ADDR	Bloomington, IN 47405	SVM HeaderParse 0.1
AUTHOR NAME	Robert Hieb	SVM HeaderParse 0.1
AUTHOR AFFIL	y; Computer Science Department, Indiana University, Bloomington, IN 47405	SVM HeaderParse 0.2
AUTHOR ADDR	Bloomington, IN 47405	SVM HeaderParse 0.2
ABSTRACT	The syntactic theories of control and state are conservative extensions of the v -calculus for equational reasoning about imperative programming facilities in higher-order languages. Unlike the simple v -calculus, the extended theories are mixtures of equivalence relations and compatible congruence relations on the term language, which significantly complicates the reasoning process. In this paper we develop fully compatible equational theories of the same imperative higher-order programming languages. The new theories subsume the original calculi of control and state and satisfy the usual Church-Rosser and Standardization Theorems. With the new calculi, equational reasoning about imperative programs becomes as simple as reasoning about functional programs. 1 The syntactic theories of control and state Most -calculus-based programming languages provide imperative programming facilities such as assignment statements, exceptions, and continuations. Typical examples are ML [16], Schem...	user correction - Legacy Corrections
YEAR	1992	INFERENCE
VENUE	Theoretical Computer Science	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	235--271	INFERENCE
VOLUME	103	INFERENCE
TECH	Technical Report 89-100	INFERENCE
CITATIONS	22 found	ParsCit 1.0