Deforestation, program transformation, and cut-elimination

DOI10.1016/S1571-0661(04)80904-6zbMath1260.68237OpenAlexW1965566334MaRDI QIDQ4917034

J. Robin B. Cockett

Publication date: 26 April 2013

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

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80904-6

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Cut-elimination and normal-form theorems (03F05) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Polarized subtyping ⋮ Coinduction in Flow: The Later Modality in Fibrations ⋮ The Recursion Scheme from the Cofree Recursive Comonad

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong categorical datatypes II: A term logic for categorical programming
• Deforestation: Transforming programs to eliminate trees
• Categorical logic and type theory
• Restriction categories II: Partial map classification
• A Transformation System for Developing Recursive Programs

This page was built for publication: Deforestation, program transformation, and cut-elimination