jdolson / hott-notesLinks
15-819 (Homotopy Type Theory) Lecture Notes
☆15Updated 7 years ago
Alternatives and similar repositories for hott-notes
Users that are interested in hott-notes are comparing it to the libraries listed below
Sorting:
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated 2 weeks ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- being the scrapings of my stackoverflow answers☆48Updated 6 years ago
- Literature review of GHC's Core language, System FC☆67Updated 7 years ago
- Where my everyday research happens☆55Updated last week
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- An experimental intermediate language for GHC☆36Updated 8 years ago
- Fine-grained lattice primitives for Haskell☆37Updated 7 months ago
- Source material for "Functional Pearl: Getting a Quick Fix on Comonads"☆48Updated 7 years ago
- Sort any Traversable container☆42Updated 3 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆84Updated 2 weeks ago
- The Software Foundations book, in GHC☆82Updated 3 weeks ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated 3 months ago
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- rewrite rules for type-level equalities☆62Updated 5 months ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 7 years ago
- Generic random generators☆81Updated 2 years ago
- An experiment in functional interface design☆24Updated 9 years ago
- Haskell library for doing category theory with a central role for profunctors☆24Updated this week
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- Bidirectional programming in Haskell with monadic profunctors☆48Updated 3 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Implementing grep in Agda☆33Updated 5 years ago
- Interpreter for GHC Haskell☆22Updated 6 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆66Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago