Monads for the formalization of a pattern matching procedure

DOI10.1134/S0361768814030074zbMath1325.68224MaRDI QIDQ2017780

A. V. Zhozhikashvili

Publication date: 23 March 2015

Published in: Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

pattern matchingKleisli construction

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Knowledge representation (68T30) Abstract data types; algebraic specification (68Q65) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15)

Uses Software

• Haskell

Cites Work

• Combining effects: sum and tensor
• A categorical approach to unification of generalised terms1 1This work has been developed as a cooperation organised within COST 274.
• Anti-unification Algorithms and Their Applications in Program Analysis
• Monadic constraint programming
• Comprehending monads
• Every Standard Construction is Induced by a Pair of Adjoint Functors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Monads for the formalization of a pattern matching procedure