jozefg / undergraduate-thesisLinks
A discouraging story.
☆16Updated 7 years ago
Alternatives and similar repositories for undergraduate-thesis
Users that are interested in undergraduate-thesis are comparing it to the libraries listed below
Sorting:
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆18Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Work in progress☆37Updated 2 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 8 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- ☆17Updated 6 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- ☆46Updated 6 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago