stop when you are almost-full adventures in constructive termination（当你全部冒险现象在建设性的终止）.pdfVIP

Stop when you are Almost-Full Adventures in constructive termination Dimitrios Vytiniotis Thierry Coquand Microsoft Research, Cambridge, U.K. University of Gothenburg dimitris@ coquand@chalmers.se Abstract Ramsey-like arguments: Though similar proofs are typically clas- sical, we offer a constructive development in the footsteps of Veld- Disjunctive well-foundedness (used in Terminator), size-change man and Bezem [28, 9], and Richman and Stolzenberg [22]. termination, and well-quasi-orders (used in supercompilation and term-rewrite systems) are examples of techniques that have been Specifically, our contributions with this paper are: successfully applied to automatic proofs of program termination • We introduce a novel mechanism for type-based termination, and online termination testing, respectively. Although these works that of almost-full relations (Section 2), which is a weaker originate in different communities, there is an intimate connection version of the more traditional well-quasi-orders, originating in between them – they rely on closely related principles and both intuitionistic mathematics. employ similar arguments from Ramsey theory. At the same time there is a notable absence of these techniques in programming sys- • We formally explain the connection between almost-full rela- tems based on constructive type theory. In this paper we’d like to