Quotient lenses

DOI10.1145/1411204.1411257zbMath1323.68071OpenAlexW4253929418MaRDI QIDQ5178774

J. Nathan Foster, Benjamin C. Pierce, Alexandre Pilkiewicz

Publication date: 16 March 2015

Published in: Proceedings of the 13th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1411204.1411257

zbMATH Keywords

lensesequivalencesregular typesBoomerangbidirectional languagesregular string transducersview update problembijective languagescanonizers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Related Items (6)

Coalgebraic update lenses ⋮ Relations as Executable Specifications: Taming Partiality and Non-determinism Using Invariants ⋮ Automated Algebraic Reasoning for Collections and Local Variables with Lenses ⋮ Contract lenses: Reasoning about bidirectional programs via calculation ⋮ \textsc{Synbit}: synthesizing bidirectional programs using unidirectional sketches ⋮ A Tangled Web of 12 Lens Laws

Uses Software

• UniProt

This page was built for publication: Quotient lenses