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☆24Updated 4 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- A Gradual Dependently-typed Language☆14Updated 5 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago
- ModTT in Agda☆11Updated 3 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- An implementation of scoped algebraic effects and handlers in Agda.☆12Updated 4 years ago
- Some rudimentary proofs on subtyping☆11Updated 3 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- Optimizing Abstract Abstract Machines☆31Updated 8 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- Racket bindings for Z3☆24Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆31Updated 12 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
- Graded Dependent Type systems☆24Updated last year
- Dafny for Metatheory of Programming Languages☆25Updated last month
- Denotational semantics based on graph and filter models☆23Updated 6 months ago
- The MLPolyR programming language, revived☆25Updated 4 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆44Updated 2 months ago
- A very little language☆16Updated last year
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- MLFS type system: raising ML to the power of system F in a Simplest way☆19Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year