Polynomial Functors Constrained by Regular Expressions
From MaRDI portal
Publication:2941172
DOI10.1007/978-3-319-19797-5_6zbMath1432.68269OpenAlexW817927329MaRDI QIDQ2941172
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
Algebraic theory of languages and automata (68Q70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Handbook of weighted automata
- Nesting forward-mode AD in a functional framework
- Algebraic structures for transitive closure
- A lattice-theoretical fixpoint theorem and its applications
- Clowns to the left of me, jokers to the right (pearl)
- The Zipper
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Fun with semirings
- Applicative programming with effects
This page was built for publication: Polynomial Functors Constrained by Regular Expressions