Testing for the Church-Rosser Property

DOI10.1145/321850.321862zbMATH Open0308.68077OpenAlexW2033278487MaRDI QIDQ4066643FDOQ4066643

Ravi Sethi

Publication date: 1974

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321850.321862

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cited In (11)

• Roundoff analyses and sparse data
• Confluence Modulo Equivalence in Constraint Handling Rules
• An algorithm for testing lossless join property in relational databases
• A generalized mathematical theory of structured programming
• Rewriting systems over similarity and generalized pseudometric spaces and their properties
• History and basic features of the critical-pair/completion procedure
• Correctness of parallel programs: The Church-Rosser approach
• Church-Rosser converters
• On proving confluence modulo equivalence for Constraint Handling Rules
• On reduction of asynchronous systems
• Church-Rosser systems with respect to formal languages

This page was built for publication: Testing for the Church-Rosser Property

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