Title :
A fully abstract semantics for a concurrent functional language with monadic types
Author_Institution :
Sch. of Cognitive & Comput. Sci., Sussex Univ., Brighton, UK
Abstract :
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
Keywords :
computational linguistics; functional languages; lambda calculus; parallel languages; Hennessy-Milner logic; concurrent functional language; domain theory; fully abstract semantics; higher-order variant; logical form; may-testing; monadic metalanguage; monadic types; operational semantics; program logic; traces model; typed higher-order concurrent functional programming; Algebra; Carbon capture and storage; Computer languages; Concurrent computing; Equations; Functional programming; Logic programming; Network address translation;
Conference_Titel :
Logic in Computer Science, 1995. LICS '95. Proceedings., Tenth Annual IEEE Symposium on
Conference_Location :
San Diego, CA
Print_ISBN :
0-8186-7050-9
DOI :
10.1109/LICS.1995.523261
