The essence of ornaments
From MaRDI portal
Publication:5372005
DOI10.1017/S0956796816000356zbMATH Open1418.68032OpenAlexW2181666843MaRDI QIDQ5372005FDOQ5372005
Publication date: 23 October 2017
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796816000356
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65)
Cites Work
- Title not available (Why is that?)
- Idris, a general-purpose dependently typed programming language: Design and implementation
- Secure distributed programming with value-dependent types
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Category-Theoretic Solution of Recursive Domain Equations
- Inductive families
- Locally cartesian closed categories and type theory
- Transporting functions across ornaments
- A Categorical Treatment of Ornaments
- The Zipper
- Purely Functional Data Structures
- Polynomial functors and polynomial monads
- Types for Proofs and Programs
- Representing inductively defined sets by wellorderings in Martin-Löf's type theory
- Complete and decidable type inference for GADTs
- Stratified type inference for generalized algebraic data types
- A set constructor for inductive sets in Martin-Löf's type theory
- A UNIVERSE OF STRICTLY POSITIVE FAMILIES
- Indexed containers
- Title not available (Why is that?)
- Programming in Ωmega
- Refining inductive types
Cited In (3)
Uses Software
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)
