z-murray / honours-project-constructive-analysis-in-agdaLinks
My honours project (with thesis), submitted in completion of the BSc Combined Honours in Mathematics & Computer Science at Dalhousie University in April 2022.
☆23Updated 2 years ago
Alternatives and similar repositories for honours-project-constructive-analysis-in-agda
Users that are interested in honours-project-constructive-analysis-in-agda are comparing it to the libraries listed below
Sorting:
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
 - Organization and planning for the Initial Types Club☆74Updated 3 years ago
 - This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
 - A formalized proof of a version of the initiality conjecture☆43Updated 5 years ago
 - Total Parser Combinators in Agda☆132Updated 2 months ago
 - Library of the ##dependent distributed research support group☆117Updated last year
 - A tutorial on how Agda infers things☆63Updated 3 months ago
 - Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
 - Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
 - Benchmarks for capture-avoiding substitution☆120Updated 5 months ago
 - Agda bindings to SMT-LIB2 compatible solvers.☆102Updated 2 months ago
 - A work-in-progress core language for Agda, in Agda☆58Updated 3 weeks ago
 - ☆45Updated 6 years ago
 - Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
 - Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆47Updated last year
 - SPLV20 course notes☆113Updated 2 years ago
 - Categorical logic from a categorical point of view☆81Updated 2 years ago
 - Programming library for Agda☆133Updated last year
 - Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆54Updated 3 years ago
 - Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
 - Strongly-typed System F in Haskell☆119Updated 3 years ago
 - ☆24Updated 2 months ago
 - A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
 - What I wish I knew when learning HoTT☆53Updated 6 years ago
 - A library for doing generic programming in Agda☆34Updated 4 years ago
 - This is the place where (more or less) stable releases of my RW library will be published.☆16Updated 5 years ago
 - antifunext☆34Updated last year
 - Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆67Updated last week
 - Formalizing nbe in agda☆32Updated 12 years ago
 - Agda programming with holes☆28Updated 4 years ago