Author:
Bernadet Alexis,Lengrand Stéphane
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Abramsky, S.: Computational interpretations of linear logic. Theoret. Comput. Sci. 111, 3–57 (1993)
2. Lecture Notes in Computer Science;N. Benton,1993
3. Barendregt, H., Coppo, M., Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type assignment. J. of Symbolic Logic 48(4), 931–940 (1983)
4. Bucciarelli, A., Ehrhard, T., Manzonetto, G.: Categorical models for simply typed resource calculi. ENTCS 265, 213–230 (2010)
5. Baillot, P., Mogbil, V.: Soft lambda-calculus: a language for polynomial time computation. CoRR, cs.LO/0312015 (2003)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Genericity Through Stratification;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. YACC: Yet Another Church Calculus;Lecture Notes in Computer Science;2024
3. NON-IDEMPOTENT TYPES FOR CLASSICAL CALCULI IN NATURAL DEDUCTION STYLE;LOG METH COMPUT SCI;2020
4. Tight typings and split bounds, fully developed;Journal of Functional Programming;2020
5. Quantitative Types: From Foundations to Applications;Electronic Proceedings in Theoretical Computer Science;2019-04-23