Monads for the formalization of a pattern matching procedure

DOI10.1134/S0361768814030074zbMATH Open1325.68224MaRDI QIDQ2017780FDOQ2017780

Authors: A. V. Zhozhikashvili 

Publication date: 23 March 2015

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

Recommendations

• scientific article; zbMATH DE number 1086712
• Monads, partial evaluations, and rewriting
• Monadification of functional programs
• Recursive program schemes and context-free monads
• Monads for incremental computing
• On structuring functional programs with monoidal profunctors
• Modular specification of monads through higher-order presentations
• Formal verification of monad transformers
• Monadic constraint programming
• Synthesizing Monadic Predicates

zbMATH Keywords

pattern matchingKleisli construction

Mathematics Subject Classification ID

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

Cites Work

• Combining effects: sum and tensor
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Every Standard Construction is Induced by a Pair of Adjoint Functors
• Comprehending monads
• Monadic constraint programming
• Title not available (Why is that?)
• A categorical approach to unification of generalised terms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Anti-unification algorithms and their applications in program analysis
• Title not available (Why is that?)

Uses Software

• Haskell

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

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