A -calculus with constructors
نویسندگان
چکیده
We present an extension of the ( )-calculus with a case construct that propagates through functions like a head linear substitution, and show that this construction permits to recover the expressiveness of ML-style pattern matching. We then prove that this system enjoys the Church-Rosser property using a semi-automatic `divide and conquer' technique by which we determine all the pairs of commuting subsystems of the formalism (considering all the possible combinations of the nine primitive reduction rules). Finally, we prove a separation theorem similar to B ohm's theorem for the whole formalism.
منابع مشابه
A Categorical Model for the Lambda Calculus with Constructors
The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching à la ML into a case analysis on constants and a commutation rule between case and application constructs. Although this commutation rule does not match with the usual computing intuitions, it makes the calculus expressive and confluent, with a rather simple...
متن کاملDependency Pairs for Rewriting with Non-free Constructors
A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional program is specified as an equational rewrite system, where the rewrite system specifies the program and the equations express the relations on the constructors that generate the data structures. Unlike previous approaches, relat...
متن کاملCorrectness of Copy in Calculi with Letrec, Case, Constructors and Por
This paper extends the internal frank report 28 as follows: It is shown that for a call-by-need lambda calculus LRCCPλ extending the calculus LRCCλ by por, i.e in a lambda-calculus with letrec, case, constructors, seq and por, copying can be done without restrictions, and also that call-by-need and call-by-name strategies are equivalent w.r.t. contextual equivalence.
متن کاملA Termination Proof of Reduction in a Simply Typed Calculus with Constructors
The well-known proof of termination of reduction in simply typed calculi is adapted to a monomorphically typed lambda-calculus with case and constructors and recursive data types. The proof differs at several places from the standard proof. Perhaps it is useful and can be extended also to more complex calculi
متن کاملThird-Order Matching in the Presence of Type Constructors
We show that it is decidable whether a third order matching problem in an extension of the simply typed lambda calculus with type constructors has a solution or not We present an algorithm which given such a problem returns a solution for this problem if the problem has a solution and returns fail otherwise We also show that it is undecidable whether a third order matching problem in has a clos...
متن کامل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...
متن کامل