Implicit Polymorphic Type System for the Blue Calculus

The Blue Calculus is a direct extension of both the lambda and the pi calculi. In a preliminary work from Gerard Boudol, a simple type system was given that incorporates Curry's type inference for the lambda-calculus. In the present paper we study an implicit polymorphic type system, adapted from the ML typing discipline. Our typing system enjoys subject reduction and principal type properties and we give results on the complexity for the type inference problem. These are interesting results for the blue calculus as a programming notation for higher-order concurrency.

[1]  Alan Mycroft,et al.  A Polymorphic Type System for Prolog , 1984, Logic Programming Workshop.

[2]  Mark Lillibridge,et al.  Polymorphic type assignment and CPS conversion , 1993, LISP Symb. Comput..

[3]  Cosimo Laneve,et al.  Implicit Typing à la ML for the Join-Calculus , 1997, CONCUR.

[4]  Dominique Clément,et al.  A simple applicative language: mini-ML , 1986, LFP '86.

[5]  Cosimo Laneve,et al.  - Calculus , Multiplicities and the-Calculus , 1995 .

[6]  Cosimo Laneve,et al.  The discriminating power of multiplicities in the-calculus , 1996 .

[7]  Gérard Boudol,et al.  The Lambda-Calculus with Multiplicities (Abstract) , 1993, CONCUR.

[8]  Vasco Thudichum Vasconcelos,et al.  Principal Typing Schemes in a Polyadic pi-Calculus , 1993, CONCUR.

[9]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[10]  Gérard Boudol,et al.  Asynchrony and the Pi-calculus , 1992 .

[11]  Kohei Honda,et al.  Principal Typing Schemes in a Polyadic pi-Calculus , 1993, CONCUR.

[12]  Trevor Jim.  What are principal typings and what are they good for? , 1996, POPL '96.

[13]  F. Cardone,et al.  Two extensions of Curry's type inference system , 1990 .

[14]  Jerzy Tiuryn,et al.  The undecidability of the semi-unification problem , 1990, STOC '90.

[15]  Jean-Jacques Lévy,et al.  A Calculus of Mobile Agents , 1996, CONCUR.

[16]  Gérard Boudol.  The π-calculus in direct style , 1997, POPL '97.

[17]  Fritz Henglein,et al.  Type inference with polymorphic recursion , 1993, TOPL.

[18]  Jerzy Tiuryn,et al.  Type reconstruction in the presence of polymorphic recursion , 1993, TOPL.

[19]  David N. Turner,et al.  The polymorphic Pi-calculus : theory and implementation , 1996 .

[20]  Matthias Felleisen,et al.  A call-by-need lambda calculus , 1995, POPL '95.

[21]  Luca Cardelli,et al.  Typeful Programming , 1989, Formal Description of Programming Concepts.

[22]  Alan Mycroft.  Incremental Polymorphic Type Checking with Update , 1992, LFCS.

[23]  Davide Sangiorgi,et al.  Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[24]  Alan Mycroft,et al.  Polymorphic Type Schemes and Recursive Definitions , 1984, Symposium on Programming.

[25]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[26]  Michele Boreale,et al.  On the Expressiveness of Internal Mobility in Name-Passing Calculi , 1996, Theor. Comput. Sci..

[27]  Xavier Leroy,et al.  Polymorphic typing of an algorithmic language , 1992 .

[28]  Xavier Leroy,et al.  Polymorphism by name for references and continuations , 1993, POPL '93.

[29]  Luca Cardelli,et al.  Operations on Records , 1989, Mathematical Foundations of Programming Semantics.

[30]  Mads Tofte,et al.  Type Inference for Polymorphic References , 1990, Inf. Comput..

[31]  Luís Damas,et al.  Type assignment in programming languages , 1984 .

[32]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[33]  Didier Rémy,et al.  Type inference for records in natural extension of ML , 1994 .