The following pages link to Functions as processes (Q4017458):
Displaying 50 items.
- Reversibility in the higher-order \(\pi\)-calculus (Q264996) (← links)
- Declarative event based models of concurrency and refinement in psi-calculi (Q272301) (← links)
- Structural congruence for bialgebraic semantics (Q338626) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- A taxonomy of process calculi for distribution and mobility (Q660996) (← links)
- \(\pi\)-calculus, internal mobility, and agent-passing calculi (Q671684) (← links)
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
- Locality and interleaving semantics in calculi for mobile processes (Q672123) (← links)
- A multiset semantics for the pi-calculus with replication (Q672867) (← links)
- Fundamentals of session types (Q714736) (← links)
- The calculus of context-aware ambients (Q716296) (← links)
- An exercise in structural congruence (Q845877) (← links)
- A pi-calculus based semantics for WS-BPEL (Q861305) (← links)
- A functional presentation of pi calculus (Q865929) (← links)
- The rewriting logic semantics project (Q877024) (← links)
- Fair ambients (Q877172) (← links)
- Theory of interaction (Q896903) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- An exact correspondence between a typed pi-calculus and polarised proof-nets (Q974114) (← links)
- Linearity and bisimulation (Q997996) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- On the computational power of BlenX (Q1044845) (← links)
- An interpretation of typed objects into typed \(\pi\)-calculus (Q1271311) (← links)
- Multisets and structural congruence of the pi-calculus with replication (Q1274455) (← links)
- Concurrency and knowledge-level communication in agent languages (Q1274547) (← links)
- On the expressiveness of internal mobility in name-passing calculi (Q1276243) (← links)
- On bisimulations for the asynchronous \(\pi\)-calculus (Q1276246) (← links)
- A calculus for cryptographic protocols: The spi calculus (Q1283776) (← links)
- On reduction-based process semantics (Q1350347) (← links)
- On the decidability of process equivalences for the \(\pi\)-calculus (Q1391099) (← links)
- Continuation-based transformations for coordination languages (Q1575149) (← links)
- Mobile ambients (Q1575154) (← links)
- On the semantics of the call-by-name CPS transform (Q1575687) (← links)
- Asynchronous process calculi: The first- and higher-order paradigms (Q1589656) (← links)
- Communication errors in the \(\pi\)-calculus are undecidable (Q1606997) (← links)
- On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus (Q1641151) (← links)
- An object based algebra for specifying a fault tolerant software architecture (Q1779322) (← links)
- Molecular interaction. (Q1853559) (← links)
- Understanding the mismatch combinator in chi calculus (Q1853614) (← links)
- Decoding choice encodings (Q1854385) (← links)
- Perpetuality and uniform normalization in orthogonal rewrite systems (Q1854401) (← links)
- Secure implementation of channel abstractions (Q1854520) (← links)
- Modelling biochemical pathways through enhanced \(\pi\)-calculus (Q1884867) (← links)
- A spatial logic for concurrency. I (Q1887152) (← links)
- A theory of bisimulation for the \(\pi\)-calculus (Q1901699) (← links)
- Distinguishing and relating higher-order and first-order processes by expressiveness (Q1935453) (← links)
- Towards a unified approach to encodability and separation results for process calculi (Q1959439) (← links)
- Variations on mobile processes (Q1960530) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- The name discipline of uniform receptiveness (Q1960533) (← links)
