A Complete Proof Synthesis Method for the Cube of Type Systems

06/09/2023
by   Gilles Dowek, et al.
0

We present a complete proof synthesis method for the eight type systems of Barendregt's cube extended with η-conversion. Because these systems verify the proofs-as-objects paradigm, the proof synthesis method is a one level process merging unification and resolution. Then we present a variant of this method, which is incomplete but much more efficient. At last we show how to turn this algorithm into a unification algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/30/2018

Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis

First-order resolution has been used for type inference for many years, ...
research
09/02/2020

Check Your (Students') Proofs-With Holes

Cyp (Check Your Proofs) (Durner and Noschinski 2013; Traytel 2019) verif...
research
06/14/2011

Generating Schemata of Resolution Proofs

Two distinct algorithms are presented to extract (schemata of) resolutio...
research
09/04/2019

Proof-Based Synthesis of Sorting Algorithms Using Multisets in Theorema

Using multisets, we develop novel techniques for mechanizing the proofs ...
research
12/15/2018

Enumeration, structural and dimensional synthesis of robotic hands: theory and implementation

Designing robotic hands for specific tasks could help in the creation of...
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
05/04/2022

Separations in Proof Complexity and TFNP

It is well-known that Resolution proofs can be efficiently simulated by ...

Please sign up or login with your details

Forgot password? Click here to reset