Paper: A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types (at LICS 1995)
Authors: Alan JeffreyAbstract
This paper presents a typed higher-order concurrent functional programming language, based on Moggi's monadic metalanguage and Reppy's Concurrent ML. We present an operational semantics for the language, and show that a higher-order variant of the traces model is fully abstract for may-testing. This proof uses a program logic based on Hennessy--Milner logic and Abramsky's domain theory in logical form.
BibTeX
@InProceedings{Jeffrey-AFullyAbstractSeman,
author = {Alan Jeffrey},
title = {A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types},
booktitle = {Proceedings of the Tenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1995},
year = 1995,
editor = {Dexter Kozen},
month = {June},
pages = {255-264},
location = {San Diego, CA, USA},
publisher = {IEEE Computer Society Press}
}
