Obtaining coroutines with continuations
Computer Languages
A reduction semantics for imperative higher-order languages
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Journal of Logic Programming
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The theory and practice of first-class prompts
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Correspondence between ALGOL 60 and Church's Lambda-notation: part I
Communications of the ACM
ICON Programmng Language
The dream of a lifetime: A lazy variable extent mechanism
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
An Interpreter for Extended Lambda Calculus
An Interpreter for Extended Lambda Calculus
The Art of the Interpreter or, The Modularity Complex (Parts Zero, One, and Two)
The Art of the Interpreter or, The Modularity Complex (Parts Zero, One, and Two)
Rabbit: A Compiler for Scheme
The essence of rum: a theory of the intensional and extensional aspects of lisp-type computation (program transformation, closure, continuation structure, comparison-relation)
The semantics of destructive lisp (side-effects)
The semantics of destructive lisp (side-effects)
The calculi of lambda-nu-cs conversion: a syntactic theory of control and state in imperative higher-order programming languages
Reasoning about continuations with control effects
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Reasoning with continuations II: full abstraction for models of control
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Isolating side effects in sequential languages
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantic models and abstract interpretation techniques for inductive data structures and pointers
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
DrScheme: a programming environment for Scheme
Journal of Functional Programming
The essence of compiling with continuations
ACM SIGPLAN Notices - Best of PLDI 1979-1999
An operational semantics for scheme1
Journal of Functional Programming
A complete, co-inductive syntactic theory of sequential control and state
Semantics and algebraic specification
| Hi-index | 0.00 |
The &lgr;-v-CS-calculus is a conservative extension of the &lgr;-value-calculus for reasoning about programs in Scheme-like languages. The basis of the extended calculus is a symbolic rewriting semantics for imperative programs. We show with numerous examples how to state and prove equational properties of Scheme-programs in the calculus. The examples suggest that the algebraic manipulation of imperative-functional programs is as feasible and as fruitful as that of functional ones.