LightAndLight / idris-but-its-c
Idris, but it's C
☆24Updated 6 years ago
Alternatives and similar repositories for idris-but-its-c:
Users that are interested in idris-but-its-c are comparing it to the libraries listed below
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- secret project☆17Updated 7 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- The Alms Programming Language☆44Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 6 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Build tool for ATS.☆41Updated 3 years ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- ☆26Updated 8 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 4 months ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- TODO☆23Updated 9 years ago
- Experiments in formalizing refinement type systems in Coq☆17Updated 9 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- The Prettiest Printer☆34Updated last year
- Concurrent IO language with Uniqueness Types☆9Updated 9 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago