Correct Looping Arrows from Cyclic Terms

DOI10.1007/978-3-642-29822-6_13MaRDI QIDQ2900260zbMATH OpenOpenAlexFDO

Authors Makoto Hamana

Publication date 20 July 2012

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29822-6_13

Mathematics Subject Classification ID

Categorical semantics of formal languages (18C50) Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 2185716
• Traced Monads and Hopf Monads
• Rewriting on cyclic structures: Equivalence between the operational and the categorical description
• On building cyclic and shared structures in Haskell
• Cyclic monads and their application
• scientific article; zbMATH DE number 3959427
• Decomposing typed lambda calculus into a couple of categorical programming languages
• \(\eta\)-equivalence in core dependent Haskell
• scientific article; zbMATH DE number 3985475
• A-translation and looping combinators in pure type systems

Cited in

(1)

• The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: Correct Looping Arrows from Cyclic Terms

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