willcrichton / rabbotLinks
Abstract binding tree code generator
☆37Updated 8 years ago
Alternatives and similar repositories for rabbot
Users that are interested in rabbot are comparing it to the libraries listed below
Sorting:
- implementation of Pure Type Systems (PTS) in Rust.☆52Updated 8 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Updated 7 years ago
- A dependently typed programming language, and verification tool☆26Updated 9 years ago
- A type checker for the Lean theorem prover☆41Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆35Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 9 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- The Alms Programming Language☆44Updated 6 years ago
- Label dependent dependent session types☆16Updated last year
- Fungi: Typed incremental computation with names☆68Updated 5 years ago
- System POSIX bindings for Idris.☆36Updated 6 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Implementing the type system described in the paper "Complete and Easy Bidirectional Type Inference" in Rust☆46Updated 9 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- A Dependently Typed Programming Language☆27Updated 4 years ago
- A general-purpose language inspired by Scheme and Rust and Haskell and ML and cetera☆21Updated 3 years ago
- ☆29Updated 9 years ago
- A Redex Model of Rust, or more specifically an encoding of Patina, the formal model for rust's type safety☆24Updated 10 years ago
- The language of the future!☆72Updated last year
- Type Theory in Type Theory using Cubical Agda☆13Updated 6 years ago
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆51Updated 5 months ago
- ☆22Updated 9 years ago
- Implicit Drop/move protection for Rust (linear types)☆12Updated 10 years ago
- A series of implementations of a simple functional programming language.☆30Updated 9 years ago
- Generation of abstract binding trees☆28Updated 7 months ago
- type safe, concurrent, pauseless, copying, generational GC. Implementation https://github.com/Avi-D-coder/sundial-gc☆31Updated 5 years ago
- A nano "theorem prover".☆62Updated 6 years ago