Sciweavers

POPL
1997
ACM
13 years 9 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
POPL
1997
ACM
13 years 9 months ago
Shape Types
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
Pascal Fradet, Daniel Le Métayer
POPL
1997
ACM
13 years 9 months ago
Type-Checking Higher-Order Polymorphic Multi-Methods
We present a new predicative and decidable type system, called ML , suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML...
François Bourdoncle, Stephan Merz
POPL
1997
ACM
13 years 9 months ago
Program Fragments, Linking, and Modularization
Module mechanisms have received considerable theoretical attention, but the associated concepts of separate compilation and linking have not been emphasized. Anomalous module syst...
Luca Cardelli