License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2017.109
URN: urn:nbn:de:0030-drops-73919
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7391/
Go to the corresponding LIPIcs Volume Portal

Dowek, Gilles

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

pdf-format:
LIPIcs-ICALP-2017-109.pdf (0.5 MB)

Abstract

We define a notion of model for the lambda Pi-calculus modulo theory and prove a soundness theorem. We then define a notion of super-consistency and prove that proof reduction terminates in the lambda Pi-calculus modulo any super-consistent theory. We prove this way the termination of proof reduction in several theories including Simple type theory and the Calculus of constructions.

BibTeX - Entry

@InProceedings{dowek:LIPIcs:2017:7391,
  author =	{Gilles Dowek},
  title =	{{Models and Termination of Proof Reduction in the lambda Pi-Calculus Modulo Theory}},
  booktitle =	{44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
  pages =	{109:1--109:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-041-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{80},
  editor =	{Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7391},
  URN =		{urn:nbn:de:0030-drops-73919},
  doi =		{10.4230/LIPIcs.ICALP.2017.109},
  annote =	{Keywords: model, proof reduction, Simple type theory, Calculus of constructions}
}

Keywords: model, proof reduction, Simple type theory, Calculus of constructions
Collection: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Issue Date: 2017
Date of publication: 07.07.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI