A Computability Path Ordering for Polymorphic Terms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

A Computability Path Ordering for Polymorphic Terms

Abstract

We develop a new version of the computability path ordering, which is well-founded on the set of polymorphic lambda terms. This is a new important step towards our challenge: to develop a well-founded order on the set of terms of the calculus of constructions, allowing to reduce strong normalization proofs of logical calculi to ordering comparisons of their computational rules.
No file

Dates and versions

inria-00497405 , version 1 (05-07-2010)

Identifiers

  • HAL Id : inria-00497405 , version 1

Cite

Jean-Pierre Jouannaud, Jian-Qi Li. A Computability Path Ordering for Polymorphic Terms. 11th International Workshop on Termination, Jul 2010, Edinburgh, United Kingdom. ⟨inria-00497405⟩
96 View
0 Download

Share

Gmail Facebook X LinkedIn More