Author:
Schwichtenberg Helmut,Seisenberger Monika,Wiesnet Franziskus
Publisher
Springer International Publishing
Reference35 articles.
1. U. Berger, Program extraction from normalization proofs, in Typed Lambda Calculi and Applications, ed. by M. Bezem, J. Groote, LNCS, vol. 664, (Springer, Berlin, 1993), pp. 91–106
2. U. Berger, K. Miyamoto, H. Schwichtenberg, M. Seisenberger, Minlog–A Tool for Program Extraction Supporting Algebras and Coalgebras, in Algebra and Coalgebra in Computer Science, ed. by A. Corradini, B. Klin, C. Cîrstea, CALCO’11, LNCS, vol. 6859, (Springer, Berlin, 2011), pp. 393–399
3. S. Berghofer, A constructive proof of Higman’s lemma in Isabelle, Types for Proofs and Programs. Lecture Notes in Computer Science, vol. 3085 (Springer, Berlin, 2004), pp. 66–82
4. E.A. Cichon, E.T. Bittar, Ordinal recursive bounds for Higman’s theorem. Theor. Comput. Sci. 201(1–2), 63–84 (1998)
5. Coq Development Team. The Coq Proof Assistant Reference Manual—Version 8.2. Inria (2009)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献