A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene-Reference-Cited by-同舟云学术

A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene

Published:2003 Issue: Volume: Page:17-31
ISSN:0302-9743
Container-title:Logic Based Program Synthesis and Transformation
language:
Short-container-title:

Author:

Gutiérrez Francisco,Ruiz Blas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45013-0_2

Reference24 articles.

1. H. Geuvers, M. Nederhof, Modular proof of Strong Normalization for the Calculus of Constructions, Journal of Functional Programming 1 (1991) 15–189.

2. H. P. Barendregt, Lambda Calculi with Types, in: S. Abramsky, D. Gabbay, T. S. Maibaum (Eds.), Handbook of Logic in Computer Science, Oxford University Press, 1992, Ch. 2.2, pp. 117–309.

3. F. Pfenning, Logical frameworks, in: A. Robinson, A. Voronkov (Eds.), Handbook of Automated Reasoning, Vol. II, Elsevier Science, 2001, Ch. 17, pp. 1063–1147.

4. H. Barendregt, H. Geuvers, Proof-assistants using dependent type systems, in: A. Robinson, A. Voronkov (Eds.), Handbook of Automated Reasoning, Vol. II, Elsevier Science, 2001, Ch. 18, pp. 1149–1238.

5. G. Gentzen, Untersuchungen über das Logische Schliessen, Math. Zeitschrift 39 (1935) 176–210,405–431, translation in [24].

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems;Logical Methods in Computer Science;2011-03-23

2. Expansion Postponement via Cut Elimination in Sequent Calculi for Pure Type Systems;Automata, Languages and Programming;2003