zerokarmaleft / tapl-haskellLinks
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
Sorting:
- Towards changing things and see if it proofs☆60Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- SPLV20 course notes☆111Updated 2 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆73Updated 7 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago
- The Penn Locally Nameless Metatheory Library☆74Updated 2 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆82Updated 4 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Benchmarks for capture-avoiding substitution☆114Updated 3 weeks ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- A library for formalizing Haskell types and functions in Coq☆170Updated last year
- Notes on higher-order typed compilation. Probably wrong☆23Updated 2 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 8 months ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- array, slices and text☆70Updated 11 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Total Parser Combinators in Agda☆129Updated 2 years ago
- A collection of Notes on GHC☆69Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Literature review of GHC's Core language, System FC☆67Updated 6 years ago
- Haskell library implementing "Data Types a la Carte"☆90Updated last year
- Examples for Haskell bindings to LLVM☆72Updated 4 years ago