Functions as processes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 177812 (Why is no real title available?)
- Algebraic laws for nondeterminism and concurrency
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Fully abstract models of typed \(\lambda\)-calculi
- Linear logic
- The Mechanical Evaluation of Expressions
- The lambda calculus, its syntax and semantics
Cited in
(only showing first 100 items - show all)- Compositional reversible computation
- On the expressiveness of internal mobility in name-passing calculi
- Towards a theory of (self) applicative communicating processes: A short note
- A theory of bisimulation for the -calculus
- scientific article; zbMATH DE number 177812 (Why is no real title available?)
- Structural recursion with locally scoped names
- scientific article; zbMATH DE number 7447733 (Why is no real title available?)
- On the computational power of BlenX
- Mobile ambients
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- Linearity and bisimulation
- A two-level logic approach to reasoning about computations
- The -calculus in the -calculus
- On the expressiveness of internal mobility in name-passing calculi
- Distinguishing and relating higher-order and first-order processes by expressiveness
- Processes and games
- Divergence and unique solution of equations
- The name discipline of uniform receptiveness (extended abstract)
- scientific article; zbMATH DE number 1392315 (Why is no real title available?)
- From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
- scientific article; zbMATH DE number 7204939 (Why is no real title available?)
- Topological models for higher order control flow
- Variations on mobile processes
- A calculus of global interaction based on session types
- A taxonomy of process calculi for distribution and mobility
- On the semantics of durational actions
- On reduction-based process semantics
- Symmetries and Dualities in Name-Passing Process Calculi
- Extensional and non-extensional functions as processes
- Continuation-based transformations for coordination languages
- Self-similarity breeds resilience
- System \(F^\mu_\omega\) with context-free session types
- Non-deterministic structures of computation
- Theory of interaction
- Systemic yoyo structure in human thoughts and the fourth crisis in mathematics
- Locality and interleaving semantics in calculi for mobile processes
- A multiset semantics for the pi-calculus with replication
- πI: A symmetric calculus based on internal mobility
- Molecular interaction.
- Perpetuality and uniform normalization in orthogonal rewrite systems
- Understanding the mismatch combinator in chi calculus
- A spatial logic for concurrency. I
- Structural inclusion in the pi-calculus with replication
- Using -calculus names as locks
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
- Evaluating functions as processes
- Reversibility in the higher-order \(\pi\)-calculus
- An exact correspondence between a typed pi-calculus and polarised proof-nets
- Game theoretic analysis of call-by-value computation
- scientific article; zbMATH DE number 1735902 (Why is no real title available?)
- On the concurrent computational content of intermediate logics
- Communication errors in the \(\pi\)-calculus are undecidable
- Functions as session-typed processes
- Genericity and the \(\pi\)-calculus
- Multisets and structural congruence of the pi-calculus with replication
- The rewriting logic semantics project
- On the relative expressive power of calculi for mobility
- Graph types for monadic mobile processes
- Declarative event based models of concurrency and refinement in psi-calculi
- scientific article; zbMATH DE number 7449992 (Why is no real title available?)
- On the expressiveness of interaction
- The \(C_\pi\)-calculus: a model for confidential name passing
- Mobile ambients
- The conflict-free reduction geometry
- A rewriting logic approach to operational semantics
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi
- Rewriting logic as a semantic framework for concurrency: a progress report
- Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators
- Divergence and unique solution of equations
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi
- Asynchronous process calculi: The first- and higher-order paradigms
- Trees from functions as processes
- Explicit fusions
- An exercise in structural congruence
- On parameterization of higher-order processes
- A foundation for higher-order concurrent constraint programming
- From rewrite rules to bisimulation congruences
- On bisimulations for the asynchronous -calculus
- Constraints as processes
- Eager functions as processes
- Fundamentals of session types
- The calculus of context-aware ambients
- An investigation into functions as processes
- From computing to interaction: on the expressiveness of asynchronous pi-calculus
- Eager functions as processes
- Linear logic propositions as session types
- Concurrency and knowledge-level communication in agent languages
- Game-theoretic analysis of call-by-value computation
- A functional presentation of pi calculus
- A proof theoretical approach to communication
- Comparing the expressiveness of the \(\pi \)-calculus and CCS
- Trees from functions as processes
- Towards a unified approach to encodability and separation results for process calculi
- On hierarchical communication topologies in the -calculus
- A calculus for cryptographic protocols: The spi calculus
- An interpretation of typed objects into typed -calculus
- Characteristic bisimulation for higher-order session processes
- Retracing some paths in process algebra
- On the validity of encodings of the synchronous in the asynchronous -calculus
- A typed parallel -calculus via 1-depth intermediate proofs
This page was built for publication: Functions as processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017458)
