zerokarmaleft / tapl-haskell
Types and Programming Languages
☆38Updated 10 years ago
Alternatives and similar repositories for tapl-haskell:
Users that are interested in tapl-haskell are comparing it to the libraries listed below
- Unification and type inference algorithms☆125Updated 10 years ago
- Organization and planning for the Initial Types Club☆72Updated 2 years ago
- Towards changing things and see if it proofs☆59Updated 3 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- Strongly-typed System F in Haskell☆116Updated 2 years ago
- SPLV20 course notes☆108Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆31Updated 6 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆113Updated last week
- Literature review of GHC's Core language, System FC☆67Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- Text and Haskell source for my blog series on recursion schemes.☆45Updated 2 years ago
- Haskell library implementing "Data Types a la Carte"☆91Updated last year
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- array, slices and text☆70Updated 10 months ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆72Updated 7 years ago
- A collection of Notes on GHC☆69Updated 6 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 6 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 5 years ago
- A library for formalizing Haskell types and functions in Coq☆170Updated last year
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- The Penn Locally Nameless Metatheory Library☆74Updated last month
- An interactive theorem prover based on lambda-tree syntax☆95Updated 3 months ago
- ☆84Updated 7 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago