racket / redex
☆92Updated this week
Alternatives and similar repositories for redex:
Users that are interested in redex are comparing it to the libraries listed below
- A less devious proof assistant☆222Updated last year
- ☆136Updated 2 years ago
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago
- Smackage Package Manager for Standard ML☆123Updated 2 years ago
- Repository and Wiki for enriching the Standard ML Basis Library☆61Updated 3 years ago
- Racket port of the nanopass-framework☆34Updated 3 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆145Updated 3 years ago
- Statically typed embedding of miniKanren relational programming language into OCaml☆117Updated this week
- higher order dependently typed logic programing☆170Updated 6 years ago
- an implementation of stuck macros☆136Updated 2 months ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 5 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 9 years ago
- staged relational interpreters: running with holes, faster☆126Updated 2 months ago
- The Mechanization of Standard ML☆72Updated 2 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆119Updated 2 years ago
- Standard ML compiler based on typed intermediate languages.☆47Updated 10 years ago
- An efficient implementation of the higher-order logic programming language Lambda Prolog☆151Updated 8 months ago
- The People's Refinement Logic☆228Updated 2 years ago
- A compiler for functional programs on serialized data☆158Updated last month
- A version of the 1997 SML definition with corrections and some proposed Successor ML features added.☆196Updated 5 months ago
- A fast implementation of miniKanren with disequality and absento, compatible with Racket and Chez.☆155Updated 5 months ago
- CLP(SMT) on top of miniKanren☆35Updated 2 years ago
- nanopass compiler framework for Racket☆184Updated 11 months ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆204Updated 2 years ago
- An implementation of Pie in Haskell☆204Updated 5 years ago
- Coq formalizations of functional languages.☆142Updated 4 years ago
- SML reference interpreter☆112Updated last year
- Racket bindings for Z3☆24Updated 5 years ago
- Dependently Typed Lambda Calculus in Haskell☆112Updated 3 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆72Updated 6 years ago