Proving Fixed Points

Hervé Grall 1, 2
2 ASCOLA - Aspect and composition languages
Inria Rennes – Bretagne Atlantique , Département informatique - EMN, LINA - Laboratoire d'Informatique de Nantes Atlantique
Abstract : We propose a method to characterize the fixed points described in Tarski's theorem for complete lattices. The method is deductive: the least and greatest fixed points are "proved" in some inference system defined from deduction rules. We also apply the method to two other fixed point theorems, a generalization of Tarski's theorem to chain-complete posets and Bourbaki-Witt's theorem. Finally, we compare the method with the traditional iterative method resorting to ordinals and the original impredicative method used by Tarski.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download
Contributor : Hervé Grall <>
Submitted on : Saturday, July 31, 2010 - 10:06:54 AM
Last modification on : Tuesday, December 4, 2018 - 8:34:01 AM
Long-term archiving on : Tuesday, October 23, 2012 - 11:56:23 AM


Files produced by the author(s)


  • HAL Id : hal-00507775, version 1


Hervé Grall. Proving Fixed Points. 2010. ⟨hal-00507775⟩



Record views


Files downloads