Gradual-Typing / GriftLinks
A compiler for the gradually typed lambda calculus
☆76Updated 4 years ago
Alternatives and similar repositories for Grift
Users that are interested in Grift are comparing it to the libraries listed below
Sorting:
- Mirror of Epigram 2, by Conor McBride, et al.☆58Updated 5 years ago
- Standard ML compiler based on typed intermediate languages.☆51Updated 11 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆74Updated 7 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 8 months ago
- Abstracting Definitional Interpreters☆74Updated 8 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆123Updated 3 years ago
- Examples from the class CMSC 330 during Summer 2015☆49Updated 10 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last week
- FunTAL: mixing a functional language with assembly.☆41Updated 8 years ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 9 years ago
- MetaML and MetaOCaml bibliography☆98Updated last year
- Formalizations of Gradually Typed Languages in Agda☆59Updated last month
- System Fω interpreter for use in Advanced Functional Programming course☆68Updated 2 years ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆90Updated 7 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- higher order dependently typed logic programing☆173Updated 7 years ago
- ☆100Updated last week
- The Mechanization of Standard ML☆74Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- TiML: A Functional Programming Language with Time Complexity☆80Updated 8 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- source code for the bondi programming language☆44Updated 6 years ago
- Constructive Galois connections☆36Updated 7 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆47Updated 6 months ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A ML-like pure functional language that can be used as a template for creating your own language☆31Updated last year