markokoleznik / agda-writer
A simple GUI for Agda
☆31Updated 8 years ago
Related projects ⓘ
Alternatives and complementary repositories for agda-writer
- ☆45Updated 5 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- Agda formalisation of second-order abstract syntax☆52Updated 2 years ago
- Where my everyday research happens☆53Updated last week
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- ☆82Updated 7 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- Categorical logic from a categorical point of view☆76Updated last year
- Agda programming with holes☆26Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- being the materials for Summer 2013's course☆110Updated last year
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 5 years ago
- An approach to higher algebra in type theory☆23Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- This is the place where (more or less) stable releases of my RW library will be published.☆16Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- The theory of algebraic graphs formalised in Agda☆87Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆45Updated 3 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated 10 months ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated last month
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 6 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 3 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago