DMCA
Computing with Capsules (2011)
Cached
Download Links
| Citations: | 6 - 3 self |
BibTeX
@MISC{Jeannin11computingwith,
author = {Jean-baptiste Jeannin and Dexter Kozen},
title = {Computing with Capsules},
year = {2011}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Capsules provide a clean algebraic representation of the state of a computation in higherorder functional and imperative languages. They play the same role as closures or heap- or stack-allocated environments but are much simpler. 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. 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 unnatural and untypable fixpoint combinators. 1
Keyphrases
simple type mutable binding regular closed coterm much simpler operational semantics higherorder functional imperative feature finite coalgebraic representation lexical scoping untypable fixpoint combinators imperative language stack-allocated environment clean algebraic representation recursive function higher-order programming language
