Author:
Girard Jean-Yves,Scedrov Andre,Scott Philip J.
Subject
General Computer Science,Theoretical Computer Science
Reference33 articles.
1. S. Abramsky, Computational interpretation of linear logic, Theoret. Comput. Sci., to appear.
2. Bounded Arithmetic;Buss,1986
3. The polynomial hierarchy and intuitionistic bounded arithmetic;Buss,1986
4. Feasible Mathematics,1990
5. The intrinsic computational difficulty of functions;Cobham,1964
Cited by
147 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Numerical Fuzz: A Type System for Rounding Error Analysis;Proceedings of the ACM on Programming Languages;2024-06-20
2. Functional Ownership through Fractional Uniqueness;Proceedings of the ACM on Programming Languages;2024-04-29
3. Polynomial Time and Dependent Types;Proceedings of the ACM on Programming Languages;2024-01-05
4. Program Synthesis from Graded Types;Lecture Notes in Computer Science;2024
5. The syntactic side of autonomous categories enriched over generalised metric spaces;Logical Methods in Computer Science;2023-12-18