System F in coq.
☆19Jan 27, 2015Updated 11 years ago
Alternatives and similar repositories for System-F-Coq
Users that are interested in System-F-Coq are comparing it to the libraries listed below
Sorting:
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- Expands type synonyms in Template Haskell ASTs☆11Jan 10, 2026Updated last month
- Regular expression matching in Idris☆11Apr 27, 2016Updated 9 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45May 14, 2016Updated 9 years ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- The Evolution of a Typechecker☆54Jan 20, 2019Updated 7 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Jun 11, 2016Updated 9 years ago
- Formalisation of Goedel's System T in Coq☆15Jul 1, 2011Updated 14 years ago
- ☆23Aug 30, 2017Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- Luck -- A Language for Property-Based Generators☆36Feb 28, 2025Updated last year
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Distributed Data Structures in Coq☆49Oct 7, 2013Updated 12 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- ☆99Sep 22, 2025Updated 5 months ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- Reflection library for Coq☆12Sep 26, 2019Updated 6 years ago
- Formal topology (and some probability) in Coq☆31Nov 30, 2018Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Dec 11, 2023Updated 2 years ago
- System F implemented in Haskell☆24Mar 15, 2012Updated 13 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- A tutorial on how to write OCaml tactics for the Coq proof assistant☆23Nov 23, 2016Updated 9 years ago
- Testing Infrastructure for Temporal AbstractioNs☆23Aug 24, 2020Updated 5 years ago
- Automatically exported from code.google.com/p/trellys☆47Jul 12, 2019Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆24May 1, 2016Updated 9 years ago
- ☆24Aug 30, 2018Updated 7 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- A library for formalizing Haskell types and functions in Coq☆171Oct 15, 2023Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆75May 10, 2019Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Jun 12, 2019Updated 6 years ago
- Experiments on the construction of functions☆29Nov 30, 2015Updated 10 years ago