Transfinite reductions in orthogonal term rewriting systems
From MaRDI portal
Publication:1893727
DOI10.1006/inco.1995.1075zbMath0832.68063OpenAlexW2084745607MaRDI QIDQ1893727
Ronan Sleep, Fer-Jan de Vries, Jan Willem Klop, Richard Kennaway
Publication date: 1 August 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3cd2a1882bb1dfd01b25758405f9cf9f6449c030
Related Items
Infinitary lambda calculus and discrimination of Berarducci trees., Termination and confluence in infinitary term rewriting, Infinitary rewriting: closure operators, equivalences and models, Transfinite semantics in the form of greatest fixpoint, Redex capturing in term graph rewriting (concise version), More problems in rewriting, Infinitary lambda calculi and böhm models, Productivity of stream definitions, Unnamed Item, On confluence and residuals in Cauchy convergent transfinite rewriting, Proving termination of context-sensitive rewriting by transformation, Lambda calculus with explicit recursion, Relating graph and term rewriting via Böhm models, Convergence in infinitary term graph rewriting systems is simple, Highlights in infinitary rewriting and lambda calculus, Interaction nets and term-rewriting systems, Computing in unpredictable environments: semantics, reduction strategies, and program transformations, Rational rewriting, Infinitary lambda calculus, Projections for infinitary rewriting (extended version), Counterexamples in infinitary rewriting with non-fully-extended rules, On Normalisation of Infinitary Combinatory Reduction Systems, Normalization of Infinite Terms, Termination of just/fair computations in term rewriting, Characteristic formulae for liveness properties of non-terminating CakeML programs, Properties of a first-order functional language with sharing, Projections for infinitary rewriting, Term graph rewriting, A trajectory-based strict semantics for program slicing, Categorical rewriting of term-like structures, Computable total functions on metric algebras, universal algebraic specifications and dynamical systems, Lazy productivity via termination, Metrics for weighted transition systems: axiomatization and complexity, Infinitary combinatory reduction systems, On modularity in infinitary term rewriting, Unnamed Item, Unnamed Item, A non-standard semantics for program slicing and dependence analysis, Applications of infinitary lambda calculus, Unnamed Item, A term-graph clausal logic: completeness and incompleteness results ★, Infinite \(\lambda\)-calculus and types, Transformation of Shaped Nested Graphs and Diagrams1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph)., Böhm Reduction in Infinitary Term Graph Rewriting Systems, Descendants and origins in term rewriting., Context-sensitive rewriting strategies, On Term-Graph Rewrite Strategies, The infinitary lambda calculus of the infinite eta Böhm trees, Computing in unpredictable environments: Semantics, reduction strategies, and program transformations
Uses Software
