wilbowma / multi-lang-comp
a compiler from a lambda language to an assembly language, as a rewrite system
☆16Updated last year
Related projects ⓘ
Alternatives and complementary repositories for multi-lang-comp
- an encoding of affine effect handlers using pthreads☆12Updated 2 years ago
- Experimental functional language☆18Updated 2 years ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆29Updated last year
- Resources for "One Monad to Prove Them All"☆28Updated 5 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated last month
- Higher kinded polymorphism in SML☆15Updated 4 years ago
- being an implementation of the calculus of constructions☆15Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A clean implementation of Parsing with Zippers.☆37Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Haskell implementation of nominal datatypes and functions☆39Updated 4 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆36Updated 2 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- 🪆 A Staged Type Theory☆34Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated last year
- Experiments in formalizing refinement type systems in Coq☆17Updated 8 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 3 years ago
- A simple supercompiler formally verified in Agda☆29Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- An interpreter of F-ing modules☆18Updated 5 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Simplified Observational Type Theory☆81Updated last year
- ModTT in Agda☆11Updated 3 years ago
- 🦠 Reusable components based on algebraic effects☆47Updated last month