chris-taylor / LondonHUGLinks
Presentation/code from my talk at London HUG
☆57Updated 12 years ago
Alternatives and similar repositories for LondonHUG
Users that are interested in LondonHUG are comparing it to the libraries listed below
Sorting:
- being the materials for CS410 Advanced Functional Programming in the 2014-15 session☆71Updated 10 years ago
- Dive into GHC☆82Updated 8 years ago
- Slides and exercises for the Idris course taught at Galois☆50Updated 9 years ago
- Link to preprints for ICFP'16 and co-located events☆139Updated 8 years ago
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆100Updated 2 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago
- Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)☆162Updated 4 years ago
- Link to preprints for ICFP'17 and colocated events☆136Updated 7 years ago
- HoTT Note-taking action☆25Updated 6 years ago
- Recursion schemes for Idris☆64Updated 7 years ago
- A Idris Mode for Atom.io☆101Updated last year
- Introduction to algebraic effects and handlers☆96Updated 7 years ago
- A monad for interfacing with external SAT solvers☆64Updated 2 months ago
- Convert lambda expressions to CCC combinators☆149Updated 9 years ago
- Accepted papers for ICFP 2015☆45Updated 9 years ago
- A talk on parametricity☆36Updated 2 years ago
- 2048 in Idris☆123Updated 7 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- A simple UI for evaluating expressions in the untyped lambda calculus☆56Updated 2 years ago
- The 2019/2020 edition of Strathclyde's CS316 Functional Programming course☆41Updated 5 years ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 5 years ago
- Haskell library for simple, concise and fast generic operations.☆81Updated last year
- Learn you an Agda (and achieve enlightenment)☆317Updated 7 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- Link to preprints for POPL'17 and co-located events☆100Updated 8 years ago
- playground for working with succinct data structures☆97Updated 9 years ago
- Tutorial for LiquidHaskell☆79Updated 10 months ago
- Networks of composable stream transducers☆338Updated 5 months ago
- ☆92Updated 9 years ago
- TODO☆23Updated 9 years ago