𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fully abstract semantics for a higher-order functional language with nondeterministic computation

✍ Scribed by Alan Jeffrey

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
299 KB
Volume
228
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

This paper presents a functional programming language, based on Moggi's monadic metalanguage. In the ΓΏrst part of this paper, we show how the language can be regarded as a monad on a category of signatures, and that the resulting category of algebras is equivalent to the category of computationally cartesian closed categories. In the second part, we extend the language to include a nondeterministic operational semantics, and show that the lower powerdomain semantics is fully abstract for may-testing.

πŸ“œ 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