Extending the loop language with higher-order procedural variables - Archive ouverte HAL Access content directly
Journal Articles ACM Transactions on Computational Logic Year : 2009

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 translations preserve ranks. Two applications of these results in the area of implicit complexity are described.
Fichier principal
Vignette du fichier
LoopW.pdf (465.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00422158 , version 1 (06-10-2009)

Identifiers

Cite

Tristan Crolard, Emmanuel Polonowski, Pierre Valarcher. Extending the loop language with higher-order procedural variables. ACM Transactions on Computational Logic, 2009, 10 (4), pp.1--37. ⟨10.1145/1555746.1555750⟩. ⟨hal-00422158⟩

Collections

CNRS LACL UPEC
68 View
147 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More