benediktahrens / monads
Coq code accompanying several articles on semantics of functional programming languages
☆10Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for monads
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A Specification for Dependent Types in Haskell (Core)☆65Updated 2 years ago
- Where my everyday research happens☆53Updated 2 months ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆69Updated 2 years ago
- System F in coq.☆19Updated 9 years ago
- A blog about Coq☆47Updated 2 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 7 years ago
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆78Updated 4 years ago
- being the beginnings of at least zero typecheckers☆31Updated 7 years ago
- ☆82Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- A Racket library for interacting with Idris over the IDE protocol☆30Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 weeks ago
- being the materials for Summer 2013's course☆110Updated last year
- Algebraic Combinatorics in Coq☆36Updated last month
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆15Updated last month
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 11 months ago
- An abstract machine using indexed containers and their zippers☆14Updated 7 years ago
- Implementing grep in Agda☆32Updated 3 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- ☆18Updated 2 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year