Author:
Dal Lago Ugo,Parisen Toldin Paolo
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference16 articles.
1. A new recursion-theoretic characterization of the polytime functions;Bellantoni;Comput. Complex.,1992
2. Stratified functional programs and computational complexity;Leivant,1993
3. Ramified recurrence and computational complexity II: substitution and poly-space;Leivant,1995
4. LOGSPACE and PTIME characterized by programming languages;Jones;Theor. Comput. Sci.,1999
5. Recursion schemata for NCk;Bonfante,2008
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Polynomial Time and Dependent Types;Proceedings of the ACM on Programming Languages;2024-01-05
2. Read/write factorizable programs;Journal of Functional Programming;2023
3. On Higher-Order Probabilistic Subrecursion;Logical Methods in Computer Science;2021-12-23
4. Algorithmically Broad Languages for Polynomial Time and Space;Logic, Language, Information, and Computation;2021
5. Probabilistic Termination by Monadic Affine Sized Typing;ACM Transactions on Programming Languages and Systems;2019-06-21