Computing in systems described by equations
From MaRDI portal
Cited in
(68)- Decidable call-by-need computations in term rewriting
- Perpetuality and uniform normalization in orthogonal rewrite systems
- Collapsed tree rewriting: Completeness, confluence, and modularity
- Normalization by leftmost innermost rewriting
- On abstract normalisation beyond neededness
- scientific article; zbMATH DE number 7204428 (Why is no real title available?)
- Algebraic and operational semantics of specifications allowing exceptions and errors
- On the correspondence between two classes of reduction systems
- Optimal normalization in orthogonal term rewriting systems
- Enumerating outer narrowing derivations for constructor-based term rewriting systems
- Programming with narrowing: a tutorial
- Conditional linearization
- Evolving combinators
- Herbrand theorems in arbitrary institutions
- Confluence and superdevelopments
- Rewriting strategies and strategic rewrite programs
- Higher-order rewrite systems and their confluence
- Full abstraction and limiting completeness in equational languages
- Simplifying conditional term rewriting systems: Unification, termination and confluence
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
- Decidable sentences of Church-Rosser congruences
- Logic and functional programming by retractions : operational semantics
- Unification modulo an equality theory for equational logic programming
- Testing confluence of nonterminating rewriting systems
- Fundamental properties of infinite trees
- Confluence theory for graphs
- On the longest perpetual reductions in orthogonal expression reduction systems
- Termination of rewriting
- Evaluation strategies for functional logic programming
- Hierarchical development of programming languages
- Sequentiality in orthogonal term rewriting systems
- Term-rewriting systems with rule priorities
- Infinite terms and infinite rewritings
- From innermost to full almost-sure termination of probabilistic term rewriting
- Exploring conditional rewriting logic computations
- Transformations of structures: An algebraic approach
- Reductions in tree replacement systems
- From LCF to Isabelle/HOL
- Algebraic semantics and complexity of term rewriting systems
- Verifying abstract data types with SNOBOL4
- On term-graph rewrite strategies
- Sequentiality, monadic second-order logic and tree automata.
- Models of programs and processes
- A rationale for conditional equational programming
- Extended term rewriting systems
- Conditional rewrite rules
- Origin tracking
- Conditional rewrite rules: Confluence and termination
- Needed computations shortcutting needed steps
- Termination of just/fair computations in term rewriting
- Disproving termination of non-erasing sole combinatory calculus with tree automata
- Transforming strongly sequential rewrite systems with constructors for efficient parallel execution
- Topics in termination
- Lazy rewriting and eager machinery
- On interreduction of semi-complete term rewriting systems
- Conditional rewriting logic as a unified model of concurrency
- Evaluation strategies for functional logic programming
- scientific article; zbMATH DE number 3926235 (Why is no real title available?)
- New Undecidability Results for Properties of Term Rewrite Systems
- Tree equivalence of linear recursive schemata is polynomial-time decidable
- Pattern-matching algorithms based on term rewrite systems
- A sequential reduction strategy
- Approximation properties of abstract data types
- Descendants and origins in term rewriting.
- Modularity in noncopying term rewriting
- Natural termination
- Default rules for Curry
This page was built for publication: Computing in systems described by equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1133323)
