racket / redexLinks
☆95Updated 2 weeks ago
Alternatives and similar repositories for redex
Users that are interested in redex are comparing it to the libraries listed below
Sorting:
- A less devious proof assistant☆224Updated 2 years ago
- ☆137Updated 3 years ago
- A fast implementation of miniKanren with disequality and absento, compatible with Racket and Chez.☆158Updated 4 months ago
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago
- Repository and Wiki for enriching the Standard ML Basis Library☆62Updated 3 years ago
- nanopass compiler framework for Racket☆190Updated last year
- The Mechanization of Standard ML☆73Updated 2 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆147Updated 3 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- A version of the 1997 SML definition with corrections and some proposed Successor ML features added.☆200Updated 10 months ago
- An efficient implementation of the higher-order logic programming language Lambda Prolog☆155Updated last year
- Racket port of the nanopass-framework☆34Updated 4 years ago
- multi-stage relational programming for staged relational interpreters: running with holes, faster☆132Updated last week
- Smackage Package Manager for Standard ML☆122Updated 3 years ago
- The People's Refinement Logic☆229Updated 2 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆121Updated 3 years ago
- Charity language interpreters and literature☆114Updated 6 years ago
- SML reference interpreter☆116Updated 2 years ago
- Statically typed embedding of miniKanren relational programming language into OCaml☆118Updated this week
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆111Updated 6 years ago
- A proof assistant for general type theories☆304Updated 8 months ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- higher order dependently typed logic programing☆173Updated 6 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆73Updated 7 years ago
- CLP(SMT) on top of miniKanren☆38Updated 3 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 5 years ago
- Emacs support for F*☆70Updated 2 months ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆210Updated 3 years ago