License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.08271.4
URN: urn:nbn:de:0030-drops-16536
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1653/
Go to the corresponding Portal

Mancilla, Blanca ; Plaice, John

Declarative Synchronous Multithreaded Programming

pdf-format:
08271.MancillaBlanca.Paper.1653.pdf (0.2 MB)

Abstract

We demonstrate how TransLucid can be used as a reactive system. At each instant, there is a set of active ports, where sets of equations, demands and threads are all registered. Each thread defines a sequence of (state, demand) pairs, and threads may interact through the overall set of equations. The entire system remains fully declarative.

BibTeX - Entry

@InProceedings{mancilla_et_al:DagSemProc.08271.4,
  author =	{Mancilla, Blanca and Plaice, John},
  title =	{{Declarative Synchronous Multithreaded Programming}},
  booktitle =	{Topological and Game-Theoretic Aspects of Infinite Computations},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8271},
  editor =	{Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2008/1653},
  URN =		{urn:nbn:de:0030-drops-16536},
  doi =		{10.4230/DagSemProc.08271.4},
  annote =	{Keywords: Synchronous programming, distributed computing, declarative programming, Cartesian programming, multidimensional programming.}
}

Keywords: Synchronous programming, distributed computing, declarative programming, Cartesian programming, multidimensional programming.
Collection: 08271 - Topological and Game-Theoretic Aspects of Infinite Computations
Issue Date: 2008
Date of publication: 05.11.2008

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI