Strong Normalization in the π-calculus with Intersection and Union Types

Authors:
Mauro Piccolo
Affiliations:
Dipartimento di Informatica, Università degli Studi di Torino, Preuve Programmes et Systèmes, Paris VII, France. piccolo@di.unito.it
Venue:
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
Year:
2012

Citing 19
Cited 0

Linear logic

Theoretical Computer Science
Intersection and union types: syntax and semantics

Information and Computation
A symmetric lambda calculus for classical program extraction

Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
On the expressiveness of internal mobility in name-passing calculi

Theoretical Computer Science
Linearity and the pi-calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
A generic type system for the Pi-calculus

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics

Theoretical Computer Science
A type system for lock-free processes

Information and Computation - IFIP TCS2000
Internal Mobility and Agent-Passing Calculi

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Locus Solum: From the rules of logic to the logic of rules

Mathematical Structures in Computer Science
Strong normalisation in the π-calculus

Information and Computation
Towards a Unified Approach to Encodability and Separation Results for Process Calculi

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Sequentiality and the π-calculus

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A deconstruction of non-deterministic classical cut elimination

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Genericity and the π-calculus

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Ludics is a model for the finitary linear pi-calculus

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
PiDuce: a process calculus with native XML datatypes

EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
Encoding CDuce in the Cπ-calculus

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we present an extension of the linear typing discipline for π-calculus, introduced by Yoshida, Honda and Berger, with Intersection and Union Types. We show that we are able to define a typing system for the π-calculus, which guarantees that every well-typed term is strongly normalizing. This typing system is an extension of that presented in [30] since it is able to type more terms than that presented there.