𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fixpoint semantics and simulation

✍ Scribed by Wim H. Hesselink; Albert Thijs

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
220 KB
Volume
238
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

A general functorial framework for recursive deΓΏnitions is presented in which simulation of a deΓΏnition scheme by another one implies an ordering between the values deΓΏned by these schemes in an arbitrary model. Under mild conditions on the functor involved, the converse implication also holds: a model is constructed such that, if the values deΓΏned are ordered, there is a simulation between the deΓΏnition schemes. The theory is illustrated by applications to contextfree grammars, recursive procedures in imperative languages, and simulation and bisimulation of processes.

πŸ“œ SIMILAR VOLUMES

There is no fully abstract fixpoint sema
There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
✍ Sven-Olof NystrΓΆm πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 456 KB

It is well known that for many non-deterministic programming languages there is no continuous fully abstract fixpoint semantics. This is usually attributed to "problems with continuity", that is, the assumption that the semantic functions should be continuous supposedly plays a role in the difficult

A useful fixpoint theorem
A useful fixpoint theorem
✍ Josef Niederle πŸ“‚ Article πŸ“… 1998 πŸ› Springer Milan 🌐 Italian βš– 82 KB