Explicit Substitutions and Programming Languages
نویسندگان
چکیده
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get finer properties with respect to gradual implementations of substitutions as effectively done in runtimes of programming languages. But the theory of explicit substitutions has some defects such as non-confluence or the non-termination of the typed case. In this paper, we stress on the sub-theory of weak substitutions, which is sufficient to analyze most of the properties of programming languages, and which preserves many of the nice theorems of the λ-calculus.
منابع مشابه
Linear Explicit Substitutions ( Extended
The -calculus [1] adds explicit substitutions to the -calculus so as to provide a theoretical framework within which the implementation of functional programming languages can be studied. This paper generalises the -calculus to provide a linear calculus of explicit substitutions which analogously describes the implementation of linear functional programming languages.
متن کاملLinear Explicit Substitutions
The-calculus adds explicit substitutions to the-calculus so as to provide a theoretical framework within which the implementation of functional programming languages can be studied. This paper gen-eralises the-calculus to provide a linear calculus of explicit substitutions , called xDILL, which analogously describes the implementation of linear functional programming languages. Our main observa...
متن کاملOn Explicit Substitutions and Names ( Extended
Calculi with explicit substitutions have found widespread acceptance as a basis for abstract machines for functional languages. In this paper we investigate the relations between variants with de Bruijn-numbers, with variable names, with reduction based on raw expressions and calculi with equational judgements. We show the equivalence between these variants, which is crucial in establishing the...
متن کاملA -calculus a La De Bruijn with Explicit Substitutions 7th International Conference on Programming Languages: Implementations, Logics and Programs, Plilp95, Lncs 982, Pages 45-62
The aim of this paper is to present the s-calculus which is a very simple-calculus with explicit substitutions and to prove its connuence on closed terms and the preservation of strong normalisation of-terms. We shall prove strong normalisation of the corresponding calculus of substitution by translating it into the-calculus ACCL91], and therefore the relation between both calculi will be made ...
متن کاملPartial Applicative Theories and Explicit Substitutions
Systems based on theories with partial self-application are relevant to the formalization of constructive mathematics and as a logical basis for functional programming languages. In the literature they are either presented in the form of partial combinatory logic or the partial calculus, and sometimes these two approaches are erroneously considered to be equivalent. In this paper we address som...
متن کامل