Colored local type inference

OderskyMartin,; ZengerChristoph,; ZengerMatthias,

doi:10.1145/373243.360207

Cited by 32 publications

(41 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It would be interesting to study relevance and adaptability to coloured nets of the existing polymorphic type systems [8,15] and extensional semantic equivalence [10,3,6] for join terms. On the other hand, the body of work on the semantics of nets suggests a noninterleaving semantics based on monoidal categories for the join-calculus.…”

Section: Discussionmentioning

confidence: 99%

“…We shall focus on a monadic version of the join calculus [5,7], writing its operational semantics in terms of a reduction system as in [15]. For a thorough introduction the reader is referred to the literature.…”

Section: The Join Calculusmentioning

confidence: 99%

“…Rule (2) formalises the scope extrusion of names, and rule (3) states that, under conditions that avoid name clashes, definitions can equivalently be gathered together by the ∧ connective. Interestingly, rule (3) is problematic in the design of polymorphic type systems for the join calculus [8,15], essentially because it may introduce polymorphic (mutual) recursion. This, however, is not an issue in the present setting.…”

Section: Definitionmentioning

confidence: 99%

“…It is worth remarking that these systems are very rudimentary from the type theoretic viewpoint: there are no complex types or rules, nor sophisticated issues such as polymorphism [8,15] or similar. However, we believe that our formalisation is quite interesting, suggestive, and worth pursuing, because the nature of join-terms makes it natural to express our conditions in systems of rules.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

High-Level Petri Nets as Type Theories in the Join Calculus

Buscemi

Sassone

2001

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four classes of nets of increasing expressiveness, Π i, introduce a hierarchy of type systems of decreasing strictness, ∆i, i = 0, . . . , 3, and we prove that a join process is typeable according to ∆i if and only if it is (strictly equivalent to) a net of class Πi. In the details, Π0 and Π1 contain, resp., usual place/transition and coloured Petri nets, while Π2 and Π3 propose two natural notions of high-level net accounting for dynamic reconfiguration and process creation and called reconfigurable and dynamic Petri nets, respectively.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: The Join Calculusmentioning

confidence: 99%

Section: Definitionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

High-Level Petri Nets as Type Theories in the Join Calculus

Buscemi

Sassone

2001

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…For example, x :Int => x+1 represents the successor function, with type Int=>Int. Furthermore, the Scala compiler performs quite extensive local type inference [35,31].…”

Section: Syntaxmentioning

confidence: 99%

An object-oriented approach to datatype-generic programming

Moors

Piessens

Joosen

2006

Proceedings of the 2006 ACM SIGPLAN Workshop on Generic Programming

View full text Add to dashboard Cite

Datatype-generic programming (DGP) is the next step beyond abstracting over types using parametric polymorphism, which is often called "genericity" in object-oriented languages. However, unlike genericity, DGP has not received much attention in the OO community. Nonetheless, in the context of functional languages, it has proven to make programs more robust with respect to changes in the type structure, as well as in many other applications, such as type-safe XML processing and marshalling. To carry these strengths over to an OO language, we present an extensible library for lightweight DGP in Scala, based on an existing lightweight approach in Haskell. We discuss the challenges in developing and using our library, and explore ways to overcome them.

show abstract

Recasting MLF

Botlan

Rémy

2009

Information and Computation

View full text Add to dashboard Cite

Recasting ML F Résumé : Le langage ML F aété conçu comme une alternative au Système F permettant l'inférence partielle de typeà la ML. Il diffère du Système F par la nature de ses types et par sa relation d'instance sur les types. Malheureusement, la définition de l'instance de type est purement syntaxique et n'est pas soutenue par une sémantique sous-jacente. Jusqu'à présent elle n'aété justifiée qu'a posteriori par le résultat de correction. Dans ce travail nous réexaminons ML F en suivant une approche plus progressive en s'appuyant sur le Système F. Nous soutenons que le Système F n'est pas bien adapté pour l'inférence de typeà la ML parce qu'il ne réussit pasà factoriser des dérivations de typageétroitement reliées. Nous résolvons ce problème dans la présentation de ML Fà la Curry en enrichissant les types avec une nouvelle forme de quantification qui permet de représenter une collection tout entière de types du système F. Cela conduità une interprétation naturelle des types de ML F comme des ensembles de types du système F età en déduire la relation d'instance par inclusion des interprétations. Nous donnonségalement une définition syntaxiqueéquivalence de l'instance de type sous la forme d'un ensemble de règles d'inférences. Nous en dérivons une présentationà la Church de ML F en raffinant encore les types de façonà distinguer l'information de type inférée de celle fournie par l'utilisateur. Le langage résultant est plus canonique que celui initialement proposé. Nous montrons un plongement de ML dans ML F ainsi qu'un codage du Système F dans ML F. De plus, comme ML F est plus expressif que le Système F, un codage de ML F est fourni vers une extension du Système F avec des liaisons locales.

show abstract

Colored local type inference

Cited by 32 publications

References 23 publications

High-Level Petri Nets as Type Theories in the Join Calculus

High-Level Petri Nets as Type Theories in the Join Calculus

An object-oriented approach to datatype-generic programming

Recasting MLF

Contact Info

Product

Resources

About