mcimini / Gradualizer
Supporting tool for Gradual Typing
☆16Updated 5 years ago
Alternatives and similar repositories for Gradualizer
Users that are interested in Gradualizer are comparing it to the libraries listed below
Sorting:
- Miller/pattern unification in Agda☆65Updated 11 years ago
- ☆29Updated 9 years ago
- The Prettiest Printer☆34Updated last year
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated last month
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Luck -- A Language for Property-Based Generators☆34Updated 2 months ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- IO using sized types and copatterns☆34Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- The Alms Programming Language☆44Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- Constructive Galois connections☆32Updated 7 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A mechanized proof of type safety for Featherweight Java using Coq☆16Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- being the beginnings of at least zero typecheckers☆33Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Formalising Type Theory in a modular way for translations between type theories☆94Updated 7 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago