robrix / pathLinks
A lambda calculus to explore type-directed program synthesis.
☆85Updated 6 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 8 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Dependently Typed Lambda Calculus in Haskell☆116Updated 4 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- A fast open-union type, suitable for 100+ contained alternatives.☆100Updated last year
- ICFP tutorial☆39Updated 4 years ago
- Web based opetopic editor☆36Updated last year
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆37Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- Recursion schemes for Idris☆64Updated 7 years ago
- Hindley-Milner type inference using constraints☆50Updated 9 years ago
- An experimental Haskell library for programming with effectful runners.☆30Updated 6 years ago
- A language based on homotopy type theory with an interval☆84Updated 10 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 3 weeks ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- an applicative functor that seamlessly talks to HTML inputs☆72Updated 6 years ago
- The theory of groups☆81Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- ☆41Updated 8 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- compile your own functional language☆36Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- Agda-style equational reasoning in Haskell☆54Updated 2 weeks ago
- Efficient implementation of the implicit treap data structure☆63Updated 4 years ago
- Simplified Observational Type Theory☆87Updated 2 years ago