Functions as processes
From MaRDI portal
Publication:4017458
DOI10.1017/S0960129500001407zbMath0773.03012WikidataQ56019900 ScholiaQ56019900MaRDI QIDQ4017458
Publication date: 16 January 1993
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatory logic and lambda calculus (03B40)
Related Items
Topological models for higher order control flow, An investigation into functions as processes, A chemical abstract machine for graph reduction extended abstract, Unnamed Item, Unnamed Item, Reasoning about cryptographic protocols in the spi calculus, Non-Deterministic Functions as Non-Deterministic Processes (Extended Version), Retracing some paths in process algebra, Rewriting logic as a semantic framework for concurrency: a progress report, Constraints as processes, Comparing the expressiveness of the \(\pi \)-calculus and CCS, On the expressiveness of internal mobility in name-passing calculi, Computability structures, simulations and realizability, Non-deterministic structures of computation, Linearity, session types and the Pi calculus, Linear logic propositions as session types, Structural inclusion in the pi-calculus with replication, From rewrite rules to bisimulation congruences, Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators, On the semantics of durational actions, Unnamed Item, Unnamed Item, Characteristic bisimulation for higher-order session processes, Reversibility in the higher-order \(\pi\)-calculus, Eager functions as processes, Declarative event based models of concurrency and refinement in psi-calculi, Mixed Sessions, From π-calculus to higher-order π-calculus — and back, Modelling biochemical pathways through enhanced \(\pi\)-calculus, A spatial logic for concurrency. I, From a concurrent λ-calculus to the π-calculus, Trees from Functions as Processes, An exercise in structural congruence, On reduction-based process semantics, On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus, Linear forwarders, A theory of bisimulation for the \(\pi\)-calculus, Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less), Reversing algebraic process calculi, Structural congruence for bialgebraic semantics, A two-level logic approach to reasoning about computations, A pi-calculus based semantics for WS-BPEL, A functional presentation of pi calculus, Strong normalisation in the \(\pi\)-calculus, Game theoretic analysis of call-by-value computation, The name discipline of uniform receptiveness (extended abstract), A proof theoretical approach to communication, The geometry of orthogonal reduction spaces, The rewriting logic semantics project, Fair ambients, Symmetries and Dualities in Name-Passing Process Calculi, A foundation for higher-order concurrent constraint programming, On the decidability of process equivalences for the π-calculus, πI: A symmetric calculus based on internal mobility, On the decidability of process equivalences for the \(\pi\)-calculus, Distinguishing and relating higher-order and first-order processes by expressiveness, Theory of interaction, Unnamed Item, Replacement freeness: a criterion for separating process calculi, Unnamed Item, Unnamed Item, Towards a unified approach to encodability and separation results for process calculi, Variations on mobile processes, Game-theoretic analysis of call-by-value computation, The name discipline of uniform receptiveness, Unnamed Item, Towards a Unified Approach to Encodability and Separation Results for Process Calculi, A taxonomy of process calculi for distribution and mobility, \(\pi\)-calculus, internal mobility, and agent-passing calculi, Filter models for conjunctive-disjunctive \(\lambda\)-calculi, Locality and interleaving semantics in calculi for mobile processes, A multiset semantics for the pi-calculus with replication, Linear Lambda Calculus and Deep Inference, On the concurrent computational content of intermediate logics, Structural recursion with locally scoped names, The \(C_\pi\)-calculus: a model for confidential name passing, On the expressiveness of interaction, Unnamed Item, An exact correspondence between a typed pi-calculus and polarised proof-nets, Fundamentals of session types, Unnamed Item, The calculus of context-aware ambients, An object based algebra for specifying a fault tolerant software architecture, Ensuring termination by typability, Linearity and bisimulation, On Hierarchical Communication Topologies in the $$\pi $$ -calculus, On the Relative Expressive Power of Calculi for Mobility, A rewriting logic approach to operational semantics, Mixed sessions, A thesis for interaction, Unnamed Item, Full Abstraction in a Subtyped pi-Calculus with Linear Types, Session-Based Communication Optimisation for Higher-Order Mobile Processes, A Fresh Look at the λ-Calculus, On parameterization of higher-order processes, A Process-Model for Linear Programs, An interpretation of typed objects into typed \(\pi\)-calculus, Systemic yoyo structure in human thoughts and the fourth crisis in mathematics, The λ-calculus in the π-calculus, Multisets and structural congruence of the pi-calculus with replication, Concurrency and knowledge-level communication in agent languages, On the expressiveness of internal mobility in name-passing calculi, On bisimulations for the asynchronous \(\pi\)-calculus, A calculus for cryptographic protocols: The spi calculus, A First-Order Syntax for the π-Calculus in Isabelle/HOL using Permutations, Continuation-based transformations for coordination languages, Mobile ambients, On the semantics of the call-by-name CPS transform, On the computational power of BlenX, Explicit fusions, FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS, Asynchronous process calculi: The first- and higher-order paradigms, Genericity and the \(\pi\)-calculus, Molecular interaction., Understanding the mismatch combinator in chi calculus, Decoding choice encodings, Perpetuality and uniform normalization in orthogonal rewrite systems, Secure implementation of channel abstractions, The conflict-free reduction geometry, Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus, A Calculus of Global Interaction based on Session Types, Communication errors in the \(\pi\)-calculus are undecidable
Cites Work
