Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
133
click to vote
APLAS
2009
ACM
97
views
Programming Languages
»
more
APLAS 2009
»
On the Decidability of Subtyping with Bounded Existential Types
15 years 9 months ago
Download
www.informatik.uni-freiburg.de
Bounded existential types are a powerful language feature ling partial data abstraction and information hiding. However, existentials do not mingle well with subtyping as found in ...
Stefan Wehr, Peter Thiemann
claim paper
Read More »