Strong normalisation in the -calculus
From MaRDI portal
Recommendations
- Strong normalization in the \(\pi \)-calculus with intersection and union types
- scientific article; zbMATH DE number 2163051
- scientific article; zbMATH DE number 1088033
- Proving strong normalisation via non-deterministic translations into Klop's extended lambda-calculus
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
Cites work
- scientific article; zbMATH DE number 1722647 (Why is no real title available?)
- scientific article; zbMATH DE number 1722658 (Why is no real title available?)
- scientific article; zbMATH DE number 2185660 (Why is no real title available?)
- scientific article; zbMATH DE number 954809 (Why is no real title available?)
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 108365 (Why is no real title available?)
- scientific article; zbMATH DE number 108434 (Why is no real title available?)
- scientific article; zbMATH DE number 3523519 (Why is no real title available?)
- scientific article; zbMATH DE number 1223739 (Why is no real title available?)
- scientific article; zbMATH DE number 1324438 (Why is no real title available?)
- scientific article; zbMATH DE number 555217 (Why is no real title available?)
- scientific article; zbMATH DE number 1956508 (Why is no real title available?)
- scientific article; zbMATH DE number 1927554 (Why is no real title available?)
- scientific article; zbMATH DE number 1512624 (Why is no real title available?)
- scientific article; zbMATH DE number 1538026 (Why is no real title available?)
- scientific article; zbMATH DE number 1754606 (Why is no real title available?)
- scientific article; zbMATH DE number 1759483 (Why is no real title available?)
- scientific article; zbMATH DE number 2087446 (Why is no real title available?)
- scientific article; zbMATH DE number 1398002 (Why is no real title available?)
- A calculus of communicating systems
- A calculus of mobile processes. II
- A complete proof of correctness of the Knuth-Bendix completion algorithm
- A generic type system for the \(\pi\)-calculus
- A uniform type structure for secure information flow
- Computational interpretations of linear logic
- Full abstraction for PCF
- Functions as processes
- Game-theoretic analysis of call-by-value computation
- Games and full completeness for multiplicative linear logic
- Intensional interpretations of functionals of finite type I
- Linear logic
- On full abstraction for PCF: I, II and III
- On reduction-based process semantics
- On the \(\pi\)-calculus and linear logic
- On the expressiveness of internal mobility in name-passing calculi
- PLAN: a packet language for active networks
- Proofs as processes
- Some congruence properties for \(\pi\)-calculus bisimilarities
- Strong normalisation of cut-elimination in classical logic
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The name discipline of uniform receptiveness
- Types as models: model checking message-passing programs
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
Cited in
(39)- Formalising Java RMI with explicit code mobility
- An exact correspondence between a typed pi-calculus and polarised proof-nets
- Genericity and the \(\pi\)-calculus
- Divergence and unique solution of equations
- Termination in higher-order concurrent calculi
- Mobile Processes and Termination
- Typed event structures and the linear \(\pi \)-calculus
- Static Livelock Analysis in CSP
- Eager functions as processes
- Interpreting a finitary pi-calculus in differential interaction nets
- Termination in a \(\pi\)-calculus with subtyping
- Probabilistic \(\pi\)-calculus and event structures
- Characteristic bisimulation for higher-order session processes
- Behavioural equivalences for dynamic web data
- Conflation confers concurrency
- Strong normalization in the \(\pi \)-calculus with intersection and union types
- Safe session-based concurrency with shared linear state
- A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types
- Uniform strong normalization for multi-discipline calculi
- Full abstraction in a subtyped pi-calculus with linear types
- On the potential advantages of exploiting behavioural information for contract-based service discovery and composition
- scientific article; zbMATH DE number 2080223 (Why is no real title available?)
- Corecursion and non-divergence in session-typed processes
- A Process-Model for Linear Programs
- Linear logical relations and observational equivalences for session-based concurrency
- Ensuring termination by typability
- Strong normalization of \(\mathsf{ML}^{\mathsf F}\) via a calculus of coercions
- Type-based security for mobile computing integrity, secrecy and liveness
- On the relative expressiveness of higher-order session processes
- On the relative expressiveness of higher-order session processes
- Strong normalization of barrecursive terms without using infinite terms
- Termination Analysis for the $$\pi $$-Calculus by Reduction to Sequential Program Termination
- Responsiveness in process calculi
- Typing termination in a higher-order concurrent imperative language
- Linearity and bisimulation
- Divergence and unique solution of equations
- Partial Orders, Event Structures and Linear Strategies
- The true concurrency of differential interaction nets
- A type system for lock-free processes
This page was built for publication: Strong normalisation in the \(\pi\)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598201)
