### Skapa referens, olika format (klipp och klistra)

**Harvard**

Ostrovsky, K., Prasad, K. och Taha, W. (2002) *Towards a Primitive Higher Order Calculus of Broadcasting Systems*.

** BibTeX **

@conference{

Ostrovsky2002,

author={Ostrovsky, Karol and Prasad, K. V. S. and Taha, W.},

title={Towards a Primitive Higher Order Calculus of Broadcasting Systems},

booktitle={Proceedings of the Fourth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02), Pittsburg, 6-8 October 2002},

isbn={1581135289},

pages={2-13},

abstract={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.},

year={2002},

keywords={Broadcasting, Calculi, Concurrency, Ethernet, Programming languages, Semantics},

}

** RefWorks **

RT Conference Proceedings

SR Electronic

ID 173650

A1 Ostrovsky, Karol

A1 Prasad, K. V. S.

A1 Taha, W.

T1 Towards a Primitive Higher Order Calculus of Broadcasting Systems

YR 2002

T2 Proceedings of the Fourth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02), Pittsburg, 6-8 October 2002

SN 1581135289

SP 2

AB 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.

LA eng

DO 10.1145/571157.571159

LK http://dx.doi.org/10.1145/571157.571159

OL 30