Concurrent pattern unification

Given-Wilson, TP

Concurrent pattern unification

Given-Wilson, TP

Permalink

Publication Type:: Thesis
Issue Date:: 2012

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download contents and abstractAdobe PDF (109.03 kB)

Adobe PDF

Download thesisAdobe PDF (1.03 MB)

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Given-Wilson, TP
dc.date.accessioned	2013-04-30T03:58:36Z
dc.date.available	2013-04-30T03:58:36Z
dc.date.issued	2012
dc.identifier.uri	http://hdl.handle.net/10453/21876
dc.description	University of Technology, Sydney. Faculty of Engineering and Information Technology.	en_US
dc.description.abstract	Ever since Milner showed that Church’s λ-calculus can be subsumed by π-calculus, process calculi have been expected to subsume sequential com-putation. However, Jay & Given-Wilson show that extensional sequential computation as represented by λ-calculus is subsumed by intensional se-quential computation characterised by pattern-matching as in SF-calculus. Given-Wilson, Gorla & Jay present a concurrent pattern calculus (CPC) that adapts sequential pattern-matching to symmetric pattern-unification in a process calculus. This dissertation proves that CPC subsumes both intensionality sequential computation and extensional concurrent computa-tion, respectively SF-calculus and π-calculus, to complete a computation square. A behavioural theory is developed for CPC that is then exploited to prove that CPC is more expressive than several representative sequential and concurrent calculi. As part of its greater expressive power, CPC provides a natural language to describe interactions involving information exchange. Augmenting the pattern-matching language bondi to implement CPC yields a Concurrent bondi that is able to support web services that exploit both sequential and concurrent intensionality.	en_US
dc.format	Thesis (PhD)	en_US
dc.language.iso	en	en_US
dc.relation	https://opus.lib.uts.edu.au/bitstream/10453/21876/2/02whole.pdf
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	The author owns the copyright in this thesis including all reproduction and reuse rights for the work. The work may not be altered without the permission of the copyright owner. Attribution is essential when quoting or paraphrasing from this thesis.
dc.rights	au.edu.uts.lib/ppc
dc.title	Concurrent pattern unification	en_US
dc.type	Thesis
utslib.copyright.status	open_access

Abstract:

Ever since Milner showed that Church’s λ-calculus can be subsumed by π-calculus, process calculi have been expected to subsume sequential com-putation. However, Jay & Given-Wilson show that extensional sequential computation as represented by λ-calculus is subsumed by intensional se-quential computation characterised by pattern-matching as in SF-calculus. Given-Wilson, Gorla & Jay present a concurrent pattern calculus (CPC) that adapts sequential pattern-matching to symmetric pattern-unification in a process calculus. This dissertation proves that CPC subsumes both intensionality sequential computation and extensional concurrent computa-tion, respectively SF-calculus and π-calculus, to complete a computation square. A behavioural theory is developed for CPC that is then exploited to prove that CPC is more expressive than several representative sequential and concurrent calculi. As part of its greater expressive power, CPC provides a natural language to describe interactions involving information exchange. Augmenting the pattern-matching language bondi to implement CPC yields a Concurrent bondi that is able to support web services that exploit both sequential and concurrent intensionality.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/21876