Sciweavers

365 search results - page 45 / 73
» Using Types as Approximations for Type Checking Prolog Progr...
Sort
View
SCAM
2002
IEEE
14 years 17 days ago
Handling Preprocessor-Conditioned Declarations
Many software systems are developed with configurable functionality, and for multiple hardware platforms and operating systems. This can lead to thousands of possible configuratio...
Lerina Aversano, Massimiliano Di Penta, Ira D. Bax...
POPL
2005
ACM
14 years 8 months ago
Polymorphic bytecode: compositional compilation for Java-like languages
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
Davide Ancona, Ferruccio Damiani, Sophia Drossopou...
OOPSLA
2004
Springer
14 years 1 months ago
Scalable extensibility via nested inheritance
Inheritance is a useful mechanism for factoring and reusing code. However, it has limitations for building extensible systems. We describe nested inheritance, a mechanism that add...
Nathaniel Nystrom, Stephen Chong, Andrew C. Myers
POPL
2003
ACM
14 years 8 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper
WWW
2004
ACM
14 years 8 months ago
A combined approach to checking web ontologies
The understanding of Semantic Web documents is built upon ontologies that define concepts and relationships of data. Hence, the correctness of ontologies is vital. Ontology reason...
Jin Song Dong, Chew Hung Lee, Hian Beng Lee, Yuan-...