The following pages link to Functions as processes (Q4017458):
Displaying 50 items.
- On the concurrent computational content of intermediate logics (Q1989344) (← links)
- The \(C_\pi\)-calculus: a model for confidential name passing (Q1996859) (← links)
- Mixed sessions (Q2055956) (← links)
- A thesis for interaction (Q2055962) (← links)
- Eager functions as processes (Q2123050) (← links)
- Replacement freeness: a criterion for separating process calculi (Q2210864) (← links)
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus (Q2343135) (← links)
- Characteristic bisimulation for higher-order session processes (Q2357655) (← links)
- Linear forwarders (Q2384926) (← links)
- A two-level logic approach to reasoning about computations (Q2392484) (← links)
- Ensuring termination by typability (Q2500473) (← links)
- Explicit fusions (Q2566040) (← links)
- Genericity and the \(\pi\)-calculus (Q2576663) (← links)
- The conflict-free reduction geometry (Q2581368) (← links)
- Reversing algebraic process calculi (Q2643334) (← links)
- On Hierarchical Communication Topologies in the $$\pi $$ -calculus (Q2802475) (← links)
- On the Relative Expressive Power of Calculi for Mobility (Q2805161) (← links)
- A First-Order Syntax for the π-Calculus in Isabelle/HOL using Permutations (Q2841231) (← links)
- (Q2851048) (← links)
- FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS (Q2856009) (← links)
- A Calculus of Global Interaction based on Session Types (Q2864218) (← links)
- (Q2906944) (← links)
- Symmetries and Dualities in Name-Passing Process Calculi (Q2944898) (← links)
- Linear Lambda Calculus and Deep Inference (Q3007666) (← links)
- Structural recursion with locally scoped names (Q3016213) (← links)
- Full Abstraction in a Subtyped pi-Calculus with Linear Types (Q3090836) (← links)
- The λ-calculus in the π-calculus (Q3094164) (← links)
- Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less) (Q3188293) (← links)
- (Q3384877) (← links)
- (Q3385647) (← links)
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi (Q3541040) (← links)
- Session-Based Communication Optimisation for Higher-Order Mobile Processes (Q3637196) (← links)
- A Process-Model for Linear Programs (Q3638259) (← links)
- Systemic yoyo structure in human thoughts and the fourth crisis in mathematics (Q3639466) (← links)
- (Q4558783) (← links)
- Game theoretic analysis of call-by-value computation (Q4571955) (← links)
- The name discipline of uniform receptiveness (extended abstract) (Q4571962) (← links)
- A proof theoretical approach to communication (Q4571964) (← links)
- The geometry of orthogonal reduction spaces (Q4571994) (← links)
- Trees from Functions as Processes (Q4585071) (← links)
- On parameterization of higher-order processes (Q4976336) (← links)
- (Q5015358) (← links)
- (Q5028463) (← links)
- Mixed Sessions (Q5041119) (← links)
- From π-calculus to higher-order π-calculus — and back (Q5044732) (← links)
- From a concurrent λ-calculus to the π-calculus (Q5055881) (← links)
- A Fresh Look at the λ-Calculus (Q5089000) (← links)
- A foundation for higher-order concurrent constraint programming (Q5096300) (← links)
- On the decidability of process equivalences for the π-calculus (Q5096384) (← links)
- πI: A symmetric calculus based on internal mobility (Q5096730) (← links)
