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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 9 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 10 years ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Effectful bindings for SQLite (forked from IdrisWeb)☆40May 1, 2018Updated 8 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- The Evolution of a Typechecker☆54Jan 20, 2019Updated 7 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Jun 11, 2016Updated 10 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 9 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆47May 14, 2016Updated 10 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆13May 15, 2017Updated 9 years ago
- Formalising Type Theory in a modular way for translations between type theories☆97Jan 10, 2018Updated 8 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 4 years ago
- Regular expression matching in Idris☆11Apr 27, 2016Updated 10 years ago
- Formalisation of Goedel's System T in Coq☆15Jul 1, 2011Updated 15 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 9 years ago
- wherein I implement several substructural logics in Agda☆24Oct 8, 2018Updated 8 years ago
- being a funny little programming language with a funny little abstract machine☆16Jun 25, 2015Updated 11 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 9 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 9 years ago
- Typed DSLs for sorting☆20Feb 16, 2018Updated 8 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- Haskell implementation of the Edinburgh Logical Framework☆34Jan 12, 2026Updated 9 months ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 11 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Coq implementation of SF-calculus and the tranlsation to it of lift lambda-calculus☆11Mar 31, 2017Updated 9 years ago
- Expands type synonyms in Template Haskell ASTs☆11Jan 10, 2026Updated 9 months ago
- ☆100Mar 17, 2026Updated 7 months ago
- Luck -- A Language for Property-Based Generators☆38Feb 28, 2025Updated last year
- Implementation of Nuprl's type theory in Coq☆47Jul 28, 2026Updated 3 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 8 years ago
- A library for formalizing Haskell types and functions in Coq☆171Oct 15, 2023Updated 3 years ago
- A bare-bones LCF-style proof assistant☆26Aug 13, 2019Updated 7 years ago
- A graphical tool to translate lambda terms to proof nets and run GoI token machine on it☆10Apr 24, 2016Updated 10 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆24May 1, 2016Updated 10 years ago
- ☆34Apr 17, 2023Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 8 years ago
- Formal topology (and some probability) in Coq☆31Nov 30, 2018Updated 7 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Jun 12, 2019Updated 7 years ago
- ☆23Aug 30, 2017Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year