• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Efficient Inference of Object Types (1995)

Cached

  • Download as a PDF

Download Links

  • [www.brics.dk]
  • [www.brics.dk]
  • [www.cs.purdue.edu]
  • [www.cs.ucla.edu]
  • [www.cs.ucla.edu]
  • [web.cs.ucla.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Jens Palsberg
Citations:60 - 5 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Palsberg95efficientinference,
    author = {Jens Palsberg},
    title = {Efficient Inference of Object Types},
    year = {1995}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Abadi and Cardelli have recently investigated a calculus of objects [2]. The calculus supports a key feature of object-oriented languages: an object can be emulated by another object that has more refined methods. Abadi and Cardelli presented four first-order type systems for the calculus. The simplest one is based on finite types and no subtyping, and the most powerful one has both recursive types and subtyping. Open until now is the question of type inference, and in the presence of subtyping "the absence of minimum typings poses practical problems for type inference" [2]. In this paper...

Keyphrases

efficient inference    object type    type inference    practical problem    recursive type    finite type    object-oriented language    first-order type system    key feature    minimum typing   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University