Functions as processes
From MaRDI portal
Recommendations
Cites work
- Algebraic laws for nondeterminism and concurrency
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Fully abstract models of typed \(\lambda\)-calculi
- scientific article; zbMATH DE number 177812 (Why is no real title available?)
- Linear logic
- The lambda calculus, its syntax and semantics
- The Mechanical Evaluation of Expressions
Cited in
(only showing first 100 items - show all)- A rewriting logic approach to operational semantics
- On the computational power of BlenX
- An interpretation of typed objects into typed -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 -calculus
- A calculus for cryptographic protocols: The spi calculus
- On reduction-based process semantics
- On the decidability of process equivalences for the \(\pi\)-calculus
- Continuation-based transformations for coordination languages
- Mobile ambients
- On the semantics of the call-by-name CPS transform
- Asynchronous process calculi: The first- and higher-order paradigms
- Communication errors in the \(\pi\)-calculus are undecidable
- On the validity of encodings of the synchronous in the asynchronous -calculus
- An object based algebra for specifying a fault tolerant software architecture
- 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
- Modelling biochemical pathways through enhanced -calculus
- A spatial logic for concurrency. I
- A theory of bisimulation for the -calculus
- Distinguishing and relating higher-order and first-order processes by expressiveness
- 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
- On the concurrent computational content of intermediate logics
- The \(C_\pi\)-calculus: a model for confidential name passing
- Mixed sessions
- A thesis for interaction
- Eager functions as processes
- Replacement freeness: a criterion for separating process calculi
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
- Characteristic bisimulation for higher-order session processes
- Linear forwarders
- A two-level logic approach to reasoning about computations
- Ensuring termination by typability
- Explicit fusions
- Genericity and the \(\pi\)-calculus
- The conflict-free reduction geometry
- Reversing algebraic process calculi
- Reversibility in the higher-order \(\pi\)-calculus
- Declarative event based models of concurrency and refinement in psi-calculi
- On hierarchical communication topologies in the -calculus
- On the relative expressive power of calculi for mobility
- A first-order syntax for the -calculus in Isabelle/HOL using permutations
- Processes and games
- From computing to interaction: on the expressiveness of asynchronous pi-calculus
- A calculus of global interaction based on session types
- Functions as session-typed processes
- Mobile ambients
- Symmetries and Dualities in Name-Passing Process Calculi
- Linear lambda calculus and deep inference
- Structural recursion with locally scoped names
- Full abstraction in a subtyped pi-calculus with linear types
- The -calculus in the -calculus
- Linear is CP (more or less)
- Trees from functions as processes
- Classical proofs as parallel programs
- Comparing process calculi using encodings
- Structural congruence for bialgebraic semantics
- Evaluating functions as processes
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi
- Session-Based Communication Optimisation for Higher-Order Mobile Processes
- A Process-Model for Linear Programs
- Systemic yoyo structure in human thoughts and the fourth crisis in mathematics
- scientific article; zbMATH DE number 177812 (Why is no real title available?)
- scientific article; zbMATH DE number 1735902 (Why is no real title available?)
- Affine sessions
- 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
- Trees from functions as processes
- scientific article; zbMATH DE number 1392315 (Why is no real title available?)
- On parameterization of higher-order processes
- Self-similarity breeds resilience
- Rast: a language for resource-aware session types
- Mixed sessions
- From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
- From a concurrent λ-calculus to the π-calculus
- A Fresh Look at the λ-Calculus
- A foundation for higher-order concurrent constraint programming
- On the decidability of process equivalences for the \(\pi\)-calculus
- πI: A symmetric calculus based on internal mobility
- Divergence and unique solution of equations
- scientific article; zbMATH DE number 7204939 (Why is no real title available?)
- Eager functions as processes
- Divergence and unique solution of equations
- Computability structures, simulations and realizability
- Non-deterministic structures of computation
- Linearity, session types and the pi calculus
- Linear logic propositions as session types
- The \(\pi\)-calculus is behaviourally complete and orbit-finitely executable
- Topological models for higher order control flow
- An investigation into functions as processes
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)
