scientific article; zbMATH DE number 1889386
From MaRDI portal
zbMath1030.68053MaRDI QIDQ4799892
No author found.
Publication date: 30 March 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42)
Related Items
A proof method for local sufficient completeness of term rewriting systems, Formal design and verification of operational transformation algorithms for copies convergence, Relative termination via dependency pairs, The Church-Rosser theorem and quantitative analysis of witnesses, Equational logic and categorical semantics for multi-languages, Order-sorted equational generalization algorithm revisited, Transforming orthogonal inductive definition sets into confluent term rewrite systems, Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy, Productivity of stream definitions, From Jinja bytecode to term rewriting: a complexity reflecting transformation, Bridging Curry and Church's typing style, Rota's classification problem, rewriting systems and Gröbner-Shirshov bases, Proving termination of context-sensitive rewriting by transformation, A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties, Tool-assisted specification and verification of typed low-level languages, Dependency pairs for proving termination properties of conditional term rewriting systems, Geometric and combinatorial views on asynchronous computability, Resource operators for \(\lambda\)-calculus, Tyrolean termination tool: techniques and features, On tree automata that certify termination of left-linear term rewriting systems, On the verification of membrane systems with dynamic structure, On unification and admissible rules in Gabbay-de Jongh logics, Infinitary rewriting: meta-theory and convergence, Transducer degrees: atoms, infima and suprema, Modularity in term rewriting revisited, From diagrammatic confluence to modularity, Highlights in infinitary rewriting and lambda calculus, Reversible computation in term rewriting, On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories, A formalization of the Knuth-Bendix(-Huet) critical pair theorem, Complete sets of cooperations, Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility, Levels of undecidability in rewriting, Finite complete rewriting systems for regular semigroups., Counterexamples in infinitary rewriting with non-fully-extended rules, Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems, The untyped computational \(\lambda \)-calculus and its intersection type discipline, Higher-dimensional normalisation strategies for acyclicity, Stability of termination and sufficient-completeness under pushouts via amalgamation, State space reduction in the Maude-NRL protocol analyzer, Termination of just/fair computations in term rewriting, Lambda calculus with patterns, Intensional computation with higher-order functions, Exploring conditional rewriting logic computations, Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations, A coinductive approach to proof search through typed lambda-calculi, Commutative rational term rewriting, Factorization in call-by-name and call-by-value calculi via linear logic, Symbol different term rewrite systems, Free integro-differential algebras and Gröbner-Shirshov bases., Determinization of inverted grammar programs via context-free expressions, Strategies, model checking and branching-time properties in Maude, Programs as data structures in \(\lambda\)SF-calculus, Projections for infinitary rewriting, On randomised strategies in the \(\lambda \)-calculus, Polynomial time in untyped elementary linear logic, Strict coherence of conditional rewriting modulo axioms, Logic programming: laxness and saturation, The inclusion problem for regular expressions, Remarks on Thatte's transformation of term rewriting systems, Programming with narrowing: a tutorial, Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications, On equal \(\mu \)-terms, Lazy productivity via termination, The correctness of Newman's typability algorithm and some of its extensions, Infinitary combinatory reduction systems, Proving weak properties of rewriting, Termination in higher-order concurrent calculi, Characterizing and proving operational termination of deterministic conditional term rewriting systems, A compact fixpoint semantics for term rewriting systems, Decomposition orders -- another generalisation of the fundamental theorem of arithmetic, The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\), Duality of graded graphs through operads, Normal forms and normal theories in conditional rewriting, The bang calculus revisited, Ground confluence of order-sorted conditional specifications modulo axioms, A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets, Meadows and the equational specification of division, Debugging Maude programs via runtime assertion checking and trace slicing, De Bruijn's weak diamond property revisited, Bottom-up rewriting for words and terms, Confluence by critical pair analysis revisited, Composing proof terms, Applications of infinitary lambda calculus, On the completeness of order-theoretic models of the \(\lambda \)-calculus, Strong and NV-sequentiality of constructor systems, Garside combinatorics for Thompson's monoid \(F^+\) and a hybrid with the braid monoid \(B_{\infty }^{+}\), Derivational complexity and context-sensitive Rewriting, CHAP and rewrite components, Termination of narrowing revisited, Estimating costs of multi-component enterprise applications, The lambda-context calculus (extended version), Strong normalization property for second order linear logic, On-demand strategy annotations revisited: an improved on-demand evaluation strategy, Term orderings for non-reachability of (conditional) rewriting, Real or natural number interpretation and their effect on complexity, Discovering stochastic process models by reduction and abstraction, Abstract abstract reduction, Runtime complexity analysis of logically constrained rewriting, Pattern eliminating transformations, Confluence of orthogonal term rewriting systems in the prototype verification system, From Logic to Functional Logic Programs, Operational semantics of resolution and productivity in Horn clause logic, Transforming Boolean equalities into constraints, New up-to techniques for weak bisimulation, Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies, Reducing Relative Termination to Dependency Pair Problems, Unitary Theories, Unitary Categories, Stable varieties of semigroups and groupoids., String diagram rewrite theory II: Rewriting with symmetric monoidal structure, The combinator M and the Mockingbird lattice, Algebraic coherent confluence and higher globular Kleene algebras, On confluence and residuals in Cauchy convergent transfinite rewriting, On explicit substitution with names, On the Computational Content of Termination Proofs, Averaging algebras, rewriting systems and Gröbner–Shirshov bases, Size-based termination of higher-order rewriting, Jump from parallel to sequential proofs: exponentials, Equivalence checking of two functional programs using inductive theorem provers, Some properties of the -calculus, Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis, Rewriting Strategies and Strategic Rewrite Programs, Convergence in infinitary term graph rewriting systems is simple, Finding small counterexamples for abstract rewriting properties, Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings, Unnamed Item, Taking-and-merging games as rewrite games, Braids via term rewriting, A deterministic rewrite system for the probabilistic λ-calculus, Normal forms, linearity, and prime algebraicity over nonflat domains, Projections for infinitary rewriting (extended version), Safety enforcement via programmable strategies in Maude, Unnamed Item, Modular Termination of Basic Narrowing, Effectively Checking the Finite Variant Property, Maximal Termination, On Normalisation of Infinitary Combinatory Reduction Systems, Proving Quadratic Derivational Complexities Using Context Dependent Interpretations, Confluence by Decreasing Diagrams, Root-Labeling, Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations, Normalization of Infinite Terms, Rewriting-based repairing strategies for XML repositories, Unnamed Item, Unnamed Item, Unnamed Item, Lambda theories allowing terms with a finite number of fixed points, A modular order-sorted equational generalization algorithm, Unnamed Item, On linear rewriting systems for Boolean logic and some applications to proof theory, Modularity of Confluence, Automated Complexity Analysis Based on the Dependency Pair Method, Decreasing diagrams with two labels are complete for confluence of countable systems, A Biologically Inspired Model with Fusion and Clonation of Membranes, Strategic port graph rewriting: an interactive modelling framework, Using groups for investigating rewrite systems, Noncommutative Gröbner Bases: Applications and Generalizations, A survey of strategies in rule-based program transformation systems, Evaluation strategies for functional logic programming, Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus, REFLECTORS AND GLOBALIZATIONS OF PARTIAL ACTIONS OF GROUPS, Diagrammatic confluence for Constraint Handling Rules, Proof Pearl: Abella Formalization of λ-Calculus Cube Property, Canonical Ground Horn Theories, Canonicity1 1This research was supported in part by the Israel Science Foundation (grant no. 254/01)., Pure bigraphs: structure and dynamics, A stable programming language, On modularity in infinitary term rewriting, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting, Asynchronous games. II: The true concurrency of innocence, Unnamed Item, First-class patterns, Unnamed Item, Unnamed Item, Methods for Proving Termination of Rewriting-based Programming Languages by Transformation, Finding a Forest in a Tree, CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates, Confluence Results for a Quantum Lambda Calculus with Measurements, Unnamed Item, ON THE TERMINATION OF RUSSELL’S DESCRIPTION ELIMINATION ALGORITHM, Order-Sorted Generalization, Canalyzing minors of Boolean functions, Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian, ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS, Polygraphs of finite derivation type, Lazy Context Cloning for Non-Deterministic Graph Rewriting, Improving the Context-sensitive Dependency Graph, Bigraphs and Their Algebra, Sub-λ-calculi, Classified, COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY, Observational Coalgebras and Complete Sets of Co-operations, On Term-Graph Rewrite Strategies, Minimality in a Linear Calculus with Iteration, Narrowing and Rewriting Logic: from Foundations to Applications, On the complexity of stream equality, Directed Homotopy in Non-Positively Curved Spaces, Unnamed Item, Unnamed Item, AbU: a calculus for distributed event-driven programming with attribute-based interaction, An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis, Mockingbird lattices, The Maude strategy language, Complementary proof nets for classical logic, Local confluence of conditional and generalized term rewriting systems, Variant-based equational anti-unification, The conservation theorem for differential nets, Unnamed Item, Unnamed Item, Unnamed Item, Singular and plural functions for functional logic programming, Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting, A Transformational Approach to Prove Outermost Termination Automatically, Completion after Program Inversion of Injective Functions, Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions, A Term Rewriting Technique for Decision Graphs, Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness, Compiling Collapsing Rules in Certain Constructor Systems, A PVS Theory for Term Rewriting Systems, Variant Narrowing and Equational Unification, The bang calculus revisited, Decreasing Diagrams and Relative Termination, Termination Tools in Ordered Completion, Complexity Analysis by Rewriting, Types for Hereditary Head Normalizing Terms, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Characterizing Compatible View Updates in Syntactic Bidirectionalization, Improving rewriting induction approach for proving ground confluence, <scp>Champ</scp>: a Cherednik algebra<scp>Magma</scp>package, A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs, Infinitary affine proofs, The infinitary lambda calculus of the infinite eta Böhm trees, Clocked lambda calculus, Rewriting in Gray categories with applications to coherence, Confluence of algebraic rewriting systems, Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs, On reduction and normalization in the computational core
