awalterschulze / the-little-typer-exercisesLinks
exercises for the book - the little typer
☆21Updated 5 months ago
Alternatives and similar repositories for the-little-typer-exercises
Users that are interested in the-little-typer-exercises are comparing it to the libraries listed below
Sorting:
- Benchmarks for capture-avoiding substitution☆120Updated 5 months ago
- Strongly-typed System F in Haskell☆119Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆83Updated 2 months ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 3 months ago
- SPJ's tutorial on implementing functional languages☆29Updated 6 years ago
- An implementation of Pie in Haskell☆211Updated 5 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆61Updated 3 months ago
- Language Server for Agda☆116Updated 3 weeks ago
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated 2 months ago
- A small implementation of higher-order unification☆191Updated 8 years ago
- Basics of the dependently-typed functional language Agda ^_^☆40Updated 3 years ago
- bollu learns implementation of dependent typing☆32Updated 2 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- A tutorial on how Agda infers things☆63Updated 3 months ago
- Resources for "The Little Typer" study group☆48Updated 5 years ago
- 🚧 a work in progress effect system for Haskell 🚧☆133Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆85Updated 5 years ago
- SPLV20 course notes☆113Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- The Software Foundations book, in GHC☆82Updated 10 months ago
- being an operating system for typechecking processes☆130Updated 3 weeks ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- an implementation of stuck macros☆146Updated last month
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Total Parser Combinators in Agda☆132Updated 2 months ago
- A continuation-based backtracking logic programming monad☆92Updated 11 months ago