Extending the Loop Language with Higher-Order Procedural Variables

Abstract : We extend Meyer and Ritchie's Loop language with higher-order procedures and procedural variables and we show that the resulting programming language (called Loopω) is a natural imperative counterpart of Gödel System T. The argument is two-fold: 1. we define a translation of the Loopω language into System T and we prove that this translation actually provides a lock-step simulation, 2. using a converse translation, we show that Loopω is expressive enough to encode any term of System T. Moreover, we define the “iteration rank” of a Loopω program, which corresponds to the classical notion of “recursion rank” in System T, and we show that both trans- lations preserve ranks. Two applications of these results in the area of implicit complexity are described.
Document type :
Other publications
Liste complète des métadonnées

Cited literature [33 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00385411
Contributor : Emmanuel Polonowski <>
Submitted on : Tuesday, May 19, 2009 - 11:14:45 AM
Last modification on : Thursday, January 11, 2018 - 6:19:28 AM
Document(s) archivé(s) le : Monday, October 15, 2012 - 10:36:08 AM

File

TR-LACL-2008-3.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00385411, version 1

Collections

Citation

Tristan Crolard, Emmanuel Polonowski, Pierre Valarcher. Extending the Loop Language with Higher-Order Procedural Variables. 2008. ⟨hal-00385411⟩

Share

Metrics

Record views

114

Files downloads

66