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
- Funny little Haskell impl☆18Updated 4 years ago
- 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 9 months ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆14Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆21Updated 2 years ago
- Formal specification of the Haskell Language Report☆25Updated last week
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 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
- Session types in Idris2!☆27Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years 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
- classical sequent calculus, embedded in Haskell☆21Updated last month
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- A formalization of System Fω in Agda☆19Updated 7 months ago
- Existential type.☆37Updated 9 months ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Experimental normalisation via scheme☆12Updated 4 years ago
- Bring fusion to everyone☆14Updated 5 years ago
- ☆23Updated last year
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year