pnwamk / stop2015-redexView external linksLinks
PLT Redex model of basic Dependently Typed Racket calculus
☆18Mar 31, 2015Updated 10 years ago
Alternatives and similar repositories for stop2015-redex
Users that are interested in stop2015-redex are comparing it to the libraries listed below
Sorting:
- A Racket library for interacting with Idris over the IDE protocol☆31Nov 10, 2017Updated 8 years ago
- ☆16Feb 18, 2025Updated 11 months ago
- Simple FRP implementation for Haskell. See blog post at http://travis.athougies.net/☆14May 5, 2015Updated 10 years ago
- (Somewhat) Algebraic Data Types for Racket☆34Jan 15, 2023Updated 3 years ago
- Racket bindings for Z3☆24May 11, 2019Updated 6 years ago
- Bindings to Haskell's IO monad which respect Agda's semantics☆24Nov 14, 2018Updated 7 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Martin-Löf Extensible Specification and Simulator☆29Jul 1, 2015Updated 10 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Feb 23, 2018Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- A zipper library for Racket☆20May 1, 2016Updated 9 years ago
- Idris Lib to interact with the DOM and Browser API for the JavaScript backend☆40Jan 15, 2018Updated 8 years ago
- Idris tactics for (commutative) monoids☆20May 24, 2020Updated 5 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
- an implementation of gradual typing in mit-scheme☆10Apr 11, 2021Updated 4 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- Expands type synonyms in Template Haskell ASTs☆11Jan 10, 2026Updated last month
- Derive editors for data types.☆28Oct 5, 2014Updated 11 years ago
- AVL Trees for Racket☆12Jan 7, 2018Updated 8 years ago
- Lifting Reduction Semantics through Syntactic Sugar☆13May 13, 2018Updated 7 years ago
- ☆12May 9, 2015Updated 10 years ago
- Fast Setup for Proof by Reflection, in Two Lines of Ltac.☆14Jan 12, 2021Updated 5 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- ☆29Sep 14, 2015Updated 10 years ago
- TODO☆23Oct 10, 2015Updated 10 years ago
- A Redex tutorial with a focus on how to do work in Redex☆11Oct 21, 2024Updated last year
- ☆12Jun 13, 2023Updated 2 years ago
- A Haskell library for compile-time checked literal values, via QuasiQuoters.☆13Sep 20, 2021Updated 4 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- k theorem prover☆11Aug 16, 2022Updated 3 years ago
- A simple development of linear logic in Coq.☆13Mar 22, 2025Updated 10 months ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Combinatorial species in HoTT☆12May 23, 2015Updated 10 years ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- Typed DSLs for sorting☆20Feb 16, 2018Updated 7 years ago