Cut rules and explicit substitutions

Mathematical Structures in Computer Science

Volumn 11, Issue 1, 2001, Pages 131-168

  Vestergaard, Rene ^a   Wells, Joe ^a  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344563266     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129500003273     Document Type: Article

References (56)

1. Abadi, M., Cardelli, L., Curien, P.-L. and Levy, J.-J. (1991) Explicit substitutions. Journal of Functional Programming 1 (4) 375–416.
2. Abramsky, S. (1993) Computational interpretations of linear logic. Theoretical Computer Science 111 3–57.
3. Benaissa, Z., Briaud, D., Lescanne, P. and Rouyer-Degli, J. (1996) λν, a calculus of explicit substitutions which preserves strong normalisation. Journal of Functional Programming 6 (5) 699–722.
4. Benton, N., Bierman, G., de Paiva, V. and Hyland, M. (1993) A term calculus for intuitionistic linear logic. In: Bezem, M. and Groote, J.F. (eds.) Typed Lambda Calculi and Applications. Springer-Verlag Lecture Notes in Computer Science 664 75–90.
5. Tahhan Bittar, E. (1996) Strong normalisation proofs for cut elimination in Gentzen's sequent calculi. Prepublication du Laboratoire de Logique Algorithmique et Informatique de Clermont, Numero 56, Universite D'Auvergne.
6. Bloo, R. (1997) Preservation of Termination for Explicit Substitution, Ph. D. thesis, Technical University of Eindhoven.
7. Bloo, R. and Rose, K. (1995) Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection. In: CSN-95: Computer Science in the Netherlands.
8. Breazu-Tannen, V., Kesner, D. and Puel, L. (1993) A typed pattern calculus. In: Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science 262–274.
9. de Bruijn, N.G. (1978) A namefree lambda calculus with facilities for internal definition of expressions and segments. Technical Report TH-Report 78-WSK-03, Department of Mathematics, Technical University of Eindhoven.
10. de Bruijn, N.G. (1978) Lambda calculus notation with namefree formulas involving symbols that represent reference transforming mappings. Indag. Math 40 (3) 348–356.
11. Cerrito, S. and Kesner, D. (1999) Pattern matching as cut elimination. In: Proc. 14th Ann. IEEE Symp. Logic in Computer Sci.
12. Church, A. (1941) The Calculi of Lambda Conversion, Princeton University Press.
13. Di Cosmo, R. and Kesner, D. (1997) Strong normalization of explicit substitutions via cut elimination in proof nets. In: 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97).
14. Curien, P.-L. (1993) Categorical Combinators, Sequential Algorithms and Functional Programming, Progress in Theoretical Computer Science, Birkhauser.
15. Curien, P.-L., Hardin, T. and Levy, J.-J. (1996) Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM 43 (2) 362–397.
16. Curry, H.B. and Feys, R. (1958) Combinatory Logic, North-Holland. Dowek, G., Hardin, T. and Kirchner, C. (1995) Higher-order unification via explicit substitutions. In: Symposium on Logic in Computer Science (LICS '95), Los Alamitos, Ca., USA, IEEE Computer Society Press 366–507.
17. Dragalin, A.G. (1979) Translated as Mathematical Intuitionism: Introduction to Proof Theory, Translations of Mathematical Monographs 67, American Mathematical Society, Providence, Rhode Island, 1988.
18. Dyckhoff, R. and Pinto, L (1999) Permutability of proofs in intuitionistic sequent calculi. Theoretical Computer Science 212 (12) 141–155
19. Espirito Santo, J. (2000) Revisiting the correspondence between cut elimination and normalisation. (Presented at ICALP'00)
20. Gallier, J. (1993) Constructive logics, Part I: A tutorial on proof systems and typed λ-calculi. Theoretical Computer Science 110 249–339.
21. Gentzen, G. (1935) Investigations into logical deduction. In: Szabo, M. E. (ed.) The Collected Papers of Gerhard Gentzen, North-Holland.
22. Gramlich, B. (1995) Abstract relations between restricted termination and confluence properties of rewrite systems. Fundamenta Informaticae. (Preliminary version appeared as Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems, LPAR'92).
23. Guillaume, B. (1997) The se does not have PSN. (Manuscript).
24. Hardin, T., Maranget, L. and Pagano, B. (1996) Functional back-ends within the lambda-sigma calculus. In: Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming 25–33.
25. Herbelin, H. (1994) A 2-calculus structure isomorphic to Gentzen-style sequent calculus structure. In: Annual Conference of the European Association for Computer Science Logic, CSL'94, Kazimierz (Poland), Selected Papers. Springer-Verlag Lecture Notes in Computer Science 933 61–75.
26. Herbelin, H. (1995) Sequents qu'on calcule, Ph. D. thesis, Universite Paris VII.
27. Howard, W.A. (1969) The formulae-as-types notion of construction. In: Seldin, J.P. and Hindley, J. R. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, Academic Press 470–490.
28. Kamareddine, F. and Rios, A. (1995) A 2-calculus a la de Bruijn with explicit substitutions. In: Programming Languages, Implementations, Logics, and Programs 982 45–62.
29. Kamareddine, F. and Rios, A. (1997) Extending a 2-calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms. Journal of Functional Programming 7 (4) 395–420.
30. Kamareddine, F. and Rios, A. (1998) Bridging de Bruijn indices and variable names in explicit substitutions calculi. The Logic Journal of the Interest Group of Pure and Applied Logic 6 (6) 843–874.
31. Kfoury, A.J. and Wells, J.B. (1995) Addendum to New notions of reduction and non-semantic proofs of-strong normalization in typed -calculi. Tech. Rep. 95 007, Comp. Sci. Dept., Boston Univ.
32. Kleene, S.C. (1952) Introduction to Metamathematics, North-Holland.
33. Maenpaa, P. (1993) The Art of Analysis. Logic and History of Problem Solving, Ph. D. thesis, University of Helsinki.
34. Magnusson, L. (1995) The Implementation of ALF-A Proof Editor Based on Martin-Lof's Monomorphic Type Theory with Explicit Substitution, Ph. D. thesis, Chalmers University of Technology and Goteborg University.
35. Maraist, J., Odersky, M., Turner, D.N. and Wadler, P. (1995) Call-by-name, call-by-value, call-by- need, and the linear lambda calculus. Technical Report 5–95, Fakultat fur Informatik, University of Karlsruhe.
36. Mints, G. (1996) Normal forms for sequent derivations. In: Odifreddi, P. (ed.) Kreiseliana; about and around Georg Kreisel, Wellesley, Massachusetts, A. K. Peters 469–492.
37. Muoz Hurtado, C. (1996) Confluence and preservation of strong normalisation in an explicit substitutions calculus. In: Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science 440–447.
38. Muoz Hurtado, C. (1996) Proof representation in type theory: State of the art. In: XXII Latin-American Conference of Informatics CLEI Panel.
39. O'Donnell, M. (1977) Computing in Systems Described by Equations. Springer-Verlag Lecture Notes in Computer Science 58.
40. Pagano, B. (1998) An explicit natural deduction. In: proceedings of The First International Workshop on Explicit Substitution: Theory and Applications to Programs and Proofs, Tsukuba, Japan.
41. Pfenning, F. (1991) Logic programming in the LF logical framework. In: Huet, G. and Plotkin, G. (eds.) Logical Frameworks, Cambridge University Press 149–181.
42. Pfenning, F. (1995) Structural Cut Elimination. In: 10th Annual IEEE Symposium on Logic in Computer Science (LICS'95).
43. Pottinger, G. (1977) Normalization as a homomorphic image of cut-elimination. Annals of Mathematical Logic 12 323–357.
44. Prawitz, D. (1965) Natural Deduction, Almquist and Wiksell Uppsala.
45. Rios, A. (1993) Contribution a l'etude des A-calculs avec substitutions explicites, Ph. D. thesis, Universite de Paris 7.
46. Ritter, E., Pym, D. and Wallen, L.A. (1996) On the intuitionistic force of classical search. In: Miglioli, P., Moscato, U., Mundici, D. and Ornaghi, M. (eds.) Proc. of the Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods. Springer-Verlag Lecture Notes in Artificial Intelligence 1071 295–311.
47. Rose, K. (1996) Explicit substitutions – tutorial survey. Technical Report LS-96-13, BRICS, Aarhus University, Denmark.
48. Rose, K. (1996) Operational Reduction Models for Functional Programming Languages, Ph. D. thesis, University of Copenhagen.
49. Schwichtenberg, H. (1999) Termination of permutative conversions in intuitionistic Gentzen calculi. Theoretical Computer Science 212 (12) 247–260.
50. Selhab, S. (1998) Logiques et Reecriture, Ph. D. thesis, Universite Henri Poincare – Nancy 1 (Specialite Informatique), Nancy, France.
51. Troelstra, A.S. and Schwichtenberg, H. (1996) Basic Proof Theory, Cambridge Tracts in Theoretical Computer Science, 43, Cambridge University Press.
52. Vestergaard, R. (1998) The cut rule and explicit substitutions (author's cut). TR-1998-9, Dept. of CS, Uni. of Glasgow (This paper can also be downloaded from the author's homepage http://www.cee.hw.ac.uk/jrvest)
53. Vestergaard, R. (1998) A computational anomaly in the Troelstra-Schwichtenberg G3i(m) system. (Manuscript: this paper paper can be downloaded from the author's homepage http://www.cee.hw.ac.uk/~jrvest/. See also forthcoming Ph.D. thesis)
54. Vestergaard, R. (1999) The correspondence between cut-propagation-reduction and explicit substitutions. (Manuscript. See also forthcoming Ph. D. thesis.)
55. Wadler, P. (1993) A Curry-Howard isomorphism for sequent calculus. (Manuscript)
56. Zucker, J. (1974) The correspondence between cut-elimination and normalization, Part I & II. Annals of Mathematical Logic 7 112, 113–155.