ioanluca / real-world-idrisLinks
Malfunction backend for Idris with a FFI to OCaml
☆28Updated 6 years ago
Alternatives and similar repositories for real-world-idris
Users that are interested in real-world-idris are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆36Updated 4 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- OCaml backend for Idris2☆19Updated 4 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- being an experiment with potato power☆23Updated 5 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 5 months ago
- ☆21Updated 8 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- GRIN backend for Idris☆50Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year