Tree-Manipulating Systems and Church-Rosser Theorems

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Trees (05C05) Recursive functions and relations, subrecursive hierarchies (03D20) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)

Cited In (only showing first 100 items - show all)

Non-Looping String Rewriting
Final algebra semantics and data type extensions
Lambda-calculus with director strings
Confluence by critical pair analysis revisited
On the correspondence between two classes of reduction systems
Some results on the confluence property of combined term rewriting systems
Algebraic and operational semantics of specifications allowing exceptions and errors
Title not available (Why is that?)
Algebraic solutions to recursion schemes
Optimal evaluations of graph-like expressions
Speeding up subtree replacement systems
Deriving graphs from graphs by applying a production
Chain properties of rule closures
Confluence and superdevelopments
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
Title not available (Why is that?)
Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem
Graph grammars and operational semantics
The Church-Rosser property in symmetric combinatory logic
Confluence without termination via parallel critical pairs
Church-Rosser strategies in the lambda calculus
Confluence of indirection reductions in graph rewrite systems
Transfinite reductions in orthogonal term rewriting systems
Formalising confluence in PVS
On the tree-transformation power of XSLT
IO and OI. II
Confluence of the lambda calculus with left-linear algebraic rewriting
Decreasing diagrams and relative termination
Decreasing diagrams and relative termination
Deterministic tree pushdown automata and monadic tree rewriting systems
Recognizable formal power series on trees
(A-)synchronous (non)-deterministic cell spaces simulating each other
On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
Decidable sentences of Church-Rosser congruences
Fundamental properties of infinite trees
A modified tree-to-tree correction problem
Termination of rewriting
A representation of trees by languages. II
A combinatory account of internal structure
IO and OI. I
Confluence by decreasing diagrams
An axiomatic approach to the Korenjak-Hopcroft algorithms
Semantics and strong sequentiality of priority term rewriting systems
Developing developments
Testing for the Church-Rosser property
Monadic Thue systems
When is a monoid a group? The Church-Rosser case is tractable
A representation of trees by languages. I
Diagram techniques for confluence
From Rules to Constraint Programs with the Rules2CP Modelling Language
A note on special thue systems with a single defining relation
A note on thue systems with a single defining relation
Infinite trees in normal form and recursive equations having a unique solution
On explicit substitution with names
Title not available (Why is that?)
Reductions in tree replacement systems
Finite canonical rewriting systems for congruences generated by concurrency relations
An algebraic definition for control structures
Title not available (Why is that?)
Shallow confluence of conditional term rewriting systems
Least fixed points revisited
History and basic features of the critical-pair/completion procedure
An abstract Church-Rosser theorem. II: Applications
Attacking a public key cryptosystem based on tree replacement
The Church-Rosser property for ground term-rewriting systems is decidable
DPDA's in 'Atomic normal form' and applications to equivalence problems
Correctness of parallel programs: The Church-Rosser approach
Axiomatisation des tests
On interreduction of semi-complete term rewriting systems
Title not available (Why is that?)
Persistence of vector replacement systems is decidable
Efficient ground completion
Mixed computation: potential applications and problems for study
Program equivalence and context-free grammars
On reduction of asynchronous systems
Church-Rosser systems with respect to formal languages
A class of replacement systems with simple optimality theory
Proving Confluence of Term Rewriting Systems Automatically
Dependent types with subtyping and late-bound overloading
Polymorphic extensions of simple type structures. With an application to a bar recursive minimization
Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping
Implementation of Deadlock Analysis in Data Flow Graphs
Extending graph rewriting with copying
Addressable approximations to nonaddressable data graphs
Interaction nets for linear logic
The Equivalence of Complete Reductions
Local confluence of conditional and generalized term rewriting systems
Confluence and commutation for nominal rewriting systems with atom-variables
Functional systems: Theoretical and practical aspects
Decreasing diagrams with two labels are complete for confluence of countable systems
Aλδ-calculus with an algorithmicδ
The Church-Rosser property in dual combinatory logic
Confluence of orthogonal term rewriting systems in the prototype verification system
Ein algebraischer Beweis für das Church-Rosser-Theorem
Checking overlaps of nominal rewriting rules
Recursive converters on a memory
Synchronization and computing capabilities of linear asynchronous structures
Certifying confluence proofs via relative termination and rule labeling
A theory of reversibility for Erlang
On complexity bounds and confluence of parallel term rewriting

This page was built for publication: Tree-Manipulating Systems and Church-Rosser Theorems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5684229)