First-order natural deduction in Agda

04/08/2021
by   Louis Warren, et al.
0

Agda is a dependently-typed functional programming language, based on an extension of intuitionistic Martin-Löf type theory. We implement first order natural deduction in Agda. We use Agda's type checker to verify the correctness of natural deduction proofs, and also prove properties of natural deduction, using Agda's proof assistant functionality. This implementation corresponds to a formalisation of natural deduction in constructive type theory, and the proofs are verified by Agda to be correct (under the assumption that Agda itself is correct).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2022

VeriFx: Correct Replicated Data Types for the Masses

Distributed systems adopt weak consistency to ensure high availability a...
research
07/27/2018

Limits with Signed Digit Streams

We work with the signed digit representation of abstract real numbers, w...
research
07/11/2018

Formalizing Constructive Quantifier Elimination in Agda

In this paper a constructive formalization of quantifier elimination is ...
research
02/19/2021

Overcoming Restraint: Modular Refinement using Cogent's Principled Foreign Function Interface

Cogent is a restricted functional language designed to reduce the cost o...
research
10/17/2022

Holbert: Reading, Writing, Proving and Learning in the Browser

This paper presents Holbert: a work-in-progress pedagogical proof assist...
research
02/01/2023

A Universal Technique for Machine-Certified Proofs of Linearizable Algorithms

Linearizability has been the long standing gold standard for consistency...
research
11/28/2018

Adventures in Formalisation: Financial Contracts, Modules, and Two-Level Type Theory

We present three projects concerned with applications of proof assistant...

Please sign up or login with your details

Forgot password? Click here to reset