A calculus for assignments in higher-order languages
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Theories of computational complexity
Theories of computational complexity
Proofs and types
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
About primitive recursive algorithms
Selected papers of the 16th international colloquium on Automata, languages, and programming
Notions of computation and monads
Information and Computation
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
The structure of typed programming languages
The structure of typed programming languages
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The type and effect discipline
Information and Computation
ALGOL-like languages (v.2)
Computability and complexity: from a programming perspective
Computability and complexity: from a programming perspective
The marriage of effects and monads
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
System T, call-by-value and the minimum problem
Theoretical Computer Science
Theories of programming languages
Theories of programming languages
Integrating functional and imperative programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Syntactic control of interference
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Modern Compiler Implementation: In ML
Modern Compiler Implementation: In ML
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
The Definition of Standard ML
Revised Report on the Algorithmic Language Scheme
Higher-Order and Symbolic Computation
STACS '87 Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science
C# Language Specification
Verification of non-functional programs using interpretations in type theory
Journal of Functional Programming
Journal of Functional Programming
On the expressive power of the loop language
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Static complexity analysis of higher order programs
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
A Representation Theorem for Primitive Recursive Algorithms
Fundamenta Informaticae
Hi-index | 0.00 |
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.