https://hal.inria.fr/hal-00999082Given-Wilson, ThomasThomasGiven-WilsonCOMETE - Concurrency, Mobility and Transactions - LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau] - X - École polytechnique - CNRS - Centre National de la Recherche Scientifique - Inria Saclay - Ile de France - Inria - Institut National de Recherche en Informatique et en AutomatiqueExpressiveness via Intensionality and ConcurrencyHAL CCSD2014Expressiveness Intensionality Combinatory Logic Process Calculi[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL][INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO]Palamidessi, Catuscia - Processus non-standard: Analyse, Coinduction, Expressivité - - PACE2012 - ANR-12-IS02-0001 - Blanc International II - VALID - Gabriel Ciobanu and Dominique Méry2014-06-03 11:20:212022-06-25 19:46:542014-06-03 11:52:59enConference papershttps://hal.inria.fr/hal-00999082/document10.1007/978-3-319-10882-7_13application/pdf1Computation 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.