On the public citation graph
Plain CHOCS A second generation calculus for higher order processes
0 signed · 137 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.1006/inco.1991.9999openalex-snapshot
A domain equation for bisimulation
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-16047-7_49openalex-snapshot
Syntax and informal semantics of DyNe, a parallel language
inferredcites →https://doi.org/10.1007/3-540-17660-8_55openalex-snapshot
SMoLCS-driven concurrent calculi
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/3-540-51285-3_52openalex-snapshot
The typed λ-calculus with first-class processes
inferredcites →https://doi.org/10.1007/3-540-54415-1_63openalex-snapshot
π-Calculus semantics of object-oriented programming languages
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0032073openalex-snapshot
Operational and algebraic semantics for facile: A symmetric integration of concurrent and functional programming
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0890-5401(90)90048-mopenalex-snapshot
Bisimulation and divergence
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1145/75277.75290openalex-snapshot
A calculus of higher order communicating systems
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
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.1006/inco.1998.2723openalex-snapshot
Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing
inferred← citeshttps://doi.org/10.1006/inco.1999.2825openalex-snapshot
Tile Formats for Located and Mobile Systems
inferred← citeshttps://doi.org/10.1006/inco.2000.3058openalex-snapshot
Language-based Performance Prediction for Distributed and Mobile Systems
inferred← citeshttps://doi.org/10.1007/11590156_11openalex-snapshot
Extending Howe’s Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names
inferred← citeshttps://doi.org/10.1007/11690634_5openalex-snapshot
More on Bisimulations for Higher Order π-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_31openalex-snapshot
Concurrent Constraint Programming with Process Mobility
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_11openalex-snapshot
Mobile Processes: A Commented Bibliography
inferred← citeshttps://doi.org/10.1007/3-540-47959-7_3openalex-snapshot
Seal: A Framework for Secure Mobile Computations
inferred← citeshttps://doi.org/10.1007/3-540-49253-4_17openalex-snapshot
A Synergy Between Model-Checking and Type Inference for the Verification of Value-Passing Higher-Order Processes
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_9openalex-snapshot
On the reduction of chocs bisimulation to π-calculus bisimulation
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_5openalex-snapshot
Graph-grammar semantics of a higher-order programming language for distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_196openalex-snapshot
Reasoning about higher-order processes
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_43openalex-snapshot
From a concurrent λ-calculus to the π-calculus
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_90openalex-snapshot
Process specification and verification
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/3-540-61604-7_52openalex-snapshot
On transformations of concurrent object programs
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_187openalex-snapshot
The name discipline of uniform receptiveness (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_189openalex-snapshot
A proof theoretical approach to communication
inferred← citeshttps://doi.org/10.1007/978-3-030-50029-0_9openalex-snapshot
GoPi: Compiling Linear and Static Channels in Go
inferred← citeshttps://doi.org/10.1007/978-3-319-08260-8_9openalex-snapshot
On the Expressiveness of Parameterization in Process-Passing
inferred← citeshttps://doi.org/10.1007/978-3-540-40042-4_2openalex-snapshot
Reflecting Mobile Ambients into the π-Calculus
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-540-79124-9_4openalex-snapshot
Equivalence Checking for a Finite Higher Order π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_19openalex-snapshot
Normal Bisimulations in Calculi with Passivation
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_10openalex-snapshot
On the Expressiveness of Forwarding in Higher-Order Communication
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_30openalex-snapshot
Howe’s Method for Calculi with Passivation
inferred← citeshttps://doi.org/10.1007/978-3-642-04856-2_10openalex-snapshot
On Bisimulation Theory in Linear Higher-Order π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_28openalex-snapshot
Model Independent Order Relations for Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-39698-4_11openalex-snapshot
The Value-Passing Calculus
inferred← citeshttps://doi.org/10.1007/978-3-662-49498-1_18openalex-snapshot
On the Relative Expressiveness of Higher-Order Session Processes
inferred← citeshttps://doi.org/10.1007/978-94-011-0187-5_4openalex-snapshot
Towards a Theory of Strong Bisimulation for the Service Rendezvous
inferred← citeshttps://doi.org/10.1007/bf02943490openalex-snapshot
A formal semantics for DAI language NUML
inferred← citeshttps://doi.org/10.1007/bfb0026984openalex-snapshot
Presheaf models for the π-calculus
inferred← citeshttps://doi.org/10.1007/bfb0028018openalex-snapshot
Full abstractness for a functional/concurrent language with higher-order value-passing
inferred← citeshttps://doi.org/10.1007/bfb0029949openalex-snapshot
A tile-based coordination view of asynchronous π-calculus
inferred← citeshttps://doi.org/10.1007/bfb0030604openalex-snapshot
Modal characterization of weak bisimulation for higher-order processes
inferred← citeshttps://doi.org/10.1007/s00165-020-00524-1openalex-snapshot
On the Interactive Power of Higher-order Processes Extended with Parameterization
inferred← citeshttps://doi.org/10.1007/s00236-005-0168-0openalex-snapshot
π-calculus with noisy channels
inferred← citeshttps://doi.org/10.1007/s00236-012-0168-9openalex-snapshot
Distinguishing and relating higher-order and first-order processes by expressiveness
inferred← citeshttps://doi.org/10.1007/s00236-016-0289-7openalex-snapshot
Characteristic bisimulation for higher-order session processes
inferred← citeshttps://doi.org/10.1007/s002360050094openalex-snapshot
Algebraic computational models of OR-parallel execution of Prolog
inferred← citeshttps://doi.org/10.1007/s11390-009-9210-yopenalex-snapshot
Expressing First-Order π-Calculus in Higher-Order Calculus of Communicating Systems
inferred← citeshttps://doi.org/10.1007/s12204-014-1554-yopenalex-snapshot
A logical characterization for linear higher-order processes
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50026-6openalex-snapshot
An Introduction to the π-Calculus
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50033-3openalex-snapshot
Process Algebras with Localities
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.11.033openalex-snapshot
A CPS Encoding of Name-Passing in Higher-Order Mobile Embedded Resources
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.03.029openalex-snapshot
Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.09.032openalex-snapshot
A Congruence Format for Name-passing Calculi
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.09.011openalex-snapshot
Modelling the Security of Smart Cards by Hard and Soft Types for Higher-Order Mobile Embedded Resources
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.06.016openalex-snapshot
Decidable Fragments of a Higher Order Calculus with Locations
inferred← citeshttps://doi.org/10.1016/j.ic.2005.03.002openalex-snapshot
Notions of bisimulation and congruence formats for SOS with data
inferred← citeshttps://doi.org/10.1016/j.ic.2010.10.001openalex-snapshot
On the expressiveness and decidability of higher-order process calculi
inferred← citeshttps://doi.org/10.1016/j.ic.2011.08.002openalex-snapshot
Characterizing contextual equivalence in calculi with passivation
inferred← citeshttps://doi.org/10.1016/j.ic.2019.06.002openalex-snapshot
On the relative expressiveness of higher-order session processes
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104892openalex-snapshot
Fairness and communication-based semantics for session-typed languages
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105190openalex-snapshot
A generic type system for higher-order Ψ-calculi
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.02.006openalex-snapshot
A CPS encoding of name-passing in Higher-order mobile embedded resources
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.04.014openalex-snapshot
More on bisimulations for higher order π -calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00093-1openalex-snapshot
Names of the π-calculus agents handled locally
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00097-9openalex-snapshot
Asynchronous process calculi: the first- and higher-order paradigms
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00281-4openalex-snapshot
A fully abstract denotational semantics for the calculus of higher-order communicating systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00378-9openalex-snapshot
Recursive equations in higher-order process calculi
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00202-0openalex-snapshot
Tau laws for pi calculus
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(97)00222-3openalex-snapshot
On transformations of concurrent-object programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00037-7openalex-snapshot
Variations on mobile processes
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00040-7openalex-snapshot
The name discipline of uniform receptiveness
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)80003-6openalex-snapshot
Non-interleaving semantics for mobile processes
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00061-0openalex-snapshot
Bisimulation congruence of chi calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80201-4openalex-snapshot
Linear Types for Higher Order Processes with First Class Directed Channels
inferred← citeshttps://doi.org/10.1017/s0960129511000260openalex-snapshot
The λ-calculus in the π-calculus
inferred← citeshttps://doi.org/10.1023/a:1019219916118openalex-snapshot
A survey of theories for mobile agents
inferred← citeshttps://doi.org/10.1051/ita/2019005openalex-snapshot
Parameterizing higher-order processes on names and processes
inferred← citeshttps://doi.org/10.1051/ita/2025021openalex-snapshot
On bisimulation in absence of restriction
inferred← citeshttps://doi.org/10.1080/00207160.2016.1210793openalex-snapshot
On parameterization of higher-order processes
inferred← citeshttps://doi.org/10.1109/32.962559openalex-snapshot
Performance evaluation of mobile processes via abstract machines
inferred← citeshttps://doi.org/10.1109/csie.2009.261openalex-snapshot
Distributed Viewpoint Equivalences for Higher Order Processes
inferred← citeshttps://doi.org/10.1109/iccl.1994.288384openalex-snapshot
Semantics for a real-time object-oriented programming language
inferred← citeshttps://doi.org/10.1109/itcs.2009.275openalex-snapshot
Branching Bisimulations for Higher Order p-Calculus
inferred← citeshttps://doi.org/10.1109/lics.1998.705658openalex-snapshot
A theory of recursive domains with applications to concurrency
inferred← citeshttps://doi.org/10.1109/lics.2007.17openalex-snapshot
Environmental Bisimulations for Higher-Order Languages
inferred← citeshttps://doi.org/10.1109/lics.2008.8openalex-snapshot
On the Expressiveness and Decidability of Higher-Order Process Calculi
inferred← citeshttps://doi.org/10.1109/tase.2010.17openalex-snapshot
Bisimulations for Open Processes in Higher Order p-Calculus
inferred← citeshttps://doi.org/10.1109/tase.2013.36openalex-snapshot
Normal Bisimulation for Higher Order Pi-Calculus with Unguarded Choice
inferred← citeshttps://doi.org/10.1109/tase.2014.15openalex-snapshot
Normal Bisimulation for Higher Order Pi-Calculus with Unguarded Choice
inferred← citeshttps://doi.org/10.1145/1889997.1890002openalex-snapshot
Environmental bisimulations for higher-order languages
inferred← citeshttps://doi.org/10.1145/242224.242297openalex-snapshot
Programming languages, analysis tools, and concurrency theory
inferred← citeshttps://doi.org/10.1145/2603088.2603113openalex-snapshot
On the discriminating power of passivation and higher-order interaction
inferred← citeshttps://doi.org/10.1145/571157.571159openalex-snapshot
Towards a primitive higher order calculus of broadcasting systems
inferred← citeshttps://doi.org/10.1515/vzoo-2015-0010openalex-snapshot
A New Species Of Testate Amoebae Of The Genus Difflugia From The Freshwaters Of Azerbaijan (Rhizopoda, Testacea, Difflugiidae)
inferred← citeshttps://doi.org/10.4204/eptcs.131.5openalex-snapshot
On Context Bisimulation for Parameterized Higher-order Processes
inferred← citeshttps://doi.org/10.4204/eptcs.189.10openalex-snapshot
On the Computation Power of Name Parameterization in Higher-order Processes
inferred← citeshttps://doi.org/10.4204/eptcs.222.2openalex-snapshot
Higher-order Processes with Parameterization over Names and Processes
inferred← citeshttps://doi.org/10.4204/eptcs.339.8openalex-snapshot
On Decidability of the Bisimilarity on Higher-order Processes with Parameterization
inferred← citeshttps://doi.org/10.4204/eptcs.368.3openalex-snapshot
A Generic Type System for Higher-Order Ψ-calculi
inferred← citeshttps://doi.org/10.4230/lipics.concur.2015.212openalex-snapshot
Howe's Method for Contextual Semantics
inferred← citeshttps://doi.org/10.4230/lipics.concur.2015.398openalex-snapshot
Characteristic Bisimulation for Higher-Order Session Processes
inferred← citeshttps://doi.org/10.48456/tr-492openalex-snapshot
Nomadic Pict: language and infrastructure design for mobile computation
inferred← citeshttps://doi.org/10.48550/arxiv.1011.2896openalex-snapshot
Reducing Higher Order Pi-Calculus to Spatial Logics
inferred← citeshttps://doi.org/10.48550/arxiv.1602.06221openalex-snapshot
Endofunctors modelling higher-order behaviours
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0601014openalex-snapshot
Probabilistic bisimilarities between quantum processes
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/2285openalex-snapshot
Higher-Order Concurrency: Expressiveness and Decidability Results
inferred← citeshttps://doi.org/10.6100/ir594899openalex-snapshot
Structuring structural operational semantics
inferred← citeshttps://doi.org/10.7146/brics.v4i35.18961openalex-snapshot
A Theory of Recursive Domains with Applications to Concurrency
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.