Skip to Main content Skip to Navigation
New interface
Conference papers

JOIN(X): Constraint-Based Type Inference for the Join-Calculus

Abstract : We present a generic constraint-based type system for the join-calculus. The key issue is type generalization, which, in the presence of concurrency, must be restricted. We first define a liberal generalization criterion, and prove it correct. Then, we find that it hinders type inference, and propose a cruder one, reminiscent of ML's value restriction. We establish type safety using a semi-syntactic technique, which we believe is of independent interest. It consists in interpreting typing judgements as (sets of) judgements in an underlying system, which itself is given a syntactic soundness proof. This hybrid approach allows giving pleasant logical meaning to high-level notions such as type variables, constraints and generalization, and clearly separating them from low-level aspects (substitution lemmas, etc.), which are dealt with in a simple, standard way.
Document type :
Conference papers
Complete list of metadata
Contributor : François Pottier Connect in order to contact the contributor
Submitted on : Monday, May 16, 2005 - 10:01:37 AM
Last modification on : Thursday, February 3, 2022 - 11:14:17 AM
Long-term archiving on: : Thursday, April 1, 2010 - 9:28:19 PM


  • HAL Id : inria-00000029, version 1



Sylvain Conchon, François Pottier. JOIN(X): Constraint-Based Type Inference for the Join-Calculus. Proceedings of the 10th European Symposium on Programming (ESOP'01), Apr 2001, Genova, pp.221--236. ⟨inria-00000029⟩



Record views


Files downloads