Back to Results
First PageMeta Content
Computing / Computer programming / Data types / Polymorphism / Subtype polymorphism / Type system / Bounded quantification / Inheritance / Covariance and contravariance / Software engineering / Object-oriented programming / Type theory


On Decidability of Nominal Subtyping with Variance Andrew J. Kennedy Benjamin C. Pierce Microsoft Research Cambridge
Add to Reading List

Document Date: 2006-12-22 07:18:48

Open Document

File Size: 184,66 KB

Share Result on Facebook

City

Albuquerque / Vancouver / Anaheim / Kazimierz / Constraint / Sendai / London / Nantes / /

Company

The MIT Press / Microsoft / /

Country

Poland / France / Japan / United Kingdom / /

Currency

USD / /

Facility

University of Washington / Variance Andrew J. Kennedy Benjamin C. Pierce Microsoft Research Cambridge University of Pennsylvania Abstract We / University of Edinburgh / /

IndustryTerm

nested applications / nullary constructor applications / proof search algorithm / unary applications / type systems / smarter algorithm / proof search / declaration-site / /

Organization

University of Washington / Cambridge University / University of Pennsylvania / MIT / University of Edinburgh / Penn PL Club / /

Person

Nick Benton / Gavin Bierman / Karl Mazurak / Addison Wesley / C. Russo / D. Yu / Theoretical Aspects / Martin Odersky / Benjamin C. Pierce / Claudio Russo / A. Kennedy / B. Emir / /

Position

editor / visiting researcher / first author / second author / programmer / Emir / /

ProgrammingLanguage

Java / C / T / Scala / /

ProvinceOrState

New Mexico / North Dakota / British Columbia / California / A. B. / /

PublishedMedium

Theoretical Computer Science / Lecture Notes in Computer Science / /

Technology

Functional Programming / object-oriented programming / Java / http / proof search algorithm / /

URL

.NET / www.ecma-international.org/publications/standards / /

SocialTag