Kraks / MyPLZoo
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
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- The MLPolyR programming language, revived☆24Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Denotational semantics based on graph and filter models☆19Updated 4 months ago
- Some rudimentary proofs on subtyping☆11Updated 3 years ago
- ☆13Updated 2 weeks ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Constructive Galois connections☆32Updated 7 years ago
- HoTT group project to TeXify Cartmell's PhD thesis “Generalised Algebraic Theories and Contextual Categories”☆15Updated 2 years ago
- ModTT in Agda☆11Updated 3 years ago
- a version of the 2048 game for Coq☆22Updated last year
- ☆10Updated 6 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- A Gradual Dependently-typed Language☆14Updated 5 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 2 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- MLFS type system: raising ML to the power of system F in a Simplest way☆19Updated 4 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- A very little language☆16Updated last year
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 5 months ago
- Racket Equivalence Graph Library☆18Updated 2 years ago
- Dependently typed lambda calculus - A Simple Proof Assistant☆12Updated 4 years ago
- Experiments in formalizing refinement type systems in Coq☆17Updated 9 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 3 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Deadlock freedom by type checking☆20Updated last year
- being an implementation of the calculus of constructions☆15Updated 2 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆16Updated 2 months ago