Generic recursive lens combinators and their calculation laws
From MaRDI portal
Publication:2123055
DOI10.1016/j.tcs.2022.02.019zbMath1499.68071OpenAlexW4213199541MaRDI QIDQ2123055
Publication date: 7 April 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.02.019
Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Data structures and program transformation
- Containers: Constructing strictly positive types
- Edit lenses
- Generic Point-free Lenses
- Initial Algebra Semantics and Continuous Algebras
- Can programming be liberated from the von Neumann style?
- Bidirectionalization transformation based on automatic derivation of view complement functions
- Bidirectionalization for free! (Pearl)
- Symmetric lenses
- Programming Languages and Systems