Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Lect Notes Comput Sci;F. Barbanera,1993
2. Lect Notes Comput Sci;F. Barbanera,1994
3. H.P. Barendregt. The lambda calculus, its syntax and semantics. North-Holland, revised edition, 1984.
4. R. Constable and C. Murthy. Finding computational content in classical proofs. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 341–362. Cambridge University Press, 1991.
5. Lect Notes Comput Sci;Ph. Groote de,1994
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Programming and Proving with Classical Types;Programming Languages and Systems;2017
2. A verified abstract machine for functional coroutines;Electronic Proceedings in Theoretical Computer Science;2016-06-19
3. Hypothetical Logic of Proofs;Logica Universalis;2014-03
4. Strong Normalization for HA + EM1 by Non-Deterministic Choice;Electronic Proceedings in Theoretical Computer Science;2013-09-04
5. Some properties of the -calculus;Journal of Applied Non-Classical Logics;2012-08