Colin Bleckner

dblp:44/798 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems
data types
0.012004
Modular typechecking for hierarchically extensible datatypes and functions · ACM Trans. Program. Lang. Syst. 2004
Programming languages and type systems › type systems
extensible data types
0.012004
Modular typechecking for hierarchically extensible datatypes and functions · ACM Trans. Program. Lang. Syst. 2004
Programming languages and type systems › type checking
modular typechecking
0.012004
Modular typechecking for hierarchically extensible datatypes and functions · ACM Trans. Program. Lang. Syst. 2004
Programming languages and type systems
type systems
0.012004
Modular typechecking for hierarchically extensible datatypes and functions · ACM Trans. Program. Lang. Syst. 2004
Programming languages and type systems
functional programming
0.012004
Modular typechecking for hierarchically extensible datatypes and functions · ACM Trans. Program. Lang. Syst. 2004
Programming languages and type systems › object-oriented programming
object-oriented language features
0.012004
Modular typechecking for hierarchically extensible datatypes and functions · ACM Trans. Program. Lang. Syst. 2004

Methods — techniques the papers use, named apart from their topics

type soundness proof · 0.0
YearPublicationVenuePosition
2004 Modular typechecking for hierarchically extensible datatypes and functions
abstract
One promising approach for adding object-oriented (OO) facilities to functional languages like ML is to generalize the existing datatype and function constructs to be hierarchical and extensible, so that datatype variants simulate classes and function cases simulate methods. This approach allows existing datatypes to be easily extended with both new operations and new variants, resolving a longstanding conflict between the functional and OO styles. However, previous designs based on this approach have been forced to give upmodulartypechecking, requiring whole-program checks to ensure type safety. We describe Extensible ML (EML), an ML-like language that supports hierarchical, extensible datatypes and functions while preserving purely modular typechecking. To achieve this result,EML's type system imposes a few requirements on datatype and function extensibility, but EML is still able to express both traditional functional and OO idioms. We have formalized a core version of EML and proven the associated type system sound, and we have developed a prototype interpreter for the language.
Todd D. Millstein, Colin Bleckner, Craig Chambers
ACM Trans. Program. Lang. Syst.2
2002 Modular typechecking for hierarchically extensible datatypes and functions
abstract
One promising approach for adding object-oriented (OO) facilities to functional languages like ML is to generalize the existing datatype and function constructs to be hierarchical and extensible, so that datatype variants simulate classes and function cases simulate methods. This approach allows existing datatypes to be easily extended with both new operations and new variants, resolving a long-standing conflict between the functional and OO styles. However, previous designs based on this approach have been forced to give up modular typechecking, requiring whole-program checks to ensure type safety. We describe Extensible ML (eml), an ML-like language that supports hierarchical, extensible datatypes and functions while preserving purely modular typechecking. To achieve this result, eml's type system imposes a few requirements on datatype and function extensibility, but eml is still able to express both traditional functional and OO idioms. We have formalized a core version of eml and proven the associated type system sound, and we have developed a prototype interpreter for the language.
Todd D. Millstein, Colin Bleckner, Craig Chambers
ICFP2