Alternatives and similar repositories for multi-lang-comp:

Users that are interested in multi-lang-comp are comparing it to the libraries listed below

• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 2 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• ichistmeinname / free-proving
  Resources for "One Monad to Prove Them All"
  ☆29Updated 6 years ago
• garrigue / certint
  A Certified Interpreter for ML with Structural Polymorphism
  ☆43Updated 2 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago
• mmcqd / higher-standard
  Higher kinded polymorphism in SML
  ☆15Updated 4 years ago
• yallop / metaocaml-letrec
  flexible 'let rec' generation for MetaOCaml
  ☆26Updated last year
• bobatkey / sott
  Simplified Observational Type Theory
  ☆81Updated last year
• RedPRL / yuujinchou
  👹 A library for hierarchical names and lexical scoping
  ☆25Updated 4 months ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆45Updated 5 years ago
• jkoppel / thermometer-continuations
  Examples from our paper "Capturing the Future by Replaying the Past"
  ☆21Updated 5 months ago
• bellissimogiorno / nominal
  Haskell implementation of nominal datatypes and functions
  ☆39Updated 4 years ago
• adrieng / pulsar
  Experimental functional language
  ☆17Updated 2 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆44Updated 2 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆37Updated 6 years ago
• jashug / FormalizedCompilerAlgorithms
  Formalization in Coq of algorithms used in compilers for the Compiler.org project
  ☆15Updated 6 years ago
• elpinal / seqmod
  Full implementation of F-ing Modules, with the power of sequent calculus
  ☆20Updated 3 years ago
• jonsterling / tt
  secret project
  ☆17Updated 6 years ago
• sergei-romanenko / agda-simple-scp
  A simple supercompiler formally verified in Agda
  ☆32Updated 7 years ago
• pleiad / Refinements
  Experiments in formalizing refinement type systems in Coq
  ☆17Updated 9 years ago
• Zekt / Type-Embellishment
  Experimenting on ornamentation in Agda via reflection.
  ☆12Updated last year
• pedrotst / coquedille
  A Coq to Cedille compiler written in Coq
  ☆33Updated 4 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• CoqHott / exceptional-tt
  A Coq plugin that implements exceptions in Coq
  ☆13Updated 4 years ago
• gfngfn / toy-macro-ml
  An implementation of MacroML [Ganz, Sabry & Taha 2001]
  ☆30Updated 6 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• langston-barrett / coq-big-o
  A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.
  ☆35Updated 7 years ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 4 years ago