Affiliation:
1. Universität München, Munich, Germany
Abstract
A syntactical proof is given that all functions definable in a certain affine linear typed λ-calculus with iteration in all types are polynomial time computable. The proof provides explicit polynomial bounds that can easily be calculated.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference20 articles.
1. Characterizing the elementary recursive functions by a fragment of Gödel's T
2. A new recursion-theoretic characterization of the polytime functions
3. Higher type recursion, ramification and polynomial time
4. Caseiro V.-H. 1997. Equations for defining poly-time functions. Ph.D. thesis Department of Computer Science University of Oslo Oslon Norway. Available at www.ifi.uio.no/~ftp/publications/research-reports/.]] Caseiro V.-H. 1997. Equations for defining poly-time functions. Ph.D. thesis Department of Computer Science University of Oslo Oslon Norway. Available at www.ifi.uio.no/~ftp/publications/research-reports/.]]
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Polynomial Time and Dependent Types;Proceedings of the ACM on Programming Languages;2024-01-05
2. Two Algorithms in Search of a Type-System;Theory of Computing Systems;2009-02-05
3. Time-Complexity Semantics for Feasible Affine Recursions;Lecture Notes in Computer Science;2007
4. An arithmetic for polynomial-time computation;Theoretical Computer Science;2006-07
5. Calculating Polynomial Runtime Properties;Programming Languages and Systems;2005