Author:
Berger Ulrich,Schwichtenberg Helmut
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Ulrich Berger. Program extraction from normalization proofs. In M. Bezem and J.F. Groote, editors, Typed Lambda Calculi and Applications, pages 91–106. Springer Lecture Notes in Computer Science Vol. 664, 1993.
2. Roy Dyckhoff. Contraction-free sequent calculi for intuitionistic logic. Journal of Symbolic Logic, 57: 793–807, 1992.
3. Harvey Friedman. Classically and intuitionistically provably recursive functions. In Dana S. Scott and Gert H. Müller, editors, Higher Set Theory, pages 21–28. Springer Lecture Notes in Mathematics, Volume 699, 1978.
4. Gerhard Gentzen. Untersuchungen über das logische Schließen. Mathematische Zeitschrift, 39:176–210, 405–431, 1934.
5. Christopher Alan Goad. Computational uses of the manipulation of formal proofs. PhD thesis, Stanford University, August 1980. Stanford Department of Computer Science Report No. STAN-CS-80-819.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献