JacquesCarette / TheoriesAndDataStructures
Showing how some simple mathematical theories naturally give rise to some common data-structures
☆38Updated 8 months ago
Alternatives and similar repositories for TheoriesAndDataStructures:
Users that are interested in TheoriesAndDataStructures are comparing it to the libraries listed below
- Invertible parsing for S-expressions☆34Updated 5 months ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 2 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆44Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆29Updated 6 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 2 months ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆11Updated 6 years ago
- ☆29Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Paper and talk☆50Updated last year
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A talk☆28Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- Anders: Cubical Type Checker☆22Updated last year
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- IO using sized types and copatterns☆33Updated 3 years ago