Fixed point theorems and semantics: A folk tale
From MaRDI portal
Publication:1166268
DOI10.1016/0020-0190(82)90065-5zbMath0488.68015MaRDI QIDQ1166268
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
68Q60: Specification and verification (program logics, model checking, etc.)
68N01: General topics in the theory of software
Related Items
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, The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\), Stratified least fixpoint logic, Using automata theory for characterizing the semantics of terminological cycles, Swinging types=functions+relations+transition systems, The infimal prefix-closed and observable superlanguage of a given language, A fixpoint theory for non-monotonic parallelism, Programmological aspects of the fixed point method, An approach to literate and structured formal developments