Characterizing functions mappable over GADTs

DOI10.1007/978-3-031-21037-2_7zbMath1524.68200OpenAlexW4312704362MaRDI QIDQ6176570

Pierre Cagne, Patricia Johann

Publication date: 25 July 2023

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-21037-2_7

zbMATH Keywords

initial algebra semanticsGADTsmap functions

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Categorical semantics of formal languages (18C50)

Cites Work

• An improved general \(E\)-unification method
• Containers: Constructing strictly positive types
• Meta-programming With Built-in Type Equality
• Guarded recursive datatype constructors
• Discrete Generalised Polynomial Functors
• Foundations for structured programming with GADTs
• Initial Algebra Semantics Is Enough!
• Indexed containers
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing functions mappable over GADTs