pnwamk / stop2015-redexLinks
PLT Redex model of basic Dependently Typed Racket calculus
☆18Updated 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☆31Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- (Somewhat) Algebraic Data Types for Racket☆34Updated 2 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Miller/pattern unification in Agda☆65Updated 11 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- Bindings to Haskell's IO monad which respect Agda's semantics☆24Updated 6 years ago
- higher order dependently typed logic programing☆174Updated 7 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 5 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 6 years ago
- Haskell version of the code from "Handbook of Practical Logic and Automated Reasoning"☆16Updated last year
- The Prettiest Printer☆35Updated last year
- An implementation of miniKanren in Haskell☆78Updated 12 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- An idris backend compiling to chez scheme☆47Updated 7 years ago
- The proof of undecidability of halting problem, using the model -- WHILE language.☆21Updated 5 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- ☆86Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 7 years ago