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
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Invertible parsing for S-expressions☆34Updated 9 months ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years 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 last year
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated last week
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Session types in Idris2!☆27Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- GRIN backend for Idris☆50Updated 5 years ago
- ☆26Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Miller/pattern unification in Agda☆66Updated 2 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago