VictorTaelin / calculus-of-constructions
Minimal, fast, robust implementation of the Calculus of Constructions on JavaScript.
☆106Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for calculus-of-constructions
- A minimal proof language.☆203Updated 5 years ago
- higher order dependently typed logic programing☆170Updated 6 years ago
- Charity language interpreters and literature☆114Updated 5 years ago
- A small implementation of higher-order unification☆182Updated 7 years ago
- The Makam Metalanguage☆194Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated last year
- A comparison of how computational effects and handlers are implemented in various programming languages.☆132Updated 5 years ago
- Dependent JavaScript: A Typed Dialect☆87Updated 11 years ago
- A pure type system implemented in OCaml☆77Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated last year
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆129Updated 4 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆77Updated 2 years ago
- An implementation of Pie in Haskell☆204Updated 5 years ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆142Updated 3 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆204Updated 2 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- ECMAScript back end for Functional Reactive Programming in Agda☆103Updated 7 years ago
- Hindley-Milner type inference using constraints☆50Updated 7 years ago
- TiML: A Functional Programming Language with Time Complexity☆75Updated 7 years ago
- An implementation of the Formality language in JavaScript☆72Updated 5 years ago
- The Art of the Propagator. See also:☆170Updated 7 months ago
- Absal ex☆55Updated last year
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 5 months ago
- A simple Depdently-Typed Language for Research and Learning☆58Updated 8 years ago
- Dependent type checker using normalisation by evaluation☆254Updated 2 months ago
- A workshop on learning Agda with minimal prerequisites.☆84Updated 8 years ago