The essence of ornaments
From MaRDI portal
Publication:5372005
Recommendations
Cites work
- scientific article; zbMATH DE number 3910392 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 2182485 (Why is no real title available?)
- scientific article; zbMATH DE number 6296049 (Why is no real title available?)
- A Categorical Treatment of Ornaments
- A UNIVERSE OF STRICTLY POSITIVE FAMILIES
- A set constructor for inductive sets in Martin-Löf's type theory
- Complete and decidable type inference for GADTs
- Idris, a general-purpose dependently typed programming language: Design and implementation
- Indexed containers
- Inductive families
- Locally cartesian closed categories and type theory
- Polynomial functors and polynomial monads
- Programming in Ωmega
- Purely Functional Data Structures
- Refining inductive types
- Representing inductively defined sets by wellorderings in Martin-Löf's type theory
- Secure distributed programming with value-dependent types
- Stratified type inference for generalized algebraic data types
- The Category-Theoretic Solution of Recursive Domain Equations
- The Zipper
- Transporting functions across ornaments
- Types for Proofs and Programs
Cited in
(6)
This page was built for publication: The essence of ornaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5372005)