Extending the Loop Language with Higher-Order Procedural Variables - Archive ouverte HAL Accéder directement au contenu
Autre Publication Scientifique Année : 2008

Extending the Loop Language with Higher-Order Procedural Variables

Résumé

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.
Fichier principal
Vignette du fichier
TR-LACL-2008-3.pdf (516.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00385411 , version 1 (19-05-2009)

Identifiants

  • HAL Id : hal-00385411 , version 1

Citer

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

Collections

CNRS LACL UPEC
86 Consultations
87 Téléchargements

Partager

Gmail Facebook X LinkedIn More