Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
1 result

Abstract GSOS Rules and a Modular Treatment of Recursive Definitions

Stefan Milius ; Lawrence S Moss ; Daniel Schwencke.
Terminal coalgebras for a functor serve as semantic domains for state-based systems of various types. For example, behaviors of CCS processes, streams, infinite trees, formal languages and non-well-founded sets form terminal coalgebras. We present a uniform account of the semantics of recursive&nbsp;[&hellip;]
Published on September 30, 2013
Volume 9, Issue 3
  • < Previous
  • 1
  • Next >