jozefg / undergraduate-thesis
A discouraging story.
☆15Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for undergraduate-thesis
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- IO using sized types and copatterns☆33Updated 3 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 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
- Domain theory and denotational semantics in Coq☆10Updated 9 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆18Updated 6 years ago
- Relative Monad Library for Agda☆24Updated 5 years ago
- being the beginnings of at least zero typecheckers☆31Updated 7 years ago
- Type Theory with Indexed Equality☆23Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- ☆11Updated 4 years ago
- System F in coq.☆19Updated 9 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- being the emperor of Mongo, but also a verb☆15Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 8 years ago