uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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
The Update Calculus
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Computer Systems. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Mobility)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Computer Systems. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Mobility)ORCID iD: 0000-0003-0174-9032
1997 (English)In: Proceedings of AMAST'97 / [ed] Michael Johnson, Berlin: Springer , 1997, 409-423 p.Conference paper, Published paper (Refereed)
Abstract [en]

In the update calculus concurrent processes can perform update actions with side effects, and a scoping operator can be used to control the extent of the update. In this way it incorporates fundamental concepts both from imperative languages or concurrent constraints formalisms, and from functional formalisms such as the lambda- and pi-calculi. Structurally it is similar to but simpler than the pi-calculus; it has only one binding operator and a symmetry between input and output. We define the structured operational semantics and the proper bisimulation equivalence and congruence, and give a complete axiomatization. The pi-calculus turns out to be an asymmetric subcalculus.

Place, publisher, year, edition, pages
Berlin: Springer , 1997. 409-423 p.
Series
Lecture notes in computer science, ISSN 0302-9743 ; 1349
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-74250DOI: 10.1007/BFb0000486ISBN: 3540638881 (print)OAI: oai:DiVA.org:uu-74250DiVA: diva2:102160
Conference
Algebraic methodology and software technology : 6th international conference, AMAST '97, Sydney, Australia, December 13 - 17, 1997
Available from: 2006-12-10 Created: 2006-12-10 Last updated: 2016-02-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Parrow, JoachimVictor, Björn

Search in DiVA

By author/editor
Parrow, JoachimVictor, Björn
By organisation
Department of Computer SystemsComputing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 625 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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