Computing with Capsules

dc.contributor.author	Jeannin, Jean-Baptiste
dc.contributor.author	Kozen, Dexter
dc.date.accessioned	2011-01-26T21:39:54Z
dc.date.available	2011-01-26T21:39:54Z
dc.date.issued	2011-01-26
dc.description.abstract	Capsules provide a clean algebraic representation of the state of a computation in higher-order 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 lambda-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.	en_US
dc.identifier.uri	https://hdl.handle.net/1813/22082
dc.language.iso	en_US	en_US
dc.subject	capsules	en_US
dc.subject	semantics	en_US
dc.subject	functional programming	en_US
dc.subject	imperative programming	en_US
dc.subject	scoping	en_US
dc.subject	coalgebra	en_US
dc.subject	lambda-calculus	en_US
dc.title	Computing with Capsules	en_US
dc.type	technical report	en_US

Files

Now showing 1 - 1 of 1