wilbowma / multi-lang-compLinks
a compiler from a lambda language to an assembly language, as a rewrite system
☆16Updated last month
Alternatives and similar repositories for multi-lang-comp
Users that are interested in multi-lang-comp are comparing it to the libraries listed below
Sorting:
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆90Updated 6 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆32Updated 6 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated 2 years ago
- Constructive Galois connections☆35Updated 7 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Simplified Observational Type Theory☆85Updated 2 years ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- Benchmark repository of polyglot effect handler examples☆30Updated 2 months ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- MetaML and MetaOCaml bibliography☆94Updated 11 months ago
- Haskell implementation of nominal datatypes and functions☆44Updated 5 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago