Kraks / MyPLZooLinks
Implementations of various toy programming languages
☆12Updated 7 years ago
Alternatives and similar repositories for MyPLZoo
Users that are interested in MyPLZoo are comparing it to the libraries listed below
Sorting:
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A formalization of properties of a simple imperative, memory-safe language.☆20Updated 4 years ago
- Two-Level Type Theory☆28Updated 6 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 3 years ago
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- Racket Equivalence Graph Library☆19Updated 3 years ago
- Arete is an experimental programming language.☆12Updated 2 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 10 months ago
- PL syntax macros.☆21Updated 3 weeks ago
- Formalization of CBPV extended with effect and coeffect tracking☆14Updated last year
- Denotational semantics based on graph and filter models☆23Updated last year
- Optimizing Abstract Abstract Machines☆31Updated 8 years ago
- Benchmark repository of polyglot effect handler examples☆32Updated 4 months ago
- Graded Dependent Type systems☆25Updated 2 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.☆23Updated 9 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- Lifting Reduction Semantics through Syntactic Sugar☆13Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- Faceted execution in Racket☆12Updated 7 years ago
- A very little language☆16Updated 2 years ago
- Constructive Galois connections☆36Updated 7 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- Generation of abstract binding trees☆27Updated 2 months ago
- ☆16Updated 3 years ago
- 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
- ☆21Updated 9 years ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago