wilbowma / multi-lang-comp
a compiler from a lambda language to an assembly language, as a rewrite system
☆16Updated 10 months ago
Related projects: ⓘ
- an encoding of affine effect handlers using pthreads☆13Updated last year
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆28Updated last year
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 3 years ago
- An interpreter of F-ing modules☆18Updated 5 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆30Updated 5 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆28Updated 3 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 months ago
- Experimental functional language☆18Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Higher kinded polymorphism in SML☆16Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 2 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 7 years ago
- A cost-aware logical framework, embedded in Agda.☆52Updated last month
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆23Updated 3 years ago
- secret project☆17Updated 6 years ago
- A Coq plugin that implements exceptions in Coq☆14Updated 3 years ago
- flexible 'let rec' generation for MetaOCaml☆22Updated last year
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 5 years ago
- A simple supercompiler formally verified in Agda☆29Updated 7 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- Experiments in formalizing refinement type systems in Coq☆17Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Resources for "One Monad to Prove Them All"☆28Updated 5 years ago
- ☆14Updated this week