A self-contained implementation of forward and backward inference for intuitionistic propositional logic
☆18Oct 10, 2017Updated 9 years ago
Alternatives and similar repositories for lcf-sequent-calculus-example
Users that are interested in lcf-sequent-calculus-example 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 bare-bones LCF-style proof assistant☆26Aug 13, 2019Updated 7 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
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 9 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
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 9 years ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- Normalization by Evaluation for STLC with sums (no proof of correctness, shame! shame! shame!)☆12Nov 22, 2019Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆23Oct 22, 2026Updated 3 weeks ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 11 years ago
- ☆21Mar 15, 2018Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 10 years ago
- System F in coq.☆19Jan 27, 2015Updated 11 years ago
- Implementation of Nuprl's type theory in Coq☆48Jul 28, 2026Updated 3 months ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 9 years ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆17Dec 10, 2019Updated 6 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆34Jan 12, 2026Updated 10 months ago
- A small implementation of a proof refinement logic.☆51Jul 3, 2017Updated 9 years ago
- ☆21Apr 15, 2018Updated 8 years ago
- Resources for "One Monad to Prove Them All"☆31Sep 30, 2026Updated last month
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 8 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆14Nov 19, 2017Updated 9 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 9 years ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 7 years ago
- what I did on my holidays☆12Jul 9, 2018Updated 8 years ago
- My final year project at the University of Strathclyde☆14Jan 26, 2023Updated 3 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Oct 12, 2018Updated 8 years ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Apr 29, 2021Updated 5 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆17Feb 13, 2018Updated 8 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 5 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 7 years ago
- A formalization of category theory in cubical Agda☆59May 24, 2020Updated 6 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- An image-processing library for Haskell.☆10Mar 26, 2016Updated 10 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 9 years ago
- Agda formalisation of dual-context constructive modal logics.☆21Apr 1, 2020Updated 6 years ago
- Verified NbE via gluing in Agda☆11May 19, 2024Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆63Sep 11, 2025Updated last year
- Type Theory with Indexed Equality☆27Apr 7, 2017Updated 9 years ago
Are these results useful?