Results 1 
3 of
3
Reasoning with Continuations II: Full Abstraction for Models of Control
 In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming
, 1990
"... A fully abstract model of a programming language assigns the same meaning to two terms if and only if they have the same operational behavior. Such models are wellknown for functional languages but little is known about extended functional languages with sophisticated control structures. We show th ..."
Abstract

Cited by 32 (4 self)
 Add to MetaCart
A fully abstract model of a programming language assigns the same meaning to two terms if and only if they have the same operational behavior. Such models are wellknown for functional languages but little is known about extended functional languages with sophisticated control structures. We show that a direct model with error values and the conventional continuation model are adequate for functional languages augmented with first and higherorder control facilities, respectively. Furthermore, both models become fully abstract on adding a control delimiter and a parallel conditional to the programming languages.
Putting Operational Techniques to the Test: A Syntactic Theory for Behavioral Verilog
"... We present a syntactic theory for the behavioral subset of the Verilog Hardware Description Language. Due to the complexity of the language, the construction of this theory represents a serious test of the suitability of syntactic operational techniques for reasoning about industrial languages. Over ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present a syntactic theory for the behavioral subset of the Verilog Hardware Description Language. Due to the complexity of the language, the construction of this theory represents a serious test of the suitability of syntactic operational techniques for reasoning about industrial languages. Overall, we have found that these techniques are rather robust but with a few caveats. Our theory formalizes the simulation cycle explicitly, exposes a number of ambiguities and inconsistencies in the language reference manual (LRM), and is the most accurate known description of this subset of Verilog, with respect to the LRM. The syntactic theory has been used to automatically derive a simulator for Verilog. 1 Introduction Programming calculi, which concentrate on a small set of constructs that capture the "essence" of a language, commonly come equipped with syntactic theories that explain, in intuitive yet formal terms, the evaluation and optimization of programs. In principle, then, the deve...
Reasoning with Continuations III: A Complete Calculus of Control
, 1992
"... [Anybody taye in the first paragraph? Thanks!] The central result of this paper is an extension of the lambda(v)Ccalculus for a complete set of control operators and a correspondence theorem between the new theory and the lambda/beta/etacalculus. Technically, the theorem shows that the two calcul ..."
Abstract
 Add to MetaCart
[Anybody taye in the first paragraph? Thanks!] The central result of this paper is an extension of the lambda(v)Ccalculus for a complete set of control operators and a correspondence theorem between the new theory and the lambda/beta/etacalculus. Technically, the theorem shows that the two calculi prove the same equations with respect to the wellknown continuationpassing style translation (and its inverse), which is the standard tool for defining control operators via translation into a functional language. As a corollary, the calculus proves all program equivalences between terms over the pure language extended with control operators. We believe that this work has important consequences for the directstyle compilation of programming languages with control operators.