awalterschulze / the-little-typer-exercisesLinks
exercises for the book - the little typer
☆21Updated 7 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☆121Updated 6 months ago
- Strongly-typed System F in Haskell☆120Updated 3 years ago
- Language Server for Agda☆121Updated last month
- Unification and type inference algorithms☆125Updated 10 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Basics of the dependently-typed functional language Agda ^_^☆40Updated 3 years ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆84Updated 4 months ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 4 months ago
- bollu learns implementation of dependent typing☆34Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆113Updated 5 months ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- Total Parser Combinators in Agda☆132Updated 4 months ago
- SPJ's tutorial on implementing functional languages☆29Updated 6 years ago
- A work-in-progress core language for Agda, in Agda☆61Updated this week
- Agda lecture notes for the Functional Programming course at TU Delft☆132Updated 5 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- A tutorial on how Agda infers things☆63Updated 5 months ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Efficient Haskell effect handlers based on evidence translation.☆85Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- an implementation of stuck macros☆149Updated this week
- A small implementation of higher-order unification☆192Updated 8 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 4 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- being the materials for Summer 2013's course☆113Updated 2 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆63Updated 5 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- SPLV20 course notes☆114Updated 3 years ago
- being an operating system for typechecking processes☆130Updated 2 months ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last week