Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.
2. J.-Y. Girard. Proof-nets: the parallel syntax for proof-theory. In Ursini and Agliano, editors, Logic and Algebra, New York, 1995. Marcel Dekker.
3. J.-Y. Girard, A. Scedrov, and P.J. Scott. Bounded Linear Logic: A Modular Approach to Polynomial Time Computability. Theoretical Computer Science, 97:1–66, 1992.
4. V.N. Grishin. Predicate and set-theoretic calculi based on logics without contractions. Math. USSR Izvestiya, 18:41–59, 1982.
5. G.G. Hillebrand, P.C. Kanellakis, and H.G. Mairson. Database query languages embedded in the typed lambda calculus. In Proc. 8-th Annual IEEE Symposium on Logic in Computer Science, Montreal, pages 332–343, June 1993.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Transfinite step-indexing for termination;Proceedings of the ACM on Programming Languages;2021-01-04
2. Unary Resolution: Characterizing Ptime;Lecture Notes in Computer Science;2016
3. Paths to Triviality;Journal of Philosophical Logic;2015-07-19
4. Unification and Logarithmic Space;Lecture Notes in Computer Science;2014
5. Logic Programming and Logarithmic Space;Programming Languages and Systems;2014