Author:
Lengrand Stéphane,Miquel Alexandre
Reference23 articles.
1. The Lambda-calculus, its syntax and semantics;Barendregt,1984
2. Introduction to generalized type systems;Barendregt;J. Funct. Programming,1991
3. Lambda calculi with types;Barendregt,1992
4. A symmetric lambda-calculus for classical program extraction;Barbanera;Inform. Comput.,1996
5. Proof-assistants using dependent type systems;Barendregt,2001
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Abstracting models of strong normalization for classical calculi;Journal of Logical and Algebraic Methods in Programming;2020-02
2. Uniform Strong Normalization for Multi-discipline Calculi;Rewriting Logic and Its Applications;2018
3. Structures for structural recursion;ACM SIGPLAN Notices;2015-12-18
4. Structures for structural recursion;Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming;2015-08-29
5. Quantitative classical realizability;Information and Computation;2015-04