On the public citation graph
Functions as processes
0 signed · 118 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-50939-9_130openalex-snapshot
Towards a lambda-calculus for concurrent and communicating systems
inferredcites →https://doi.org/10.1007/978-3-642-82921-5_4openalex-snapshot
Notes on Communicating Sequential Systems
inferredcites →https://doi.org/10.1016/0304-3975(75)90017-1openalex-snapshot
Call-by-name, call-by-value and the λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(77)90053-6openalex-snapshot
Fully abstract models of typed λ-calculi
inferredcites →https://doi.org/10.1016/0304-3975(84)90102-6openalex-snapshot
Parametric channels via label expressions in CCS
inferredcites →https://doi.org/10.1016/0304-3975(85)90088-xopenalex-snapshot
Algebra of communicating processes with abstraction
inferredcites →https://doi.org/10.1109/sfcs.1988.21953openalex-snapshot
Fully abstract models of the lazy lambda calculus
inferredcites →https://doi.org/10.1145/75277.75290openalex-snapshot
A calculus of higher order communicating systems
inferredcites →https://doi.org/10.7146/dpb.v15i208.7559openalex-snapshot
A Calculus of Communicating Systems with Label Passing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.1757openalex-snapshot
Simulating Taverna workflows using stochastic process algebras
inferred← citeshttps://doi.org/10.1006/inco.1995.1145openalex-snapshot
Nondeterministic Extensions of Untyped λ-Calculus
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_37openalex-snapshot
Effective Chemistry for Synchrony and Asynchrony
inferred← citeshttps://doi.org/10.1007/11817949_16openalex-snapshot
A New Type System for Deadlock-Free Processes
inferred← citeshttps://doi.org/10.1007/3-540-53932-8_48openalex-snapshot
The computational field model for open distributed environments (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_20openalex-snapshot
Object-based concurrency : A process calculus analysis
inferred← citeshttps://doi.org/10.1007/3-540-54834-3_2openalex-snapshot
Concurrent processes as objects
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_11openalex-snapshot
Must preorder in non-deterministic untyped λ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_81openalex-snapshot
Asynchronous mobile processes and graph rewriting
inferred← citeshttps://doi.org/10.1007/3-540-55613-3_2openalex-snapshot
On asynchronous communication semantics
inferred← citeshttps://doi.org/10.1007/3-540-56454-3_13openalex-snapshot
The π-calculus as a theory in linear logic: Preliminary results
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_35openalex-snapshot
Types for dyadic interaction
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_70openalex-snapshot
On reduction-based process semantics
inferred← citeshttps://doi.org/10.1007/3-540-58025-5_63openalex-snapshot
Higher-order aspects of logic programming
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_120openalex-snapshot
Predicative polymorphism in π-calculus
inferred← citeshttps://doi.org/10.1007/3-540-59450-7_9openalex-snapshot
Requirements for a composition language
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_59openalex-snapshot
Causality and true concurrency: A data-flow analysis of the Pi-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_45openalex-snapshot
Process calculus based upon evaluation to committed form
inferred← citeshttps://doi.org/10.1007/978-0-387-35562-7_1openalex-snapshot
Piccola — A Small Composition Language
inferred← citeshttps://doi.org/10.1007/978-3-030-21759-4_1openalex-snapshot
Psi-Calculi Revisited: Connectivity and Compositionality
inferred← citeshttps://doi.org/10.1007/978-3-031-38100-3_2openalex-snapshot
Replications in Reversible Concurrent Calculi
inferred← citeshttps://doi.org/10.1007/978-3-319-10082-1_4openalex-snapshot
Defensive JavaScript - Building and Verifying Secure Web Components.
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_13openalex-snapshot
Expressiveness via Intensionality and Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_29openalex-snapshot
On Polymorphic Sessions and Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-72794-1_8openalex-snapshot
A Calculus for Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-78663-4_13openalex-snapshot
Access Control Based on Code Identity for Open Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_18openalex-snapshot
A Process-Model for Linear Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-04167-9_12openalex-snapshot
Session-Based Compilation Framework for Multicore Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-13414-2_1openalex-snapshot
Observables for Mobile and Wireless Broadcasting Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15640-3_5openalex-snapshot
Functions as Processes: Termination and the $\lambda\mu\widetilde{\mu}$ -Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-40213-5_8openalex-snapshot
Extending UPPAAL for the Modeling and Verification of Dynamic Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-41157-1_3openalex-snapshot
Seamless Distributed Computing from the Geometry of Interaction
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_8openalex-snapshot
Logic Programming and Meta-Logic
inferred← citeshttps://doi.org/10.1007/bf00873993openalex-snapshot
An internal language for autonomous categories
inferred← citeshttps://doi.org/10.1007/bf01211602openalex-snapshot
Asynchronous communication model based on linear logic
inferred← citeshttps://doi.org/10.1007/bfb0026985openalex-snapshot
Categorical modelling of structural operational rules case studies
inferred← citeshttps://doi.org/10.1007/bfb0057019openalex-snapshot
An object calculus for asynchronous communication
inferred← citeshttps://doi.org/10.1007/s10586-009-0099-6openalex-snapshot
Analysing scientific workflows with Computational Tree Logic
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90182-fopenalex-snapshot
Conditional rewriting logic as a unified model of concurrency
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90185-iopenalex-snapshot
The chemical abstract machine
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90181-ropenalex-snapshot
Computational interpretations of linear logic
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00072-5openalex-snapshot
Label-selective λ-calculus syntax and confluence
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.04.002openalex-snapshot
A calculus of quality for robustness against unreliable communication
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.005openalex-snapshot
On the representation of McCarthy's amb in the π -calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.06.014openalex-snapshot
Polarized process algebra with reactive composition
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.027openalex-snapshot
Observational program calculi and the correctness of translations
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.043openalex-snapshot
Eager functions as processes
inferred← citeshttps://doi.org/10.1016/s0096-0551(01)00007-8openalex-snapshot
Lenient evaluation and parallelism
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00218-1openalex-snapshot
Process calculus based upon evaluation to committed form
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00040-7openalex-snapshot
The name discipline of uniform receptiveness
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80444-4openalex-snapshot
Extending The Unified Process With Composition
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80471-2openalex-snapshot
Process Creation and Full Sequential Composition in a Name-Passing Calculus
inferred← citeshttps://doi.org/10.1017/s0956796804005386openalex-snapshot
Lambda and pi calculi, CAM and SECD machines
inferred← citeshttps://doi.org/10.1017/s0960129509990168openalex-snapshot
An expressiveness study of priority in process calculi
inferred← citeshttps://doi.org/10.1080/00207160903243148openalex-snapshot
Applying a testing approach to the Calculus of Fair Ambients
inferred← citeshttps://doi.org/10.1109/aswec.2005.8openalex-snapshot
A Process-Based Semantics for Message Sequence Charts with Data
inferred← citeshttps://doi.org/10.1109/fskd.2018.8686998openalex-snapshot
Modeling and Implementation of Distributed Environment Based on Pi-Calculus and Agent
inferred← citeshttps://doi.org/10.1109/lics.1992.185524openalex-snapshot
The lazy lambda calculus in a concurrency scenario
inferred← citeshttps://doi.org/10.1109/lics.1993.287570openalex-snapshot
Typing and subtyping for mobile processes
inferred← citeshttps://doi.org/10.1109/lics.1995.523259openalex-snapshot
Games and full abstraction for the lazy λ-calculus
inferred← citeshttps://doi.org/10.1109/lics.2013.63openalex-snapshot
Abstract Machines for Game Semantics, Revisited
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175686openalex-snapshot
Extensional and Non-extensional Functions as Processes
inferred← citeshttps://doi.org/10.1109/memcod.2011.5970519openalex-snapshot
Function interface models for hardware compilation
inferred← citeshttps://doi.org/10.1109/sccc.1997.636850openalex-snapshot
Software architecture: object vs. process approach
inferred← citeshttps://doi.org/10.1109/tase.2018.00011openalex-snapshot
A Fully Abstract Encoding for Sub Asynchronous Pi Calculus
inferred← citeshttps://doi.org/10.1145/174675.175187openalex-snapshot
A functional theory of local names
inferred← citeshttps://doi.org/10.1145/224164.224189openalex-snapshot
Pi-calculus, dialogue games and full abstraction PCF
inferred← citeshttps://doi.org/10.1145/237721.237805openalex-snapshot
The reflexive CHAM and the join-calculus
inferred← citeshttps://doi.org/10.1145/276393.278524openalex-snapshot
A partially deadlock-free typed process calculus
inferred← citeshttps://doi.org/10.1145/3725421openalex-snapshot
Using Process Calculus for Optimizing Data and Computation Sharing in Complex Stateful Parallel Computations
inferred← citeshttps://doi.org/10.1145/99583.99627openalex-snapshot
The semantic foundations of concurrent constraint programming
inferred← citeshttps://doi.org/10.1162/artl.1993.1.1_2.211openalex-snapshot
Beyond Digital Naturalism
inferred← citeshttps://doi.org/10.23638/lmcs-14(3:11)2018openalex-snapshot
Trees from Functions as Processes
inferred← citeshttps://doi.org/10.23638/lmcs-16(4:16)2020openalex-snapshot
Psi-Calculi Revisited: Connectivity and Compositionality
inferred← citeshttps://doi.org/10.2478/v10006-012-0072-zopenalex-snapshot
The island model as a Markov dynamic system
inferred← citeshttps://doi.org/10.2991/amitp-16.2016.70openalex-snapshot
Research and implementation of the heterogeneous earliest finish time algorithm based on Pi-Calculus
inferred← citeshttps://doi.org/10.2991/iccia-16.2016.62openalex-snapshot
The research and implementation of The Critical Path on a Processor (CPOP) Algorithm based on Pi calculus
inferred← citeshttps://doi.org/10.3233/fi-1994-2043openalex-snapshot
DISTRIBUTIVE EVALUATIONS OF λ-CALCULUS
inferred← citeshttps://doi.org/10.4204/eptcs.166.4openalex-snapshot
An Intensional Concurrent Faithful Encoding of Turing Machines
inferred← citeshttps://doi.org/10.4204/eptcs.189.5openalex-snapshot
Executable Behaviour and the π-Calculus (extended abstract)
inferred← citeshttps://doi.org/10.4204/eptcs.412.2openalex-snapshot
Functional Array Programming in an Extended Pi-Calculus
inferred← citeshttps://doi.org/10.4304/jnw.8.7.1504-1513openalex-snapshot
An Interpretation of Erlang into Value-passing Calculus
inferred← citeshttps://doi.org/10.48550/arxiv.0907.0749openalex-snapshot
Function Interface Models for Hardware Compilation: Types, Signatures, Protocols
inferred← citeshttps://doi.org/10.48550/arxiv.1410.2833openalex-snapshot
On Coupled Logical Bisimulation for the Lambda-Calculus
inferred← citeshttps://doi.org/10.70675/02e964afz3bb1z45dbz99a4z982ee83ecc25openalex-snapshot
On the security of authentication protocols on the web
inferred← citeshttps://doi.org/10.70675/4304aa95z48b6z400az97ebzd9800ded803bopenalex-snapshot
Higher-order languages : dualities and bisimulation enhancements
inferred← citeshttps://doi.org/10.70675/af3542bezb228z4b06za5cfz0ff8a71f328dopenalex-snapshot
Typed Behavioural Equivalences in the Pi-Calculus
inferred← citeshttps://doi.org/10.70675/d1b208b0z61b4z4257z9fc7ze71c0d7c3e37openalex-snapshot
Computing with relations, functions, and bindings
inferred← citeshttps://doi.org/10.70675/e3e2df45z9110z4f8dza99bzbf2dc0e2a9bdopenalex-snapshot
Unique solution techniques for processes and functions
inferred← citeshttps://doi.org/10.7892/boris.104364openalex-snapshot
Piccola - a Small Composition Language
inferred← citeshttps://doi.org/10.7892/boris.104613openalex-snapshot
A Formal Language for Composition
inferred← citeshttps://doi.org/10.7892/boris.104770openalex-snapshot
Components, Scripts, and Glue: A conceptual framework for software composition
inferred← citeshttps://doi.org/10.7892/boris.104772openalex-snapshot
A Metamodel for Concurrent, Object-based Programming
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.