There is no fully abstract fixpoint sema
✍
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