On the efficiency of categorical combinators as a rewriting system

DOI10.1002/spe.4380170807zbMath0641.68020OpenAlexW2014841514MaRDI QIDQ3782744

Rafael Dueire Lins

Publication date: 1987

Published in: Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/spe.4380170807

zbMATH Keywords

Cartesian closed categoriesrewriting systemsfunctional programmingcombinatory logictyped \(\lambda \)-calculusapplicative languagescategorical combinators

Mathematics Subject Classification ID

Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Uses Software

• Miranda

Cites Work

• The categorical abstract machine
• Another algorithm for bracket abstraction
• Unnamed Item
• Unnamed Item

This page was built for publication: On the efficiency of categorical combinators as a rewriting system