joelburget / lvca
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
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- An interpreter of F-ing modules☆19Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Kempe is a compiled stack-based language☆58Updated 6 months ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- An error-tolerant live programming environment (my Master's thesis)☆18Updated 2 years ago
- A type-safe, stack-based functional programming language☆16Updated last month
- a self-hosting lambda calculus compiler☆35Updated 2 weeks ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A clean implementation of Parsing with Zippers.☆37Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆43Updated 2 months ago
- A nano "theorem prover".☆62Updated 6 years ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆89Updated 6 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Fωμ type checker and compiler☆53Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Standard library for the Formality language☆18Updated 5 years ago
- An extended typed Lambda Calculus☆21Updated 8 months ago
- Example row-polymorphism implementations☆61Updated last year
- dependently-typed lisp with flexible compiler backends☆27Updated 5 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆32Updated 6 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 dependent type theory with user defined data types☆46Updated 3 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- BDD-based implementation of Datalog☆37Updated 4 years ago
- LaTeX sources for the Habit Programming Language Report☆24Updated 6 years ago