Author:
Baillot Patrick,Mogbil Virgile
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Abramsky, S.: Computational interpretations of linear logic. Theoretical Computer Science 111, 3–57 (1993)
2. Asperti, A., Roversi, L.: Intuitionistic light affine logic (proof-nets, normalization complexity, expressive power). ACM Transactions on Computational Logic 3(1), 1–39 (2002)
3. Asperti, A.: Light affine logic. In: Proceedings LICS 1998, IEEE Computer Society, Los Alamitos (1998)
4. Baillot, P.: Checking polynomial time complexity with types. In: Proceedings of International IFIP Conference on Theoretical Computer Science 2002, Montreal, Kluwer Academic Press, Dordrecht (2002)
5. Lecture Notes in Computer Science;P.N. Benton,1993
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Polynomial Time and Dependent Types;Proceedings of the ACM on Programming Languages;2024-01-05
2. Diamonds Are Forever;Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021);2023
3. Types for Complexity of Parallel Computation in Pi-calculus;ACM Transactions on Programming Languages and Systems;2022-07-15
4. Implicit computation complexity in higher-order programming languages;Mathematical Structures in Computer Science;2022-03-15
5. Natural Language Semantics and Computability;Journal of Logic, Language and Information;2019-04-19