Characterizing functions mappable over GADTs

DOI10.1007/978-3-031-21037-2_7MaRDI QIDQ6176570zbMATH OpenOpenAlexFDO

Authors Patricia Johann, Pierre Cagne

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

GADTsinitial algebra semanticsmap functions

Mathematics Subject Classification ID

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

Recommendations

• Foundations for structured programming with GADTs
• Ghostbuster: a tool for simplifying and converting GADTs
• Parametricity for nested types and GADTs
• GADTs Meet Subtyping

Cites work

• An improved general \(E\)-unification method
• Containers: Constructing strictly positive types
• Discrete Generalised Polynomial Functors
• Foundations for structured programming with GADTs
• Guarded recursive datatype constructors
• scientific article; zbMATH DE number 3967883 (Why is no real title available?)
• scientific article; zbMATH DE number 977284 (Why is no real title available?)
• scientific article; zbMATH DE number 1956503 (Why is no real title available?)
• Indexed containers
• Initial Algebra Semantics Is Enough!
• Meta-programming with built-in type equality

Cited in

(1)

• GADTs are not (even partial) functors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6176570)