Programming with ornaments

DOI10.1017/S0956796816000307zbMATH Open1418.68035MaRDI QIDQ5372000FDOQ5372000

Jeremy Gibbons, Hsiang-Shang Ko

Publication date: 23 October 2017

Published in: Journal of Functional Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• Title not available (Why is that?)
• Dependent Types at Work
• Inductive families
• Type-theory in color
• Purely Functional Data Structures
• The view from the left
• Types for proofs and programs. International workshop, TYPES 2003, Torino, Italy, April 30 -- May 4, 2003. Revised selected papers.
• Advanced functional programming. 6th international school, AFP 2008, Heijen, The Netherlands, May 2008. Revised lectures
• Eliminating Dependent Pattern Matching
• On the bright side of type classes
• The gentle art of levitation
• Pattern matching without K
• How to keep your neighbours in order
• Programming in Ωmega
• Transporting functions across ornaments

Cited In (4)

• Heterogeneous binary random-access lists
• Calculating datastructures
• Title not available (Why is that?)
• Ornaments for Proof Reuse in Coq

Uses Software

• Agda

This page was built for publication: Programming with ornaments

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