technicalguy / acs-category-theory-notes-2017Links
Cambridge ACS Category Theory, Type Theory, and Logic - lecture notes 2017.
☆14Updated 7 years ago
Alternatives and similar repositories for acs-category-theory-notes-2017
Users that are interested in acs-category-theory-notes-2017 are comparing it to the libraries listed below
Sorting:
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- F-omega with interval kinds mechanized in Agda☆13Updated last year
- ☆16Updated 3 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- A simple GUI for Agda☆31Updated 9 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 weeks ago
- Dependently Typed Metaprogramming Exercises☆23Updated 7 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆19Updated 11 months ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Deferring the Details and Deriving Programs☆14Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago