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:
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- ☆17Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- ☆18Updated 3 years ago
- Quasi-quoting library for agda☆18Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Session types in Idris2!☆27Updated 5 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Experiments with sequent calculi☆28Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- Specification of Agda.☆25Updated 6 years ago