ilya-klyuchnikov / lambdapiLinks
Dependently Typed Lambda Calculus in Haskell
☆115Updated 4 years ago
Alternatives and similar repositories for lambdapi
Users that are interested in lambdapi are comparing it to the libraries listed below
Sorting:
- Unification and type inference algorithms☆125Updated 10 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last week
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 5 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- SPLV20 course notes☆112Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- TParsec - Total Parser Combinators in Idris☆95Updated last year
- An implementation of Pie in Haskell☆205Updated 5 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆148Updated 3 years ago
- A lambda calculus to explore type-directed program synthesis.☆85Updated 5 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- The Disco Discus Compiler☆174Updated 6 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Tutorial for LiquidHaskell☆78Updated 10 months ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- Build system☆123Updated last year
- A compiler for functional programs on serialized data☆165Updated last month
- Strongly-typed System F in Haskell☆118Updated 2 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A workshop on learning Agda with minimal prerequisites.☆86Updated 9 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆73Updated 7 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Coq formalizations of functional languages.☆145Updated 5 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- A small implementation of higher-order unification☆189Updated 7 years ago
- A language based on homotopy type theory with an interval☆83Updated 10 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago