VictorTaelin / calculus-of-constructionsLinks
Minimal, fast, robust implementation of the Calculus of Constructions on JavaScript.
☆113Updated 8 years ago
Alternatives and similar repositories for calculus-of-constructions
Users that are interested in calculus-of-constructions are comparing it to the libraries listed below
Sorting:
- A minimal proof language.☆206Updated 6 years ago
- Charity language interpreters and literature☆114Updated 6 years ago
- higher order dependently typed logic programing☆173Updated 6 years ago
- ECMAScript back end for Functional Reactive Programming in Agda☆104Updated 7 years ago
- Prototype type inference engine☆202Updated 4 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 8 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- TiML: A Functional Programming Language with Time Complexity☆80Updated 7 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆141Updated 6 years ago
- Macro Lambda Calculus☆49Updated 6 years ago
- A small implementation of higher-order unification☆188Updated 7 years ago
- Dependent JavaScript: A Typed Dialect☆87Updated 12 years ago
- Absal ex☆57Updated last year
- Simplified Observational Type Theory☆83Updated 2 years ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆210Updated 3 years ago
- Real number computation software☆125Updated 2 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- The Makam Metalanguage☆198Updated 2 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆81Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- A workshop on learning Agda with minimal prerequisites.☆85Updated 9 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Implementation of the λΠ-calculus modulo rewriting☆209Updated last month
- TParsec - Total Parser Combinators in Idris☆95Updated last year
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago