On the expressive power of the loop language

Authors:
Tristan Crolard;Samuel Lacas;Pierre Valarcher
Affiliations:
LACL - University of Paris, Créteil Cedex, France;Trusted Labs, Versailles, France;LIFAR - University of Rouen, Faculté des Sciences et des Techniques, Saint Etienne du Rouvray, France
Venue:
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Year:
2006

Citing 6
Cited 2

Theories of computational complexity

Theories of computational complexity
Proofs and types

Proofs and types
Semantics of programming languages: structures and techniques

Semantics of programming languages: structures and techniques
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science

Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
System T, call-by-value and the minimum problem

Theoretical Computer Science
On the computational complexity of imperative programming languages

Theoretical Computer Science - Implicit computational complexity

Extending the loop language with higher-order procedural variables

ACM Transactions on Computational Logic (TOCL)
A Representation Theorem for Primitive Recursive Algorithms

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a translation of Meyer and Ritchie's Loop language into a subsystem of Gödel's system T (with product types). Then we show that this translation actually provides a lock-step simulation if a call-by-value strategy is assumed for system T. Some generalizations and possible applications are discussed.