Generic Point-free Lenses

DOI10.1007/978-3-642-13321-3_19zbMath1286.68099OpenAlexW1560650189MaRDI QIDQ3575279

Hugo Pacheco, Alcino Cunha

Publication date: 26 July 2010

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

Full work available at URL: http://hdl.handle.net/1822/38994

zbMATH Keywords

lensesinductive typespoint-freebidirectional transformationsrecursion patterns

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) General topics in the theory of data (68P01)

Related Items (3)

Generic recursive lens combinators and their calculation laws ⋮ Relations as Executable Specifications: Taming Partiality and Non-determinism Using Invariants ⋮ Contract lenses: Reasoning about bidirectional programs via calculation

This page was built for publication: Generic Point-free Lenses