Cyclic datatypes modulo bisimulation based on second-order algebraic theories

DOI10.23638/LMCS-13(4:8)2017zbMATH Open1398.68348arXiv1705.06430MaRDI QIDQ4596785FDOQ4596785

Authors: Makoto Hamana 

Publication date: 11 December 2017

Full work available at URL: https://arxiv.org/abs/1705.06430

Recommendations

• Strongly normalising cyclic data computation by iteration categories of second-order algebraic theories
• A strict functional language with cyclic recursive data
• scientific article; zbMATH DE number 1088036
• How to prove decidability of equational theories with second-order computation analyser SOL
• Strong categorical datatypes II: A term logic for categorical programming

zbMATH Keywords

fixed pointfunctional programmingcategorical semanticsfolditeration theorycyclic data structuresgeneral schematraced Cartesian category

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Categorical semantics of formal languages (18C50) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (2)

• Strongly normalising cyclic data computation by iteration categories of second-order algebraic theories
• Theory and practice of second-order rewriting: foundation, evolution, and SOL

This page was built for publication: Cyclic datatypes modulo bisimulation based on second-order algebraic theories

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