Eager functions as processes

DOI10.1016/J.TCS.2022.01.043zbMath1483.68226OpenAlexW4210298401MaRDI QIDQ2123050

Davide Sangiorgi, Adrien Durier, Daniel Hirschkoff

Publication date: 7 April 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.043

zbMATH Keywords

behavioural equivalence\( \pi \)-calculuscall-by-value \(\lambda \)-calculusfull-abstraction

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong normalisation in the \(\pi\)-calculus
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• The parametric lambda calculus. A metamodel for computation.
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Games characterizing Levy-Longo trees
• Adapting innocent game models for the Böhm tree \(\lambda\)-theory
• Game-theoretic analysis of call-by-value computation
• On polymorphic sessions and functions. A tale of two (fully abstract) encodings
• Open Call-by-Value
• A Complete, Co-inductive Syntactic Theory of Sequential Control and State
• Trees from Functions as Processes
• Termination in Impure Concurrent Languages
• Typed Normal Form Bisimulation
• Functions as processes
• On the Relative Usefulness of Fireballs
• On asynchrony in name-passing calculi
• Eager Functions as Processes
• Termination of processes
• An investigation into functions as processes

This page was built for publication: Eager functions as processes