Fixed Points and Noetherian Topologies
Résumé
Abstract Noetherian spaces are a generalisation of well-quasi-orderings to topologies, that can be used to prove termination of programs. They find applications in the verification of transition systems, some of which are better described using topology. The goal of this paper is to allow the systematic description of computations using inductively defined datatypes via Noetherian spaces. This is achieved through a fixed point theorem based on a topological minimal bad sequence argument.
| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|
