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. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Jeannin, J. B., & Kozen, D. (2012). Computing with capsules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7386 LNCS, pp. 1–19). https://doi.org/10.1007/978-3-642-31623-4_1
Mendeley helps you to discover research relevant for your work.