A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types

Authors:
Alan Jeffrey
Affiliations:
-
Venue:
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Year:
1995

Citing 0
Cited 11

A theory of weak bisimulation for core CML

Proceedings of the first ACM SIGPLAN international conference on Functional programming
A fully abstract model for the π-calculus

Information and Computation
A Fully-Abstract Model for the p-calculus

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Relating operational and denotational semantics for input/output effects

Mathematical Structures in Computer Science
A theory of weak bisimulation for Core CML

Journal of Functional Programming
Transactional events

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Transactional events for ML

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Typed closure conversion preserves observational equivalence

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
A model of cooperative threads

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transactional events1

Journal of Functional Programming
An equivalence-preserving CPS translation via multi-language semantics

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

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.