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:
- Experiments with effect systems☆12Updated 9 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated last year
- ☆23Updated 2 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Zippers for cofree types☆13Updated 4 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆14Updated 5 years ago
- Extra type-level operations on GHC.TypeLits.Nat and a custom solver☆18Updated last month
- Funny little Haskell impl☆18Updated 5 years ago
- Bring fusion to everyone☆14Updated 5 years ago
- A usable type system for call by push-value☆33Updated 6 years ago
- Session types in Idris2!☆27Updated 5 years ago
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆21Updated 2 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- A template for idris projects☆11Updated 4 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- Formal specification of the Haskell Language Report☆29Updated this week
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Type Theory with Indexed Equality☆26Updated 8 years ago