Gödel’s System T is the simply typed lambda calculus extended with numbers and an iterator. The higher-order nature of the language gives it enormous expressive power—the language can represent all the primitive recursive functions and beyond, for instance Acker-mann’s function. In this paper we use System T as a minimalistic functional language. We give an interpretation using a data-flow model that incorporates ideas from the geometry of interaction and game semantics. The contribution is a reversible model of higher-order computation which can also serve as a novel compilation technique.
CITATION STYLE
Mackie, I. (2017). A geometry of interaction machine for gödel’s system t. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10388 LNCS, pp. 229–241). Springer Verlag. https://doi.org/10.1007/978-3-662-55386-2_16
Mendeley helps you to discover research relevant for your work.