Proofs and types
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Strong normalisation in the π-calculus
Information and Computation
Mathematical Structures in Computer Science
Ensuring termination by typability
Information and Computation
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
On the complexity of termination inference for processes
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Fair cooperative multithreading: typing termination in a higher-order concurrent imperative language
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Strong normalisation in λ-calculi with references
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
| Hi-index | 0.00 |
An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it possible to combine term rewriting measure-based techniques with traditional approaches for termination in functional languages such as logical relations. The method can be made parametric on the termination technique employed on the functional part; it can also be iterated. We illustrate the method in the case of a π-calculus with both functional and imperative names, and show that, with respect to previous approaches to termination, it allows us to extend considerably the set of processes that can be handled. The method can also be applied to sequential languages, e.g., λ-calculi with references.