Author:
Moyen Jean-Yves,Rubiano Thomas,Seiller Thomas
Publisher
Springer International Publishing
Reference16 articles.
1. Abel, A., Altenkirch, T.: A predicative analysis of structural recursion. J. Funct. Program. 12(1), 1–41 (2002)
2. Baillot, P., Terui, K.: Light types for polynomial time computation in lambda calculus. Inf. Comput. 201(1), 41–62 (2009)
3. Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the poly-time functions. Comput. Complex. 2, 97–110 (1992)
4. Cobham, A.: The intrinsic computational difficulty of functions. In: Bar-Hillel, Y. (ed.) CLMPS (1962)
5. Cocke, J.: Global common subexpression elimination. SIGPLAN Not. 5(7), 20–24 (1970)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Distributing and Parallelizing Non-canonical Loops;Lecture Notes in Computer Science;2023
2. pymwp: A Static Analyzer Determining Polynomial Growth Bounds;Automated Technology for Verification and Analysis;2023
3. Formally Verified Resource Bounds through Implicit Computational Complexity;Companion Proceedings of the 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity;2022-11-29