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:
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- 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 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A usable type system for call by push-value☆33Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- ☆21Updated 7 years ago
- Universal Register Machine implemented at the type-level of Haskell☆23Updated 9 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Funny little Haskell impl☆18Updated 5 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- An efficient finite map from (byte)strings to values.☆20Updated 7 months ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- Dependently typed elimination functions using singletons☆28Updated 11 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- ICFP tutorial☆39Updated 4 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- ☆16Updated 10 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago