Gradual-Typing / GriftLinks
A compiler for the gradually typed lambda calculus
☆75Updated 3 years ago
Alternatives and similar repositories for Grift
Users that are interested in Grift are comparing it to the libraries listed below
Sorting:
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆101Updated last month
- Formalizations of Gradually Typed Languages in Agda☆57Updated 4 months ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 5 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆127Updated last year
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- Repository and Wiki for enriching the Standard ML Basis Library☆62Updated 3 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆82Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Coq formalizations of functional languages.☆144Updated 4 years ago
- Abstracting Definitional Interpreters☆68Updated 7 years ago
- ☆95Updated 3 weeks ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 8 years ago
- ☆84Updated last year
- MetaML and MetaOCaml bibliography☆92Updated 6 months ago
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- an implementation of stuck macros☆142Updated this week
- higher order dependently typed logic programing☆173Updated 6 years ago
- A modular sat/smt solver with proof output.☆99Updated last year
- A library for effects in Coq.☆65Updated 3 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆147Updated 3 years ago
- Statically typed embedding of miniKanren relational programming language into OCaml☆118Updated last week
- The Mechanization of Standard ML☆73Updated 2 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆121Updated 3 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 4 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year