hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Towards a Primitive Higher Order Calculus of Broadcasting Systems
Department of Computing Science, Chalmers University of Technology, Gothenburg, Sweden.
Department of Computing Science, Chalmers University of Technology, Gothenburg, Sweden.
Department of Computer Science, Rice University, Houston, TX, USA.
2002 (English)In: PPDP '02: Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming, New York, NY: ACM Press, 2002, 2-13 p.Conference paper, Published paper (Refereed)
Abstract [en]

Ethernet-style broadcast is a pervasive style of computer communication. In this style, the medium is a single nameless channel. Previous work on modelling such systems proposed a first order process calculus called CBS. In this paper, we propose a fundamentally different calculus called HOBS. Compared to CBS, HOBS 1) is higher order rather than first order, 2) supports dynamic subsystem encapsulation rather than static, and 3) does not require an "underlying language" to be Turing-complete. Moving to a higher order calculus is key to increasing the expressivity of the primitive calculus and alleviating the need for an underlying language. The move, however, raises the need for significantly more machinery to establish the basic properties of the new calculus. This paper develops the basic theory for HOBS and presents two example programs that illustrate programming in this language. The key technical underpinning is an adaptation of Howe's method to HOBS to prove that bisimulation is a congruence. From this result, HOBS is shown to embed the lazy λ-calculus.

Place, publisher, year, edition, pages
New York, NY: ACM Press, 2002. 2-13 p.
Keyword [en]
Broadcasting, Ethernet, Calculi, Programming languages, Semantics, Concurrency
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:hh:diva-20982DOI: 10.1145/571157.571159Scopus ID: 2-s2.0-0036992134Libris ID: 12438607ISBN: 1-58113-528-9 OAI: oai:DiVA.org:hh-20982DiVA: diva2:588282
Conference
PPDP'02 – Fourth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, Pittsburgh, Pennsylvania, USA, October 6-8, 2002
Note

K. O. partly funded by a grant from Telefonaktiebolaget LM Ericsson, and NSF ITR-0113569.

Available from: 2013-01-15 Created: 2013-01-14 Last updated: 2015-08-06Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Taha, Walid
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 67 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf