Adjoint Rewriting and the !-type Constructor
نویسنده
چکیده
This paper provides a sound, complete and decidable equational theory for the terms of the (I; ;?;!)-fragment of intuitionistic linear logic with respect to the class of models known as linear categories. This work uses the natural deduction style presentation of the !-type constructor in DILL so as to be able to apply the ideas of adjoint rewriting. We obtain an expansionary-rewrite rule and contractive-rewrite rule for each type constructor and then use a variety of term rewriting techniques to obtain a decision procedure for the associated equational theory.
منابع مشابه
Normalisation and Approximation results for typeable Term Rewriting Systems (with abstraction and β-rule) Summary
There are essentially three paradigms in common use for the design of functional programming languages: the λ-calculus (LC for short), Term Rewriting Systems (TRS), and Term Graph Rewriting Systems (TGRS). The LC, or rather combinator systems, forms the underlying model for the functional programming language Miranda1 [35], TRS are used in the language OBJ [24], and TGRS form the base model for...
متن کاملUnion of Reducibility Candidates for Orthogonal Constructor Rewriting
We revisit Girard’s reducibility candidates by proposing a general of the notion of neutral terms. They are the terms which do not interact with some contexts called elimination contexts. We apply this framework to constructor rewriting, and show that for orthogonal constructor rewriting, Girard’s reducibility candidates are stable by union.
متن کاملHOR 2004 2 nd International Workshop on Higher - Order Rewriting
Natural intersection type preorders are the type structures which agree with the plain intuition of intersection type constructor as set-theoretic intersection operation and arrow type constructor as set-theoretic function space constructor. In this paper we study the relation between natural intersection type preorders and natural λ-structures, i.e. ω-algebraic lattices D with Galois connectio...
متن کاملModular Properties of Constructor-Sharing Conditional Term Rewriting Systems
First, using a recent modularity result Ohl94b] for unconditional term rewriting systems (TRSs), it is shown that semi-completeness is a modular property of constructor-sharing join conditional term rewriting systems (CTRSs). Second, we do not only extend results of Middeldorp Mid93] on the modularity of termination for disjoint CTRSs to constructor-sharing systems but also simplify the proofs ...
متن کاملDecidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ground term rewriting systems. The decidability was shown by the fact that every non-terminating TRS in the class has a loop. In this paper we modify the proof of [9] to show that both innermost termination and μ-termi...
متن کامل