joelburget / lvcaLinks
language verification, construction, and analysis
☆20Updated 3 years ago
Alternatives and similar repositories for lvca
Users that are interested in lvca are comparing it to the libraries listed below
Sorting:
- An interpreter of F-ing modules☆19Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- a self-hosting lambda calculus compiler☆35Updated 2 months ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- 🦠 Reusable components based on algebraic effects☆50Updated 8 months ago
- Kempe is a compiled stack-based language☆58Updated 8 months ago
- A type-safe, stack-based functional programming language☆16Updated 3 months ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- Đ (Edh) - The next-big-things ought to happen with Haskell not C/C++☆28Updated 11 months ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- An error-tolerant live programming environment (my Master's thesis)☆18Updated 2 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- Tools for record-and-replay debugging☆43Updated 2 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆37Updated 2 years ago
- A library with an encoding of higher kinded types in OCaml☆40Updated this week
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Recursion schemes in ATS☆9Updated 3 years ago
- small programming language. pls be gentle.☆39Updated last month
- A template for you to implement Hazelnut yourself☆22Updated 4 months ago
- A verified compiler for a lazy functional language☆36Updated 2 weeks ago
- A structure editor for a simple functional programming language, with Vim-like shortcuts and commands.☆15Updated last year
- A nano "theorem prover".☆62Updated 6 years ago