JacquesCarette / TheoriesAndDataStructuresLinks
Showing how some simple mathematical theories naturally give rise to some common data-structures
☆39Updated last year
Alternatives and similar repositories for TheoriesAndDataStructures
Users that are interested in TheoriesAndDataStructures are comparing it to the libraries listed below
Sorting:
- A small NuPRL style proof assistant☆31Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 11 months ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- Invertible parsing for S-expressions☆34Updated 6 months ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- GRIN backend for Idris☆50Updated 5 years ago
- Work in progress☆38Updated 4 months ago
- Miller/pattern unification in Agda☆67Updated 11 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated last year
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 weeks ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- ☆23Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 2 months ago