Alternatives and similar repositories for MyPLZoo

Users that are interested in MyPLZoo are comparing it to the libraries listed below

• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆26Updated 5 years ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆40Updated last year
• JoeyEremondi / GDTL-artifact
  A Gradual Dependently-typed Language
  ☆14Updated 6 years ago
• jsiek / arete
  Arete is an experimental programming language.
  ☆12Updated 2 years ago
• maxsnew / synthetic-domain-theory
  Experiment with synthetic domain theory in cubical agda
  ☆14Updated 3 years ago
• herbie-fp / regraph
  Racket Equivalence Graph Library
  ☆19Updated 3 years ago
• sweirich / lambda-calculus
  Denotational Semantics of the Untyped Lambda Calculus
  ☆17Updated 11 months ago
• arthuraa / memory-safe-language
  A formalization of properties of a simple imperative, memory-safe language.
  ☆20Updated 4 years ago
• jsiek / denotational_semantics
  Denotational semantics based on graph and filter models
  ☆23Updated last year
• brownplt / Resugarer
  Lifting Reduction Semantics through Syntactic Sugar
  ☆13Updated 7 years ago
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆25Updated 2 years ago
• david-christiansen / dan-scheme
  A very little language
  ☆16Updated 2 years ago
• RobertHarper / pl-syntax
  PL syntax macros.
  ☆21Updated 2 months ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆33Updated 4 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• plum-umd / cgc
  Constructive Galois connections
  ☆36Updated 7 years ago
• koengit / intuit
  An automated theorem prover for intuitionistic propostional logic
  ☆14Updated 5 years ago
• pnwamk / sst-tutorial
  ☆18Updated 4 years ago
• wilbowma / experimenting-with-redex
  A Redex tutorial with a focus on how to do work in Redex
  ☆11Updated last year
• gregr / first-order-miniKanren
  miniKanren with a first-order representation of the search space
  ☆17Updated last year
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 4 years ago
• ankitku / TAL0
  Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.
  ☆23Updated 9 years ago
• jsiek / B522-PL-Foundations
  Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University
  ☆55Updated 5 years ago
• plclub / cbpv-effects-coeffects
  Formalization of CBPV extended with effect and coeffect tracking
  ☆14Updated last year
• annenkov / two-level
  Two-Level Type Theory
  ☆28Updated 6 years ago
• boyland / sasylf
  Educational Proof Assistant for Type Theory
  ☆80Updated 2 weeks ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆24Updated last year
• dvanhorn / oaam
  Optimizing Abstract Abstract Machines
  ☆31Updated 8 years ago
• L-TChen / ModalTypeTheory
  ☆21Updated 4 years ago
• owo-lang / MLPolyR
  The MLPolyR programming language, revived
  ☆25Updated 5 years ago