A Rewriting System for Categorical Combinators with Multiple Arguments

DOI10.1137/0219005zbMATH Open0696.68041OpenAlexW2087379008MaRDI QIDQ3474271FDOQ3474271

Authors: Hirofumi Yokouchi, Teruo Hikita 

Publication date: 1990

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2433/100507

Recommendations

• Church-Rosser theorem for a rewriting system on categorical combinators
• scientific article; zbMATH DE number 4047059
• scientific article; zbMATH DE number 3941501
• On the efficiency of categorical combinators as a rewriting system
• Categorical combinators

zbMATH Keywords

functional programminglambda calculusrewriting systemChurch-Rosser propertyCategorical combinators

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Thue and Post systems, etc. (03D03) Abstract data types; algebraic specification (68Q65)

Cited In (7)

• A \(\rho\)-calculus of explicit constraint application
• Presenting a Category Modulo a Rewriting System
• Title not available (Why is that?)
• On explicit substitution with names
• An abstract framework for environment machines
• Church-Rosser theorem for a rewriting system on categorical combinators
• Using rewriting systems to compute left Kan extensions and induced actions of categories

This page was built for publication: A Rewriting System for Categorical Combinators with Multiple Arguments

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