jozefg / undergraduate-thesis
A discouraging story.
☆15Updated 6 years ago
Alternatives and similar repositories for undergraduate-thesis:
Users that are interested in undergraduate-thesis are comparing it to the libraries listed below
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆11Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 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
- Type Theory with Indexed Equality☆23Updated 7 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Mtac in Agda☆28Updated 3 years ago
- ☆18Updated 2 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆16Updated 10 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago