Problems in rewriting applied to categorical concepts by the example of a computational comonad

DOI10.1007/3-540-59200-8_58MaRDI QIDQ5055832zbMATH OpenOpenAlexFDO

Authors Wolfgang Gehrke

Publication date 9 December 2022

Published in Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59200-8_58

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Functional programming and lambda calculus (68N18) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• scientific article; zbMATH DE number 1086712
• Computational types from a logical perspective
• scientific article; zbMATH DE number 3999258
• Notions of computation as monoids
• scientific article; zbMATH DE number 431765

Cites work

• scientific article; zbMATH DE number 431759 (Why is no real title available?)
• scientific article; zbMATH DE number 4179333 (Why is no real title available?)
• scientific article; zbMATH DE number 4180832 (Why is no real title available?)
• scientific article; zbMATH DE number 45228 (Why is no real title available?)
• scientific article; zbMATH DE number 50648 (Why is no real title available?)
• scientific article; zbMATH DE number 194511 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

Cited in

(1)

• The practice of logical frameworks

Describes a project that uses

Uses Software

• LARCH

This page was built for publication: Problems in rewriting applied to categorical concepts by the example of a computational comonad

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