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:
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- IO using sized types and copatterns☆36Updated 4 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Invertible parsing for S-expressions☆34Updated 8 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years 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
- Experimental normalisation via scheme☆12Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆21Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- Material for the Agda course at the EUTYPES Summer School '19 in Ohrid☆23Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- being an experiment with potato power☆23Updated 5 years ago
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆14Updated 5 years ago
- Work in progress☆38Updated 6 months ago