zilberstein / system-fc-coqLinks
☆12Updated 10 years ago
Alternatives and similar repositories for system-fc-coq
Users that are interested in system-fc-coq are comparing it to the libraries listed below
Sorting:
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- ☆17Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 weeks ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- Experiments with sequent calculi☆28Updated 4 years ago
- Mtac in Agda☆29Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Base library for HoTT in Agda☆38Updated 6 years ago
- Quasi-quoting library for agda☆18Updated last year
- Experimental normalisation via scheme☆12Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- Compiler backend for generating Scheme code☆28Updated 2 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- ☆18Updated 3 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago