• DocumentCode
    3294013
  • Title

    A fully abstract semantics for a concurrent functional language with monadic types

  • Author

    Jeffrey, Alan

  • Author_Institution
    Sch. of Cognitive & Comput. Sci., Sussex Univ., Brighton, UK
  • fYear
    1995
  • fDate
    26-29 Jun 1995
  • Firstpage
    255
  • Lastpage
    264
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 1995. LICS '95. Proceedings., Tenth Annual IEEE Symposium on
  • Conference_Location
    San Diego, CA
  • ISSN
    1043-6871
  • Print_ISBN
    0-8186-7050-9
  • Type

    conf

  • DOI
    10.1109/LICS.1995.523261
  • Filename
    523261
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3294013