robrix / pathLinks
A lambda calculus to explore type-directed program synthesis.
☆85Updated 5 years ago
Alternatives and similar repositories for path
Users that are interested in path are comparing it to the libraries listed below
Sorting:
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- A language based on homotopy type theory with an interval☆83Updated 10 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- Web based opetopic editor☆35Updated 9 months ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- ICFP tutorial☆39Updated 4 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last week
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Recursion schemes for Idris☆65Updated 6 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- A fast open-union type, suitable for 100+ contained alternatives.☆99Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- Library of the ##dependent distributed research support group☆115Updated last year
- The theory of algebraic graphs formalised in Agda☆90Updated 7 years ago
- Drafts, notes and resources for adding linear typing to GHC.☆78Updated 5 years ago
- TParsec - Total Parser Combinators in Idris☆95Updated last year
- Simplified Observational Type Theory☆83Updated 2 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago