Expressiveness via Intensionality and Concurrency - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Expressiveness via Intensionality and Concurrency

Thomas Given-Wilson
  • Function : Author
  • PersonId : 955938


Computation can be considered by taking into account two dimensions: extensional versus intensional, and sequential versus concurrent. Traditionally sequential extensional computation can be captured by the lambda-calculus. However, recent work shows that there are more expressive intensional calculi such as SF-calculus. Traditionally process calculi capture computation by encoding the lambda-calculus, such as in the pi-calculus. Following this increased expressiveness via intensionality, other recent work has shown that concurrent pattern calculus is more expressive than pi-calculus. This paper formalises the relative expressiveness of all four of these calculi by placing them on a square whose edges are irreversible encodings. This square is representative of a more general result: that expressiveness increases with both intensionality and concurrency.
Fichier principal
Vignette du fichier
compute.pdf (133.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00999082 , version 1 (03-06-2014)



Thomas Given-Wilson. Expressiveness via Intensionality and Concurrency. ICTAC 2014 - 11th International Colloquium on Theoretical Aspects of Computing, Sep 2014, Bucharest, Romania. pp.206-223, ⟨10.1007/978-3-319-10882-7_13⟩. ⟨hal-00999082⟩
312 View
123 Download



Gmail Facebook X LinkedIn More