A typechecker for WebAssembly, written in Agda (WIP)
☆17Feb 23, 2018Updated 8 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:
- A simple way to query constructors, like cases but slightly more concise☆11Mar 7, 2018Updated 8 years ago
- My final year project at the University of Strathclyde☆14Jan 26, 2023Updated 3 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- Expands type synonyms in Template Haskell ASTs☆11Jan 10, 2026Updated last month
- Haskell to D3.js binding by deep EDSL approach.☆23Sep 20, 2014Updated 11 years ago
- Derive editors for data types.☆28Oct 5, 2014Updated 11 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- Verified left pad☆19Apr 14, 2018Updated 7 years ago
- Source Layouting Engine☆11Mar 7, 2021Updated 5 years ago
- GHCJS FFI bindings to the Electron API (WIP).☆10May 21, 2017Updated 8 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Oct 26, 2023Updated 2 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Dec 14, 2016Updated 9 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated last month
- Dynamically-typed Haskell expressions involving applications and variables.☆22Jan 30, 2025Updated last year
- The Elements of Statistical Learning in Haskell☆13Nov 29, 2017Updated 8 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Minimal Haskell Compiler☆63Mar 26, 2018Updated 7 years ago
- Parser and type analysis for the Go programming language☆12Aug 3, 2023Updated 2 years ago
- Library of Coq proof automation☆16Feb 15, 2022Updated 4 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- An efficient finite map from (byte)strings to values.☆20May 1, 2025Updated 10 months ago
- A tool for formally verifying Haskell code in Agda☆28Oct 25, 2016Updated 9 years ago
- A language-generic implementation of equality saturation in Haskell☆22Dec 4, 2018Updated 7 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Mar 31, 2015Updated 10 years ago
- IO for Gallina☆34Dec 17, 2025Updated 2 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- convert simple cryptol expressions into finite-state machines☆22Sep 15, 2017Updated 8 years ago
- wherein I implement several substructural logics in Agda☆24Oct 8, 2018Updated 7 years ago
- Decision procedures for Presburger arithmetic in Haskell☆30Mar 29, 2025Updated 11 months ago
- Cryptographic Constructions in the Type Theory of Agda☆52Aug 8, 2015Updated 10 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Apr 4, 2022Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Apr 18, 2018Updated 7 years ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Oct 28, 2019Updated 6 years ago
- Haskell library for glob matching☆25Jan 15, 2022Updated 4 years ago