Strongly normalising cyclic data computation by iteration categories of second-order algebraic theories

DOI10.4230/LIPICS.FSCD.2016.21zbMATH Open1388.68188OpenAlexW2479043907MaRDI QIDQ5369486FDOQ5369486

Authors: Makoto Hamana 

Publication date: 17 October 2017

Full work available at URL: https://dblp.uni-trier.de/db/conf/rta/fscd2016.html#Hamana16

Recommendations

• Cyclic datatypes modulo bisimulation based on second-order algebraic theories
• Iteration 2-theories
• On second-order iterative monads
• Strong categorical datatypes II: A term logic for categorical programming
• Initial Algebra Semantics for Cyclic Sharing Structures

zbMATH Keywords

fixed pointfunctional programmingfoldcyclic data structurestraced Cartesian category

Mathematics Subject Classification ID

Theories (e.g., algebraic theories), structure, and semantics (18C10) Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65)

Cited In (3)

• The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
• Cyclic datatypes modulo bisimulation based on second-order algebraic theories
• How to prove decidability of equational theories with second-order computation analyser SOL

This page was built for publication: Strongly normalising cyclic data computation by iteration categories of second-order algebraic theories

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