AI Chat AI Image Generator AI Video Text to Speech

A new coinductive confluence proof for infinitary lambda-calculus

08/15/2018

∙

by Łukasz Czajka, et al.

∙

∙

We present a new and formal coinductive proof of confluence and normalisation of Böhm reduction in infinitary lambda-calculus. The proof is simpler than previous proofs of this result. The technique of the proof is new, i.e., it is not merely a coinductive reformulation of any earlier proofs. We formalised the proof in the Coq proof assistant.

page 1

page 2

page 3

page 4

research

∙ 06/06/2016

Proof nets for the Displacement calculus

We present a proof net calculus for the Displacement calculus and show i...

0 Richard Moot, et al. ∙

research

∙ 05/27/2010

Proofs, proofs, proofs, and proofs

In logic there is a clear concept of what constitutes a proof and what n...

0 Manfred Kerber, et al. ∙

research

∙ 02/21/2019

Schematic Refutations of Formula Schemata

Proof schemata are infinite sequences of proofs which are defined induct...

0 David Cerna, et al. ∙

research

∙ 12/05/2017

Analyzing Individual Proofs as the Basis of Interoperability between Proof Systems

We describe the first results of a project of analyzing in which theorie...

0 Gilles Dowek, et al. ∙

research

∙ 06/06/2018

Another Proof of Cuckoo hashing with New Variants

We show a new proof for the load of obtained by a Cuckoo Hashing data st...

0 Udi Wieder, et al. ∙

research

∙ 06/14/2011

Generating Schemata of Resolution Proofs

Two distinct algorithms are presented to extract (schemata of) resolutio...

0 Vincent Aravantinos, et al. ∙

research

∙ 08/26/2019

EKSTRAKTO A tool to reconstruct Dedukti proofs from TSTP files (extended abstract)

Proof assistants often call automated theorem provers to prove subgoals....

0 Mohamed Yacine El Haddad, et al. ∙