Some Properties of Conversion

Cited in

(33)

History and basic features of the critical-pair/completion procedure
Word problems and a homological finiteness condition for monoids
Synchronization and computing capabilities of linear asynchronous structures
Contributions of Ronald V. Book to the theory of string-rewriting systems
Perpetual reductions in -calculus
Developing developments
A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names.
Decomposition of data mining algorithms into unified functional blocks
On graph invariants given by linear recurrence relations
Descendants and origins in term rewriting.
Conservation and uniform normalization in lambda calculi with erasing reductions
Iterating transducers
Spinal atomic \(\lambda\)-calculus
Property transformation under specification change
Optimal reduction in replacement systems
Reductions of Residuals are Finite
Standard and Normal Reductions
Development closed critical pairs
Markov Chains Through Semigroup Graph Expansions (A Survey)
Back to futures
Gems of Corrado Böhm
Compositional Z: confluence proofs for permutative conversion
Simplified reducibility proofs of Church-Rosser for \({\beta}\)- and \({\beta}{\eta}\)-reduction
Strong normalization from an unusual point of view
Ein algebraischer Beweis für das Church-Rosser-Theorem
Decidability of elementary theories of finitely presented algebras of the variety of algebras defined by the empty system of identities
Recursive Predicates and Quantifiers
Weak normalization implies strong normalization in a class of non-dependent pure type systems
On the longest perpetual reductions in orthogonal expression reduction systems
Higher-order subtyping and its decidability
Flow hypergraph reducibility
Tangent complexes and the Diamond Lemma
On complexity of confluence and Church-Rosser proofs

This page was built for publication: Some Properties of Conversion

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