In the area of mathematical logic and computer science known as type theory, a type constructor is a feature of a typed formal language that buildsâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2009

2009

- Janis VoigtlÃ¤nder
- ICFP
- 2009

Free theorems are a charm, allowing the derivation of useful statements about programs from their (polymorphic) types alone. Weâ€¦Â (More)

Is this relevant?

2009

2009

Free theorems are a charm, allowing the derivation of useful statements about programs from their (polymorphic) types alone. Weâ€¦Â (More)

Is this relevant?

2008

2008

- Vincent Cremet, Philippe Altherr
- Journal of Object Technology
- 2008

We present a generalization of Javaâ€™s parametric polymorphism that enables parameterization of classes and methods by typeâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- James Cheney, Ralf Hinze
- 2003

Classical phantom types are datatypes in which type constraints are expressed using type variables that do not appear in theâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Ralf Hinze
- MPC
- 2000

A polytypic value is one that is defined by induction on the structure of types. In Haskell types are assigned so-called kindsâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Neal Glew, J. Gregory Morrisett
- POPL
- 1999

Linking is a low-level task that is usually vaguely specified, if at all, by language definitions. However, the security of webâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Karl Crary, Stephanie Weirich
- ICFP
- 1999

Run-time type dispatch enables a variety of advanced optimization techniques for polymorphic languages, including tag-freeâ€¦Â (More)

Is this relevant?

1996

1996

- Neil Ghani
- 1996

This paper provides a sound, complete and decidable equational theory for the terms of the (I; ;?;!)-fragment of intuitionisticâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Mark P. Jones
- FPCA
- 1993

This paper describes a flexible type system which combines overloading and higher-order polymorphism in an implicitly typedâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Tatsuya Hagino
- Category Theory and Computer Science
- 1987

A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism toâ€¦Â (More)

Is this relevant?