umazalakain / fypLinks
My final year project at the University of Strathclyde
☆13Updated 2 years ago
Alternatives and similar repositories for fyp
Users that are interested in fyp are comparing it to the libraries listed below
Sorting:
- ☆18Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 4 months ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- ☆17Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Mtac in Agda☆28Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 7 months ago
- ☆16Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Deferring the Details and Deriving Programs☆14Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆22Updated last year