Church-Rosser theorem for a rewriting system on categorical combinators

DOI10.1016/0304-3975(89)90104-7zbMath0672.03006OpenAlexW2077462786MaRDI QIDQ1119562

Hirofumi Yokouchi

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90104-7

zbMATH Keywords

confluencerewriting systemcombinatory logicfunctional programming languagescategorical combinatorsChurch Rosser theorem

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items (3)

A notation for lambda terms. A generalization of environments ⋮ Formalization of a λ-calculus with explicit substitutions in Coq ⋮ Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL

Cites Work

• Unnamed Item
• Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL
• Proof of termination of the rewriting system SUBSET on CCL
• Categorical combinators

This page was built for publication: Church-Rosser theorem for a rewriting system on categorical combinators