taktoa / wasm-agdaLinks
A typechecker for WebAssembly, written in Agda (WIP)
☆17Updated 7 years ago
Alternatives and similar repositories for wasm-agda
Users that are interested in wasm-agda are comparing it to the libraries listed below
Sorting:
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- being an experiment with potato power☆23Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 2 weeks ago
- An efficient finite map from (byte)strings to values.☆20Updated 8 months ago
- Universal Register Machine implemented at the type-level of Haskell☆23Updated 9 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- ☆16Updated 4 years ago
- A usable type system for call by push-value☆33Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A language-generic implementation of equality saturation in Haskell☆22Updated 7 years ago
- ☆16Updated 11 months ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Map lazy functional language constructs to LLVM IR☆52Updated 6 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- ☆23Updated 2 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago