pigworker / CS410-14Links
being the materials for CS410 Advanced Functional Programming in the 2014-15 session
☆71Updated 10 years ago
Alternatives and similar repositories for CS410-14
Users that are interested in CS410-14 are comparing it to the libraries listed below
Sorting:
- Slides and exercises for the Idris course taught at Galois☆50Updated 9 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago
- Mindless, verified (erasably) coding using dependent types☆105Updated 9 years ago
- Recursion schemes for Idris☆65Updated 6 years ago
- 2048 in Idris☆123Updated 7 years ago
- Clojure-style transients for Haskell☆33Updated 3 years ago
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆100Updated 2 years ago
- Dive into GHC☆82Updated 8 years ago
- Various data structures for use in the Idris Language.☆95Updated 5 years ago
- Companion code for "Why Dependent Types Matter" paper.☆60Updated 7 years ago
- An implementation of Functional Reactive Programming☆40Updated 10 years ago
- Static blog generator in Idris.☆40Updated 10 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 ICFP'16 and co-located events☆139Updated 8 years ago
- ☆98Updated 7 years ago
- Type provider library for Idris☆94Updated 7 years ago
- Categories parametrized by morphism equality, in Agda☆151Updated 5 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- haskell lazy evaluation illustrated☆72Updated 8 years ago
- Accepted papers for ICFP 2015☆45Updated 9 years ago
- A hip inductive theorem prover!☆89Updated 3 years ago
- Provably correct implementation of insertion sort in Idris.☆31Updated 4 years ago
- A simple UI for evaluating expressions in the untyped lambda calculus☆56Updated 2 years ago
- ☆23Updated 10 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
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A monad for interfacing with external SAT solvers☆64Updated last month
- Measure time complexity empirically.☆48Updated 9 years ago
- Learn you an Agda (and achieve enlightenment)☆316Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 6 years ago