cohomolo-gy / homotopy-type-theory-notesLinks
HoTT Note-taking action
☆25Updated 6 years ago
Alternatives and similar repositories for homotopy-type-theory-notes
Users that are interested in homotopy-type-theory-notes are comparing it to the libraries listed below
Sorting:
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆99Updated 2 months ago
- Yet another … yet another recursion scheme library for Haskell☆89Updated this week
- A total recursion scheme library for Dhall☆66Updated 3 weeks ago
- A well-typed symmetric-monoidal category of concurrent processes☆25Updated 7 years ago
- Recursion schemes for Idris☆64Updated 7 years ago
- A recursion scheme library for Idris.☆25Updated last month
- Wailing into the primordial ooze of category theory☆55Updated last week
- Simple adjunctions☆45Updated last week
- Cofun with Cofree Comonads☆32Updated 9 years ago
- Haskell 98 Profunctors☆70Updated 7 months ago
- Bidirectional programming in Haskell with monadic profunctors☆48Updated 3 years ago
- Isomorphic Reasoning: Counting with Types☆38Updated 5 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆84Updated 4 years ago
- A Haskell translation of Idris's original algebraic effects library☆41Updated 9 years ago
- A small bifunctor library for idris☆21Updated 5 years ago
- A small profunctor library for idris☆17Updated 3 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago
- every day i'm truffling☆70Updated 4 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- Haskell 98 contravariant functors☆73Updated last week
- An Idris type provider for communicating type-checkable protocols.☆26Updated 8 years ago
- Comparing Haskell effect systems for ergonomics and speed☆66Updated 4 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Refined types☆57Updated 7 years ago
- State machines in Idris☆37Updated 9 years ago
- Standard containers, with keys that carry type-level proofs of their own presence.☆81Updated 5 years ago
- A fast open-union type, suitable for 100+ contained alternatives.☆100Updated last year
- Generalized folds, unfolds, and traversals for fixed point data structures☆58Updated 3 years ago
- freer monads and cofreer comonads.☆23Updated 7 years ago
- Dual Traversable☆41Updated last week