A recursive normalizing one-step reduction strategy for the distributive lambda calculus
نویسنده
چکیده
We positively answer the question A.1.6 in [2]: “Is there a recursive normalizing one-step reduction strategy for micro λ-calculus?” Micro λ-calculus refers to an implementation of the λ-calculus due to [1], implementing β-reduction by means of “micro steps” recursively distributing a β-redex (λx.M)N over its body M . 1 Inner spine strategy First, we provide “micro λ-calculus” with a more systematic name. Definition 1. Distributive reduction is defined as βd = β i d ∪ β c d ∪ β l d ∪ β a d , where β d = {
منابع مشابه
A Typed Lambda Calculus with Categorical Type Constructors
A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism to declare new types. Its type structure includes categorical objects like products and coproducts as well as recursive types like natural numbers and lists. It also allows duals of recursive types, i.e. lazy types, like infinite lists. It has generalized iterators for recursi...
متن کاملNormal-order reduction grammars
We present an algorithm which, for given n, generates an unambiguous regular tree grammar defining the set of combinatory logic terms, over the set {S,K} of primitive combinators, requiring exactly n normal-order reduction steps to normalize. As a consequence of Curry and Feys’s standardization theorem, our reduction grammars form a complete syntactic characterization of normalizing combinatory...
متن کاملOn the Representation of Data in Lambda-Calculus
We analyse the algorithmic properties of programs induced by the choice of the representation of data in lambda-calculus. From a logical point of view there are two canonical ways of defining the data types: the iterative one and the recursive one. Both define the same mathematical object, but we show that they have a completely different algorithmic content. The essential of the difference app...
متن کاملA Sequential Reduction Strategy
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present a computable sequential reduction strategy similar in scope, but simpler and more general. Our strategy can be thought of as an outermost-fair-like strategy that is allowed to be unfair to some redex of a term when con...
متن کاملReduction in a Linear Lambda-Calculus with Applications to Operational Semantics
We study beta-reduction in a linear lambda-calculus derived from Abramsky’s linear combinatory algebras. Reductions are classified depending on whether the redex is in the computationally active part of a term (“surface” reductions) or whether it is suspended within the body of a thunk (“internal” reductions). If surface reduction is considered on its own then any normalizing term is strongly n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1204.3158 شماره
صفحات -
تاریخ انتشار 2012