Fixed point theorems and semantics: A folk tale

DOI10.1016/0020-0190(82)90065-5zbMath0488.68015OpenAlexW2035688359MaRDI QIDQ1166268

S. Singh

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90065-5

zbMATH Keywords

folk theoremsfixed point theory of recursionleast fixed point theorems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items (31)

Stratified least fixpoint logic ⋮ Merging regular processes by means of fixed-point theory ⋮ Latticed \(k\)-induction with an application to probabilistic programs ⋮ A fixpoint theory for non-monotonic parallelism ⋮ $\aleph_1$ and the modal $\mu$-calculus ⋮ Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Programmological aspects of the fixed point method ⋮ Monotone recursive types and recursive data representations in Cedille ⋮ An approach to literate and structured formal developments ⋮ Using automata theory for characterizing the semantics of terminological cycles ⋮ Epistemic injustice in mathematics ⋮ Unnamed Item ⋮ Tarski’s Influence on Computer Science ⋮ Generalizing Inference Systems by Coaxioms ⋮ Basic notions of universal algebra for language theory and graph grammars ⋮ Duality and the completeness of the modal \(\mu\)-calculus ⋮ Extremal solutions of inequations over lattices with applications to supervisory control ⋮ Unnamed Item ⋮ Unifying theories of reactive design contracts ⋮ Toward an algebraic theory of systems ⋮ Operations on fixpoint equation systems ⋮ Automated verification of reactive and concurrent programs by calculation ⋮ Bi-inductive structural semantics ⋮ The infimal prefix-closed and observable superlanguage of a given language ⋮ Recursive queries and context-free graph grammars ⋮ Continuously generated fixed points ⋮ Swinging types=functions+relations+transition systems ⋮ The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\) ⋮ Transformational derivation of an improved alias analysis algorithm ⋮ Regular algebra applied to language problems ⋮ Generating functions for probabilistic programs

Cites Work

• Chain-complete posets and directed sets with applications
• Some fixed point theorems of the mappings of partially ordered sets
• The origin of Zorn's lemma
• The convergence of functions to fixedpoints of recursive definitions
• Constructive versions of Tarski's fixed point theorems
• The method of successive approximations for functional equations
• Sur le théorème de Zorn
• A lattice-theoretical fixpoint theorem and its applications
• A Theorem on Partially Ordered Sets, With Applications to Fixed Point Theorems
• On folk theorems
• Non‐Standard Models of Ordinal Arithmetics
• On the existence of optimal fixpoints
• Data Types as Lattices
• On monotonous mappings of complete lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fixed point theorems and semantics: A folk tale