Abstract
The λ-calculus and its typed versions are important tools for studying most fundamental computation and deduction paradigms. However, the non-trivial nature of substitution, as used in the definition of λ-reduction notably, has spurred the design of various first-order languages representing λ-terms, λ-reduction and λ-conversion, where computation is simple, first-order rewriting, and substitution becomes an easy notion again. Let us cite Curry’s combinators [7], Curien’s categorical combinators [5], the myriad of so-called λ-calculi with explicit substitutions, among which λσ [1], λσ⇑. [12], λυ [17], λζ [19], etc. Unfortunately, each one of these calculi has defects: Curry’s combinators do not model λ-conversion fully, categorical combinators, λσ and λσ⇑ do not normalize strongly in the typed case [18], λυ is not confluent in the presence of free variables (a.k.a. metavariables), λζ models λ-conversion but not λ-reduction, etc.
This work has been done in the context of Dyade (Bull/Inria R&D joint venture).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. In POPL’90, pages 31–46, 1990. 106, 119
S. van Bakel. Complete restrictions of the intersection type discipline. Theoretical Computer Science, 102(1):135–163, 1992. 110, 115
H. Barendregt. The Lambda Calculus, Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1984. 107, 119
F. Cardone and M. Coppo. Two extensions of Curry’s type inference system. In P. Odifreddi, editor, Logic and Computer Science, volume 31 of The APIC Series, pages 19–76. Academic Press, 1990. 106, 109
P.-L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Pitman, London, 1986. 106
P.-L. Curien, T. Hardin, and J.-J. Lévy. Confluence properties of weak and strong calculi of explicit substitutions. J. ACM, 43(2):362–397, 1996. 119
H. B. Curry and R. Feys. Combinatory Logic, volume 1. North-Holland, 1958. 106
J. Gallier. Typing untyped λ-terms, or reducibility strikes again! Annals of Pure and Applied Logic, 91(2–3):231–270, 1998. 110, 118, 119
H. Goguen and J. Goubault-Larrecq. Sequent combinators: A Hilbert system for the lambda calculus. Mathematical Structures in Computer Science, 1999. 106, 107, 108, 109, 110, 112, 115, 119
J. Goubault-Larrecq. On computational interpretations of the modal logic S4 IIIb. Confluence and conservativity of the λevQ-calculus. Research report, Inria, 1997. 112
J. Goubault-Larrecq. A few remarks on SKInT. Research report RR-3475, Inria, 1998. 107, 110, 112, 113, 117
T. Hardin and J.-J. Lévy. A confluent calculus of substitutions. In France-Japan Artificial Intelligence and Computer Science Symposium, 1989. 106
F. Kamareddine and A. Ríos. A λ-calculus à la de Bruijn with explicit substitutions. In PLILP’95, pages 45–62. Springer Verlag LNCS 982, 1995. 119
F. Kamareddine and A. Ríos. Extending a λ-calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms. Journal of Functional Programming, 7:395–420, 1997. 119
J.-L. Krivine. Lambda-calcul, types et modéles. Masson, 1992. 110, 119
F. Lang and K. H. Rose. Two equivalent calculi of explicit substitution with confluence on meta-terms and preservation of strong normalization (one with names and one first-order). Presented at WESTAPP’98, 1998. 119
P. Lescanne and J. Rouyer-Degli. From λσ to λυ: a journey through calculi of explicit substitutions. In POPL’94, 1994. 106, 119
P.-A. Melliés. Typed lambda-calculi with explicit substitutions may not terminate. In TLCA’95, pages 328–334. Springer Verlag LNCS 902, 1995. 106
C. A. Muñoz Hurtado. Confluence and preservation of strong normalization in an explicit substitutions calculus. In LICS’96. IEEE, 1996. 106, 119
P. Sallé. Une extension de la théorie des types en λ-calcul. In 5th ICALP, pages 398–410. Springer Verlag LNCS 62, 1978. 106, 109
é. Sayag. Types intersections simples. PhD thesis, Université Paris VII, 1997. 110, 115
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goubault-Larrecq, J. (1999). Conjunctive Types and SKInT. In: Altenkirch, T., Reus, B., Naraschewski, W. (eds) Types for Proofs and Programs. TYPES 1998. Lecture Notes in Computer Science, vol 1657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48167-2_8
Download citation
DOI: https://doi.org/10.1007/3-540-48167-2_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66537-3
Online ISBN: 978-3-540-48167-6
eBook Packages: Springer Book Archive