pigworker / CS410-13
being the notes and materials for CS410 in the 2013/14 academic session
☆28Updated 10 years ago
Alternatives and similar repositories for CS410-13:
Users that are interested in CS410-13 are comparing it to the libraries listed below
- Base library for HoTT in Agda☆37Updated 6 years ago
- ☆17Updated 2 years ago
- Typed DSLs for sorting☆19Updated 7 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
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- ☆31Updated 10 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- "Programs that explain their effects" talk material☆17Updated 6 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- some "modernized" brouwerian mathematics, inspired by Hancock, Ghani & Pattinson☆8Updated 9 years ago
- Embedding a Full Linear Lambda Calculus in Haskell☆8Updated 9 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- Agda-style equational reasoning in Haskell☆53Updated last week
- An attempt to formalize unix cat in fiat☆12Updated 7 years ago
- Relative Monad Library for Agda☆24Updated 5 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 7 years ago
- Experiments with effect systems☆12Updated 8 years ago
- More strongly typed variant of the ixset Haskell package☆24Updated 8 months ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- A package exposing a function for generating catamorphisms.☆28Updated 7 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- ☆23Updated 7 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 7 years ago