Abstract

This paper presents a functional programming language, based on Moggi's monadic metalanguage. In the first 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. 1 Introduction Moggi has proposed strong monads as an appropriate way to model computation. In [9], he shows that any model of computation satisfying certain equations forms a strong monad. His work concentrates on the denotational properties of programs, whereas we shall show how his work can be applied to an operational semantics. In the first section of this paper, we present a slight variant on his functional monadic metalanguage and show that its algebras are equivalent to strong mo...

Citations

363	LCF considered as a programming language - Plotkin - 1977
218	The lazy lambda calculus - Abramsky - 1990
214	Domain theory in logical form - Abramsky - 1991
122	Higher-order concurrency - Reppy - 1992
92	Equality in lazy computation systems - Howe - 1989
56	LOTOS|A Formal Description Technique Based on the Temporal Ordering - ISO
40	The Lazy Lambda Calculus: an Investigation into the Foundations of Functional Programming - Ong - 1988
17	Non-determinism in a functional setting - Ong - 1993
12	A higher-order concurrent langauge - Reppy - 1991
9	A fully abstract semantics for a higher-order functional language with nondeterministic computation - Jeffrey - 1999
7	A denotational model for higher-order processes - Hennessy - 1992
6	Proving congruence of simulation orderings in functional languages. Unpublished manuscript - Howe - 1989
4	Notions of computation and mondad - Moggi - 1991
2	Fully abstract semantics of typed l-calculi - Milner - 1977