A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Ensuring Termination by Typability
[chapter]
IFIP International Federation for Information Processing
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtained by successive refinements of the types of the simply typed π-calculus. For all (but one of) the type systems we also present upper bounds to the number of steps well-typed processes take to terminate. The termination proofs use techniques from term rewriting systems. We show the usefulness of the type systems on
doi:10.1007/1-4020-8141-3_47
dblp:conf/ifipTCS/DengS04
fatcat:udmnjjdxgvfdrnrsianpmyelb4