benediktahrens / monadsLinks
Coq code accompanying several articles on semantics of functional programming languages
☆11Updated 6 years ago
Alternatives and similar repositories for monads
Users that are interested in monads are comparing it to the libraries listed below
Sorting:
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Where my everyday research happens☆54Updated last month
- being the materials for Summer 2013's course☆112Updated 2 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- xmonad in Coq☆46Updated 13 years ago
- Summer school on programming in Agda☆68Updated 2 years ago
- System F in coq.☆19Updated 10 years ago
- ☆84Updated 7 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A formalization of category theory in cubical Agda☆60Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆45Updated 3 weeks ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- ☆31Updated 7 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 7 years ago