Monads for the formalization of a pattern matching procedure
From MaRDI portal
Publication:2017780
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
Cites work
- scientific article; zbMATH DE number 4179333 (Why is no real title available?)
- scientific article; zbMATH DE number 3966050 (Why is no real title available?)
- scientific article; zbMATH DE number 3666758 (Why is no real title available?)
- scientific article; zbMATH DE number 193170 (Why is no real title available?)
- scientific article; zbMATH DE number 195199 (Why is no real title available?)
- scientific article; zbMATH DE number 3227055 (Why is no real title available?)
- scientific article; zbMATH DE number 3251418 (Why is no real title available?)
- A categorical approach to unification of generalised terms
- Anti-unification algorithms and their applications in program analysis
- Combining effects: sum and tensor
- Comprehending monads
- Every Standard Construction is Induced by a Pair of Adjoint Functors
- Monadic constraint programming
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)