(Enter summary)
Abstract: : Tagged Types encode some families of types indexed by labels. Like
Wand's row types, they make use of specific variables from which new fields can be
extracted, and like Rémy's record types, the types introduced in these fields can be
parameterized. However, the logical and technical treatment of tagged types is original;
it is claimed that they combine the intuitiveness of row types with most of the
expressiveness of record types. Their use is illustrated by the design of polymorphic
typing... (Update)
Context of citations to this paper: More
...values that may be passed on ports referring to that label. Details about the type system of LCS and its implementation can be found in [2, 3]. 5 3. Programming with LCS, A complete example Region Labelling LCS programming is illustrated in this section by a simple image...
Cited by: More
Process Calculi at work - An account of the LCS project - Berthomieu (1995)
(Correct)
Active bibliography (related documents): More All
0.5: Programming with behaviors in an ML framework - The.. - Berthomieu, Le Sergent (1994)
(Correct)
0.2: Distributed Software Engineering - Invited State-of-the-Art Report - Kramer
(Correct)
0.2: Modelling Dynamic Distributed System Structures in PARSE - Liu, Gorton (1996)
(Correct)
Similar documents based on text: More All
0.5: LCS Users Manual - Berthomieu (1998)
(Correct)
0.5: LCS Users Manuals - Berthomieu (1998)
(Correct)
0.4: Balancing load under large and fast load changes in.. - Le Sergent, Berthomieu (1994)
(Correct)
BibTeX entry: (Update)
B. Berthomieu, C. le Monis de Sagazan, "A Calculus of Tagged Types, with Applications to Process Languages", TAPSOFT Workshop on Types for Program Analysis, Aarhus, Denmark, May 95 (DAIMI report PB-493, University of Aarhus). http://citeseer.ist.psu.edu/209014.html More
@misc{ berthomieu-calculus,
author = "B. Berthomieu and C. de Sagazan",
title = "A Calculus of Tagged Types, with Applications to Process Languages",
text = "B. Berthomieu, C. le Monis de Sagazan, A Calculus of Tagged Types, with
Applications to Process Languages, TAPSOFT Workshop on Types for Program
Analysis, Aarhus, Denmark, May 95 (DAIMI report PB-493, University of Aarhus).",
url = "citeseer.ist.psu.edu/209014.html" }
Citations (may not include all citations):
1933
Communication and Concurrency (context) - Milner - 1989
343
Principal type-schemes for functional programs (context) - Damas, Milner - 1982
159
CML: A Higher Order Concurrent Language (context) - Reppy - 1991
119
Facile: A symmetric integration of concurrent and functional.. (context) - Giacalone, Mishra et al. - 1989
107
Complete Type Inference for Simple Objects (context) - Wand - 1987
87
Operational Semantics and Polymorphic Type Inference (context) - Tofte - 1988
62
A calculus of higher-order communicating systems (context) - Thomsen - 1989
47
Higher-Order Concurrent Programs with Finite Communication T..
- Nielson, Nielson - 1994
29
A Theory of Type Polymorphism in Programming Languages (context) - Milner - 1978
22
A second generation calculus for higher order processes (context) - Thomsen - 1993
16
Type Inference for Objects with Instance Variables and Inher.. (context) - Wand
15
Typage Polymorphe d'un Langage Algorithmique (context) - Leroy - 1992
12
Principal typing schemes in a polyadic p-calculus (context) - Vasconcelos, Honda - 1993
10
Programming with behaviors in an ML framework, the syntax an..
- Berthomieu, Le Sergent - 1994
9
Syntactic Theories and the Algebra of Record Terms (context) - Remy
4
The Polyadic p-calculus: a tutorial (context) - Milner
2
Tagged types - a theory of order sorted types for tagged exp.. (context) - Berthomieu - 1993
1
Typage Polymorphe des Calculs de Processus à Liaisons Noms-C.. (context) - de Sagazan
1
Parametric channels via label expressions in CCS (context) - Astesiano, Zucca - 1984
1
The typed l-calculus with first-class processes (context) - Nielson - 1989
1
Typechecking records and variants in a natural extension of .. (context) - Remy - 1989
Documents on the same site (http://www.daimi.aau.dk/~bra8130/TPA/proceedings.html): More
Effective Flow Analysis for Avoiding Run-Time Checks - Jagannathan, Wright (1995)
(Correct)
Optimizing Lazy Functional Programs Using Flow Inference - Faxen (1995)
(Correct)
Type Systems for Closure Conversions - Hannan (1995)
(Correct)
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