<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>01231463</id>
  <dt>a</dt>
  <an>01231463</an>
  <augroup>
    <au>Jeffrey, Alan</au>
    <au>Stuart, Austin</au>
  </augroup>
  <ti>A fully abstract semantics for a nondeterministic functional language with monadic types.</ti>
  <so>Brookes, Steve (ed.) et al., Mathematical foundations of programming semantics. Proceedings of the 11th conference (MFPS), Tulane Univ., New Orleans, LA, USA, March 29 - April 1, 1995. Amsterdam: Elsevier, Electronic Notes in Theoretical Computer Science. 1, 12 p. (1995).</so>
  <py>1995</py>
  <pu>Amsterdam: Elsevier</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>functional programming language</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>http://www.elsevier.com/cas/tree/store/tcs/free/noncas/pc/volume1.htm#jeffrey</li>
  </ligroup>
  <abgroup>
    <ab>Summary: 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.</ab>
    <rv></rv>
  </abgroup>
</item>