Type Inference for First-Class Messages with Feature Constraints

13 years 8 months ago

Download www.coli.uni-saarland.de

Abstract. We present a constraint system OF of feature trees that is appropriate to specify and implement type inference for first-class messages. OF extends traditional systems of feature constraints by a selection constraint x y

Martin Müller, Susumu Nishimura

Real-time Traffic

Algorithms | ASIAN 1998 | Feature Tree | Satisfiability Problem | Type Inference |

claim paper

» Type Inference of SELF

» From ML to MLF graphic type constraints with efficient type inference

» Dynamic inference of static types for ruby

» ObjectOriented Type Inference

» Scripting the type inference process

» Discriminative sum types locate the source of type errors

» Type inference and strong static type checking for Promela

» Type inference principal typings and letpolymorphism for firstclass mixin modules

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	ASIAN
Authors	Martin Müller, Susumu Nishimura

Comments (0)

Sciweavers

Type Inference for First-Class Messages with Feature Constraints

Algorithms | ASIAN 1998 | Feature Tree | Satisfiability Problem | Type Inference |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers