Polynomial functors constrained by regular expressions

DOI10.1007/978-3-319-19797-5_6MaRDI QIDQ2941172zbMATH OpenOpenAlexFDO

Authors Dan Piponi, Brent A. Yorgey

Publication date 27 August 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-19797-5_6

zbMATH Keywords

differentiationdissectionpolynomial functorsregular expressions

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Algebraic theory of languages and automata (68Q70)

Recommendations

• Discrete Generalised Polynomial Functors
• A Kleene Theorem for Polynomial Coalgebras
• Polynomial functors and polynomial monads
• scientific article; zbMATH DE number 3870596
• A general framework for the derivation of regular expressions

Cites work

• A lattice-theoretical fixpoint theorem and its applications
• Algebraic structures for transitive closure
• Applicative programming with effects
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Clowns to the left of me, jokers to the right (pearl)
• Fun with semirings
• Handbook of weighted automata
• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• scientific article; zbMATH DE number 2182485 (Why is no real title available?)
• Nesting forward-mode AD in a functional framework
• The Zipper

Cited in

(1)

• scientific article; zbMATH DE number 3927699 (Why is no real title available?)

This page was built for publication: Polynomial functors constrained by regular expressions

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