Ensuring termination by typability

DOI10.1016/J.IC.2006.03.002MaRDI QIDQ2500473zbMATH OpenOpenAlexFDO

Authors Davide Sangiorgi, Yuxin Deng

Publication date 16 August 2006

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2006.03.002

zbMATH Keywords

\(\pi\)-calculusterm rewriting techniquesterminationtypes

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 2163050
• Termination in a \(\pi\)-calculus with subtyping
• Termination in a -calculus with subtyping
• scientific article; zbMATH DE number 1927554
• Termination Analysis for the \pi -Calculus by Reduction to Sequential Program Termination

Cites work

• An introduction to the -calculus.
• Functions as processes
• scientific article; zbMATH DE number 3692636 (Why is no real title available?)
• scientific article; zbMATH DE number 3735770 (Why is no real title available?)
• scientific article; zbMATH DE number 3485174 (Why is no real title available?)
• scientific article; zbMATH DE number 1296290 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1956508 (Why is no real title available?)
• scientific article; zbMATH DE number 2061702 (Why is no real title available?)
• scientific article; zbMATH DE number 2163050 (Why is no real title available?)
• scientific article; zbMATH DE number 2090726 (Why is no real title available?)
• Natural termination
• Proving termination with multiset orderings
• Strong normalisation in the \(\pi\)-calculus
• Termination of processes
• The -calculus: A theory of mobile processes
• The typed lambda-calculus is not elementary recursive
• Type-based information flow analysis for the \(\pi\)-calculus
• What is a ``good encoding of guarded choice?

Cited in

(17)

• Dependent types for program termination verification
• Causal computational complexity of distributed processes
• On hierarchical communication topologies in the -calculus
• Termination in a -calculus with subtyping
• Decision Procedures for Automating Termination Proofs
• Typed ψ-calculi
• Mobile Processes and Termination
• Termination in higher-order concurrent calculi
• scientific article; zbMATH DE number 1927554 (Why is no real title available?)
• scientific article; zbMATH DE number 1543354 (Why is no real title available?)
• scientific article; zbMATH DE number 2163050 (Why is no real title available?)
• Termination in a \(\pi\)-calculus with subtyping
• Logic Programming
• Divergence and unique solution of equations
• Termination Analysis for the \pi -Calculus by Reduction to Sequential Program Termination
• Termination in higher-order concurrent calculi
• Typing termination in a higher-order concurrent imperative language

This page was built for publication: Ensuring termination by typability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500473)