On the relation between sized-types based termination and semantic labelling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

On the relation between sized-types based termination and semantic labelling

Abstract

We investigate the relationship between two independently developed termination techniques. On the one hand, sized-types based termination (SBT) uses types annotated with size expressions and Girard's reducibility candidates, and applies on systems using constructor matching only. On the other hand, semantic labelling transforms a rewrite system by annotating each function symbol with the semantics of its arguments, and applies to any rewrite system. First, we introduce a simplified version of SBT for the simply-typed lambda-calculus. Then, we give new proofs of the correctness of SBT using semantic labelling, both in the first and in the higher-order case. As a consequence, we show that SBT can be extended to systems using matching on defined symbols (e.g. associative functions).
Fichier principal
Vignette du fichier
main.pdf (278.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00397689 , version 1 (23-06-2009)

Identifiers

  • HAL Id : inria-00397689 , version 1
  • ARXIV : 0906.4173

Cite

Frédéric Blanqui, Cody Roux. On the relation between sized-types based termination and semantic labelling. 18th EACSL Annual Conference on Computer Science Logic - CSL 09, Sep 2009, Coimbra, Portugal. ⟨inria-00397689⟩
378 View
140 Download

Altmetric

Share

Gmail Facebook X LinkedIn More