michaelpj / abstract-machine-debuggersLinks
☆12Updated 6 years ago
Alternatives and similar repositories for abstract-machine-debuggers
Users that are interested in abstract-machine-debuggers are comparing it to the libraries listed below
Sorting:
- Zippers for cofree types☆13Updated 3 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Funny little Haskell impl☆18Updated 5 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Experiments with effect systems☆12Updated 9 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆14Updated 4 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- A usable type system for call by push-value☆33Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Formal specification of the Haskell Language Report☆28Updated 2 weeks ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Dependently typed elimination functions using singletons☆28Updated 10 months ago
- Compiler backend for generating Scheme code☆27Updated last year
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆16Updated 3 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 11 months ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago