Expansion postponement via cut elimination in sequent calculi for pure type systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 956-968

  Gutiérrez, Francisco ^a   Ruiz, Blas ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

Cut elimination; Expansion postponement; Pure type systems; Sequent calculi

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; COMPUTER PROGRAMMING LANGUAGES; DIFFERENTIATION (CALCULUS); PATHOLOGY;

CUT ELIMINATION; DEEP IMPACT; DEPENDENT TYPE SYSTEM; LOGICAL FRAMEWORKS; PURE TYPE SYSTEMS; SEQUENT CALCULUS;

EXPANSION;

EID: 21144441191     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_74     Document Type: Article

References (21)

1. H. Geuvers, M.-J. 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. P. 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. F. Gutiérrez, B. C. Ruiz, A Cut Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene, in: International Workshop on Logic Based Program Development and Transformation (LOPSTR'02), September 17-20, Madrid, Spain, Vol. (to appear) of LNCS, Springer-Verlag, 2003, http://polaris.lcc.uma.es/∼blas/publicaciones/.
6. G. Gentzen, Untersuchungen über das Logische Schliessen, Math. Zeitschrift 39 (1935) 176,-210,405-431, translation in [21].
7. H. Geuvers, Logics and type systems, Ph.D. thesis, Computer Science Institute, Katholieke Universiteit Nijmegen (1993).
8. S. C. Kleene, Introduction to Metamathematics, D. van Nostrand, Princeton, New Jersey, 1952.
9. M. Baaz, A. Leitsch, Cut-elimination and redundancy-elimination by resolution, Journal of Symbolic Computation 29 (2) (2000) 149-177.
10. D. Pym, A note on the proof theory of the λΠ-calculus, Studia Logica 54 (1995) 199-230.
11. D. Galmiche, D. J. Pym, Proof-search in type-theoretic languages: an introduction, Theoretical Computer Science 232 (1-2) (2000) 5-53.
12. F. Gutiérrez, B. C. Ruiz, Sequent Calculi for Pure Type Systems, Tech. Report 06/02, Dept. de Lenguajes y Ciencias de la Computación, Universidad de Málaga (Spain), http://polaris.lcc.uma.es/∼blas/publicaciones/ (may 2002).
13. E. Poll, Expansion Postponement for Normalising Pure Type Systems, Journal of Functional Programming 8 (1) (1998) 89-96.
14. L. van Benthem Jutting, J. McKinna, R. Pollack, Checking Algorithms for Pure Type Systems, in: H. Barendregt, T. Nipkow (Eds.), Types for Proofs and Programs: International Workshop TYPES'93, no. 806 in Lecture Notes in Computer Science, Springer-Verlag, 1994, pp. 19-61.
15. G. Barthe, Type-checking injective pure type systems, Journal Functional Programming 9 (6) (1999) 675-698.
16. B. C. Ruiz, The Expansion Postponement Problem for Pure Type Systems with Universes, in: 9th International Workshop on Functional and Logic Programming (WFLP'2000), Dpto. de Sistemas Informáticos y Computación, Technical University of Valencia (Tech. Rep.), 2000, pp. 210-224, september 28-30, Benicassim, Spain.
17. R. Pollack, Typechecking in pure type systems, in: B. Nordström, K. Petersson, G. Plotkin (Eds.), Informal Proceedings of 1992 Workshop on Types for Proofs and Programs, Bȧstad, 1992, pp. 271-288, http://www.dcs.ed.ac.uk/lfcinfo/research/types-bra.
18. B. C. Ruiz, Sistemas de Tipos Puros con Universos, Ph.D. thesis, Universidad de Malaga (1999).
19. L. van Benthem Jutting, Typing in Pure Type Systems, Information and Computation 105 (1) (1993) 30-41.
20. M. Strecker, Construction and Deduction in Type Theories, Ph.D. thesis, Universität Ulm (1999).
21. G. Gentzen, Investigations into logical deductions, in: M. Szabo (Ed.), The Collected Papers of Gerhard Gentzen, North-Holland, 1969, pp. 68-131.