Some Properties of Conversion
From MaRDI portal
Publication:5763294
DOI10.2307/1989762zbMath0014.38504OpenAlexW4230678059WikidataQ56138574 ScholiaQ56138574MaRDI QIDQ5763294
J. Barkley Rosser, Alonzo Church
Publication date: 1936
Full work available at URL: https://doi.org/10.2307/1989762
Related Items
Recursive Predicates and Quantifiers, Reductions of Residuals are Finite, Standard and Normal Reductions, Back to futures, History and basic features of the critical-pair/completion procedure, Word problems and a homological finiteness condition for monoids, Higher-order subtyping and its decidability, Developing developments, A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names., Spinal atomic \(\lambda\)-calculus, Flow hypergraph reducibility, Ein algebraischer Beweis für das Church-Rosser-Theorem, Development closed critical pairs, Compositional Z: confluence proofs for permutative conversion, Strong normalization from an unusual point of view, Optimal reduction in replacement systems, Simplified Reducibility Proofs of Church-Rosser for β- and βη-reduction, Decidability of elementary theories of finitely presented algebras of the variety of algebras defined by the empty system of identities, Weak normalization implies strong normalization in a class of non-dependent pure type systems, On the longest perpetual reductions in orthogonal expression reduction systems, Synchronization and computing capabilities of linear asynchronous structures, Decomposition of data mining algorithms into unified functional blocks, Unnamed Item, On graph invariants given by linear recurrence relations, Contributions of Ronald V. Book to the theory of string-rewriting systems, Perpetual reductions in \(\lambda\)-calculus, Descendants and origins in term rewriting., Conservation and uniform normalization in lambda calculi with erasing reductions, Iterating transducers, Markov Chains Through Semigroup Graph Expansions (A Survey)
