Abstract
AbstractI survey the syntactic technique of tiering which can be used to restrict the power of a recursion scheme. I show how various results can be obtained entirely proof theoretically without the use of a model of computation.
Publisher
Cambridge University Press (CUP)
Reference18 articles.
1. Characterizing the elementary recursive functions by a fragment of Gödel's T
2. Lambda calculus characterizations of poly-time
3. Murawski A. S. and Ong C.-H. L. , Can safe recursion be interpreted in light linear logic?, paper presented at ICC '00, 2000.
4. Lambda calculus characterization of poly-time;Leivant;Fundamenta Informatica,1993
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A quantitative model for simply typed λ-calculus;Mathematical Structures in Computer Science;2021-11-29
2. On tiered small jump operators;Logical Methods in Computer Science;2009-03-31
3. The geometry of linear higher-order recursion;ACM Transactions on Computational Logic;2009-02
4. Taming Modal Impredicativity: Superlazy Reduction;Logical Foundations of Computer Science;2008
5. Predicative Analysis of Feasibility and Diagonalization;Lecture Notes in Computer Science;2007