License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.04351.11
URN: urn:nbn:de:0030-drops-1300
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2005/130/
Go to the corresponding Portal

Berger, Ulrich

Continuous Semantics for Termination Proofs

pdf-format:
04351.BergerUlrich.Paper.130.pdf (0.2 MB)

Abstract

We prove a general strong normalization theorem for higher type
rewrite systems based on Tait's strong computability predicates and a
strictly continuous domain-theoretic semantics. The theorem applies to
extensions of Goedel's system $T$, but also to various forms of bar
recursion for which termination was hitherto unknown.

BibTeX - Entry

@InProceedings{berger:DagSemProc.04351.11,
  author =	{Berger, Ulrich},
  title =	{{Continuous Semantics for Termination Proofs}},
  booktitle =	{Spatial Representation: Discrete vs. Continuous Computational Models},
  pages =	{1--19},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4351},
  editor =	{Ralph Kopperman and Michael B. Smyth and Dieter Spreen and Julian Webster},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2005/130},
  URN =		{urn:nbn:de:0030-drops-1300},
  doi =		{10.4230/DagSemProc.04351.11},
  annote =	{Keywords: Higher-order term rewriting , termination , domain theory}
}

Keywords: Higher-order term rewriting , termination , domain theory
Collection: 04351 - Spatial Representation: Discrete vs. Continuous Computational Models
Issue Date: 2005
Date of publication: 22.04.2005

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