Distributive ρ-calculus
نویسندگان
چکیده
The rewriting calculus has been introduced as a general formalism that uniformlyintegrates rewriting and λ-calculus. In this calculus all the basic ingredients ofrewriting such as rewrite rules, rule applications and results are rst-class objects.The rewriting calculus has been originally designed and used for expressing thesemantics of rule based as well as object oriented paradigms. We have previouslyshown that convergent term rewriting systems and classic strategies can be encodednaturally in the calculus.In this paper, we go a step further and we propose an extended version of thecalculus that allows one to encode unrestricted term rewriting systems. This versionof the calculus features a new evaluation rule describing the behavior of the resultstructures and a call-by-value evaluation strategy. We prove the con uence of theobtained calculus and the correctness and completeness of the proposed encoding.
منابع مشابه
Distributive Evaluations of - calculus
y Abstract In this paper we address the problem of encoding evaluation strategies for the-calculus into prime event structures. In order for this to be possible the derivation spaces yielded by the evaluation mechanism must be prime algebraic cpo's. This requirement is not met by permutation equivalence (the standard concurrent semantics with which-calculus is equipped) since the derivation spa...
متن کاملCombining Higher-Order and First-Order Computation Using ρ-calculus: Towards a semantics of ELAN
The ρ-calculus permits to express in a uniform and simple way firstorder rewriting, λ-calculus and non-deterministic computations as well as their combination. In this paper, we present the main components of the ρ-calculus and we give a full first-order presentation of this rewriting calculus using an explicit substitution setting, called ρσ, that generalizes the λσ-calculus. The basic propert...
متن کامل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 syste...
متن کاملRewriting Calculus with Fixpoints: Untyped and First-Order Systems
The rewriting calculus, also called ρ-calculus, is a framework embedding λ-calculus and rewriting capabilities, by allowing abstraction not only on variables but also on patterns. The higher-order mechanisms of the λ-calculus and the pattern matching facilities of the rewriting are then both available at the same level. Many type systems for the λ-calculus can be generalized to the ρ-calculus: ...
متن کاملBunched Hypersequent Calculi for Distributive Substructural Logics
We introduce a new proof-theoretic framework which enhances the expressive power of bunched sequents by extending them with a hypersequent structure. A general cut-elimination theorem that applies to bunched hypersequent calculi satisfying general rule conditions is then proved. We adapt the methods of transforming axioms into rules to provide cutfree bunched hypersequent calculi for a large cl...
متن کامل