A sound and complete axiomatization of operational equivalence of programs with memory
Proceedings of the Fourth Annual Symposium on Logic in computer science
Notions of computation and monads
Information and Computation
The revised report on the syntactic theories of sequential control and state
Theoretical Computer Science
Operational reasoning for functions with local state
Higher order operational techniques in semantics
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
A Theory of Objects
A Theory of Programming Language Semantics
A Theory of Programming Language Semantics
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Operational Semantics and Program Equivalence
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
The semantics of local storage, or what makes the free-list free?(Preliminary Report)
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
History of programming languages I
Mathematical concepts in programming language semantics
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Applications of infinitary lambda calculus
Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Relational semantics for higher-order programs
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Capsules and closures: a small-step approach
Logic and Program Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Capsules provide an algebraic representation of the state of a computation in higher-order functional and imperative languages. A capsule is essentially a finite coalgebraic representation of a regular closed λ-coterm. One can give an operational semantics based on capsules for a higher-order programming language with functional and imperative features, including mutable bindings. Static (lexical) scoping is captured purely algebraically without stacks, heaps, or closures. All operations of interest are typable with simple types, yet the language is Turing complete. Recursive functions are represented directly as capsules without the need for fixpoint combinators.