Models and Termination of Proof Reduction in the lambda Pi-Calculus Modulo Theory

@inproceedings{Dowek2015ModelsAT,
  title={Models and Termination of Proof Reduction in the lambda Pi-Calculus Modulo Theory},
  author={Gilles Dowek},
  booktitle={International Colloquium on Automata, Languages and Programming},
  year={2015}
}
  • Gilles Dowek
  • Published in
    International Colloquium on…
    26 January 2015
  • Mathematics, Computer Science
We define a notion of model for the λΠ-calculus modulo theory, a notion of superconsistent theory, and prove that proof-reduction terminates in the λΠ-calculus modulo a super-consistent theory. We prove this way the termination of proof-reduction in two theories in the λΠ-calculus modulo theory, and their consistency: an embedding of Simple type theory and an embedding of the Calculus of constructions. 

Figures from this paper

Encoding of Predicate Subtyping with Proof Irrelevance in the lambda Pi-Calculus Modulo Theory

This paper shows how to encode predicate subtyping and proof irrelevance, two important features of the PVS proof assistant, and proves that this encoding is correct and that encoded proofs can be mechanically checked by Dedukti, a type checker for the λΠ-calculus modulo theory using rewriting.

Encoding of Predicate Subtyping with Proof Irrelevance in the λΠ-Calculus Modulo Theory

This paper shows how to encode predicate subtyping and proof irrelevance, two important features of the PVS proof assistant, and proves that this encoding is correct and that encoded proofs can be mechanically checked by Dedukti, a type checker for the λΠ-calculus modulo theory using rewriting.

A framework for defining computational higher-order logics. (Un cadre de définition de logiques calculatoires d'ordre supérieur)

The main aim of this thesis is to make formal proofs more universal by expressing them in a common logical framework. More specifically, we use the lambda-Pi-calculus modulo rewriting, a lambda

Termination checking in the λΠ-calculus modulo theory.From a practical and a theoretical viewpoint

A type-checker for the λΠ-calculus modulo theory, which has the particularity to allow the user to declare rewrite rules, to develop an automatic tool for the termination of a rewrite rule system.

Importing SMT and Connection proofs as expansion trees

An implementation that takes SMT and Connection proof objects from two different provers and imports them both as expansion trees so that all the algorithms and tools available for expansion trees can be employed uniformly.

Mixing HOL and Coq in Dedukti (Extended Abstract)

We use Dedukti as a logical framework for interoperability. We use automated tools to translate different developments made in HOL and in Coq to Dedukti, and we combine them to prove new results. We

Adequate and computational encodings in the logical framework Dedukti

This work is the first to present and prove correct an approach allowing for encodings that are both adequate and computational in Dedukti and is computational – that is, represents computation directly as computation.

References

SHOWING 1-10 OF 27 REFERENCES

Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo

It is shown that all functional Pure Type Systems, such as the system F, or the Calculus of Constructions, can be embedded in the lambda-Pi-calculus modulo, and that this embedding is conservative under termination hypothesis.

Definitions by rewriting in the calculus of constructions

  • F. Blanqui
  • Computer Science, Mathematics
    Proceedings 16th Annual IEEE Symposium on Logic in Computer Science
  • 2001
The strong normalization of the reduction relation generated by the /spl beta/-rule and user-defined rules under some general syntactic conditions, including confluence is proved.

Proof normalization modulo

A generic cut elimination theorem is proved showing that the cut elimination property holds for all theories having a so-called pre-model, including Church's simple type theory.

Truth Values Algebras and Proof Normalization

It is proved that super-consistency is a model-theoretic sufficient condition for strong normalization.

Theorem Proving Modulo

This paper defines a sequent calculus modulo that gives a proof-theoretic account of the combination of computations and deductions and gives a complete proof search method, called extended narrowing and resolution (ENAR), for theorem proving modulo such congruences.

Orthogonality and Boolean Algebras for Deduction Modulo

Pre-Boolean algebras and biorthogonality are used to prove a generic cut-elimination theorem for the classical sequent calculus modulo, a novel application of reducibility candidates techniques, avoiding the use of proof-terms and simplifying the arguments.

A Generic Normalisation Proof for Pure Type Systems

We prove the strong normalisation for any PTS, provided the existence of a certain Λ-set \(\mathfrak{A}^ \Uparrow \) (s) for every sort s of the system. The properties verified by the \(\mathfrak{A}^

Rewriting Calculus with Fixpoints: Untyped and First-Order Systems

This paper study extensively a first-order ρ-calculus a la Church, called \(\rho^{\rm stk}_\rightarrow\), which allows one to type (object oriented flavored) fixpoints, leading to an expressive and safe calculus.

External Rewriting for Skeptical Proof Assistants

This paper presents the design, the implementation, and experiments of the integration of syntactic, conditional possibly associative-commutative term rewriting into proof assistants based on constructive type theory and provides an effective method to prove equalities modulo these axioms in Coq using ELAN.

Proofs of strong normalisation for second order classical natural deduction

  • M. Parigot
  • Mathematics, Philosophy
    Journal of Symbolic Logic
  • 1997
Two proofs of strong normalisation for second order classical natural deduction are given, using a Kolmogorov translation and an adaptation of the method of reducibility candidates introduced in [9] forsecond order intuitionistic natural deduction.