Advanced Functional Programming

DOI10.1007/11546382zbMath1158.68356OpenAlexW4214684006MaRDI QIDQ5394302

Conor McBride

Publication date: 25 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11546382

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (13)

Extracting a DPLL Algorithm ⋮ A correct-by-construction conversion from lambda calculus to combinatory logic ⋮ Heterogeneous binary random-access lists ⋮ Eliminating dependent pattern matching without K ⋮ Recursive coalgebras from comonads ⋮ Dependent Types at Work ⋮ Program Calculation in Coq ⋮ A UNIVERSE OF STRICTLY POSITIVE FAMILIES ⋮ Congruence Closure in Intensional Type Theory ⋮ A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance ⋮ A New Elimination Rule for the Calculus of Inductive Constructions ⋮ Containers: Constructing strictly positive types ⋮ Web Interfaces for Proof Assistants

Uses Software

• Coq
• Plastic
• LEGO
• Cayenne
• Epigram

This page was built for publication: Advanced Functional Programming