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 experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Simplified Observational Type Theory☆82Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- Web based opetopic editor☆35Updated 7 months ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- HoTT Note-taking action☆25Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- The Software Foundations book, in GHC☆82Updated 5 months ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- ICFP 2019 preprints/papers☆44Updated 5 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Recursion schemes for Idris☆64Updated 6 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- ICFP tutorial☆39Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- A fast open-union type, suitable for 100+ contained alternatives.☆99Updated last year
- Drafts, notes and resources for adding linear typing to GHC.☆78Updated 5 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago