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.
Type de document :
Autre publication
TR-LACL-2008-3. Technical Report of the LACL. 2008
Liste complète des métadonnées

Littérature citée [33 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00385411
Contributeur : Emmanuel Polonowski <>
Soumis le : mardi 19 mai 2009 - 11:14:45
Dernière modification le : jeudi 11 janvier 2018 - 06:19:28
Document(s) archivé(s) le : lundi 15 octobre 2012 - 10:36:08

Fichier

TR-LACL-2008-3.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00385411, version 1

Collections

Citation

Tristan Crolard, Emmanuel Polonowski, Pierre Valarcher. Extending the Loop Language with Higher-Order Procedural Variables. TR-LACL-2008-3. Technical Report of the LACL. 2008. 〈hal-00385411〉

Partager

Métriques

Consultations de la notice

110

Téléchargements de fichiers

61