(Enter summary)
Abstract: The Blue Calculus is a direct extension of both the lambda and the pi calculi. In a preliminary work from Gérard 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... (Update)
Context of citations to this paper: More
...calculus. Compared with [19] it has no choice or matching operators. Moreover, we consider in this report a variant already used in [10], such that the usage of names is restricted to forbid declarations on a received channel: that is only the output capability of names may...
...: with recursive types. Development of the work presented here are being conducted at the moment. For example, using result obtained on [10], we have defined a polymorphic type system a la ML for our object calculus. There is also ongoing work aiming at adding a notion of...
Cited by: More
Typing Concurrent Objects and Actors - Dagnat, Pantel, Colin, Sall (2000)
(Correct)
Concurrent Objects in the Blue Calculus - Dal-Zilio (1998)
(Correct)
A Bisimulation for the Blue Calculus - Dal-Zilio (1999)
(Correct)
Active bibliography (related documents): More All
0.5: Discrimination by Parallel Observers: the Algorithm - Dezani-Ciancaglini, Tiuryn, .. (1998)
(Correct)
0.5: An interpretation of Typed Objects into Typed π-calculus - Sangiorgi (1996)
(Correct)
0.3: Polymorphic Type Inference - Schwartzbach (1995)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.5: The Deep Blue Calculus - Liquori (1998)
(Correct)
0.4: An Interpretation of Typed Concurrent Objects in the Blue Calculus - Zilio (2000)
(Correct)
0.3: Short Presentation: A Functional Scenario - For Bytecode Verification (2004)
(Correct)
Related documents from co-citation: More All
2: Intgration des Typages Fonctionnel et Concurrent d'un Langage Fonctionnel d'Acte.. (context) - COLIN - 1998
2: Typing the Use of Resources in a Concurrent Calculus (context) - Boudol - 1997
2: Asynchrony and the -calculus (context) - Boudol - 1992
BibTeX entry: (Update)
Silvano Dal-Zilio. Implicit polymorphic type system for the blue calculus. Technical Report 3244, INRIA, September 1997. http://citeseer.ist.psu.edu/dal-zilio97implicit.html More
@techreport{ dalzilio97implicit,
author = "Silvano {Dal-Zilio}",
title = "Implicit Polymorphic Type System for the Blue Calculus",
number = "RR-3244",
year = "1997",
url = "citeseer.ist.psu.edu/dal-zilio97implicit.html" }
Citations (may not include all citations):
809
A theory of type polymorphism in programming (context) - Milner - 1978
291
A calculus of mobile agents
- dric, Georges et al. - 1996
254
Theoretical Computer Science (context) - Berry, Boudol et al. - 1992
169
A call-by-need lambda calculus
- Ariola, Felleisen et al. - 1995
138
Type inference for polymorphic references (context) - Tofte - 1990
137
Laboratory for Foundations of Computer Science (context) - Milner, -calculus et al. - 1991
126
Type inference with polymorphic recursion
- Henglein - 1993
118
What are principal typings and what are they good
- Jim - 1996
116
Mathematical Structures in Computer Science (context) - Pierce, Sangiorgi et al. - 1995
114
The polymorphic pi-calculus: theory and implementation
- Turner - 1995
109
A polymorphic type system for Prolog (context) - Mycroft, O'Keefe - 1984
82
Typeful programming
- Cardelli - 1989
57
Type inference for records in a natural extension of ML (context) - my - 1991
54
Type reconstruction in the presence of polymorphic recursion (context) - Kfoury, Tiuryn et al. - 1993
50
A simple applicative language: Mini-ML (context) - Cl, Despeyroux et al. - 1986
48
Polymorphic type assignment and CPS conversion
- Harper, Lillibridge - 1993
47
Two extension of Curry's type inference system (context) - Cardone, Coppo - 1990
45
Asynchrony and the -calculus (context) - Boudol - 1992
31
calculus in direct style (context) - rard, The - 1997
30
Polymorphic typing of an algorithmic language
- Leroy - 1992
27
Type assignment in programming languages (context) - Martins - 1984
26
the discriminating power of multiplicities in the -calculus (context) - Boudol, Laneve - 1994
24
la ML for the join-calculus (context) - dric, Luc et al. - 1997
14
The undecidability of the semi-unication problem (context) - Kfoury, Tiuryn et al. - 1990
14
Polymorphic type scheme and recursive denitions (context) - Mycroft - 1984
12
Department of Computer Science (context) - Honda, for et al. - 1992
7
Decidability of ML typing is complete for deterministic expo.. (context) - Mairson - 1990
6
Principal type schemes for functional programming (context) - Damas, Milner - 1982
2
multiplicities and the -calculus (context) - Boudol, Laneve - 1995
2
the expresiveness of internal mobility in name-passing calcu.. (context) - Boreale - 1996
1
Polymorphic type checking and related problems (context) - Urzyczyn - 1996
1
Incremental polymorphic type checking with update
- Mycroft - 1992
1
mantique du lambda calcul avec ressources (context) - Lavatelli - 1996
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC