Properties of Terms in Continuation-Passing Style in an Ordered Logical Framework (2000)
| Venue: | 2nd Workshop on Logical Frameworks and Meta-languages |
| Citations: | 12 - 0 self |
BibTeX
@INPROCEEDINGS{Polakow00propertiesof,
author = {Jeff Polakow and Frank Pfenning},
title = {Properties of Terms in Continuation-Passing Style in an Ordered Logical Framework},
booktitle = {2nd Workshop on Logical Frameworks and Meta-languages},
year = {2000},
pages = {0--0}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Machine We now begin extending our representation to include evaluation of CPS terms. We will begin by showing a representation of a naive evaluator which makes no use of the ordering invariants. The following is a bare abstract machine for CPS evaluation. ` Exp B e ,! a ` Root B k: e ,! a ` Exp B k t ,! t ` Exp B e[t=v] ,! a ` Root B (v: e) t ,! a ` Exp B e[t=x][c=k] ,! a ` Root B (x: k: e) t c ,! a Notice that this machine describes a regular big-step operational semantics for a -calculus--- every redex is reduced by a substitution. We introduce two type constructors to represent bare evaluations: evalr B : root ! triv ! type: evale B : exp ! triv ! type: Additionally, we introduce a new object to our signature for CPS terms: ret : cont ret 1 will be substituted for the continuation identifiers, k, in bare evaluations. In order to make the inverse representation function on objects well-defined, we augment it with a continuation identifier 1 We chose the term r...
Citations
No citations identified.
