OpenAlex
PricingAboutJobs
Log inGet started
Work

Lower bounds on type inference with subtypes

HTML

Year: 1995
Type: conference-paper
Source: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
DOI: 10.1145/199448.199481
Authors: My Hoang, John C. Mitchell
Institution: Stanford University
Language: English

Topic: Logic, programming, and type systems
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Keywords: type inference, subtyping, lower bounds, PSPACE-hardness, satisfiability, principal typing, lambda calculus, type declarations, NP-hardness

Open Access status: closed
OpenAlex ID: W2133147697
FWCI: 5.909
Cites: 14
Cited by: 62
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security