1216 search results - page 114 / 244 » Hybrid type checking |
177
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rules use non...
140
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
129
Voted
PLDI
2000
ACM
15 years 8 months ago
2000
ACM
This paper presents a static race detection analysis for multithreaded Java programs. Our analysis is based on a formal type system that is capable of capturing many common synchr...
110
Voted
ML
2008
ACM
15 years 3 months ago
2008
ACM
We implement statically-typed multi-holed contexts in OCaml using an underlying algebraic datatype augmented with phantom types. Existing approaches require dynamic checks or more...
129
click to vote
DAC
2006
ACM
16 years 4 months ago
2006
ACM
In this paper, we propose an adaptive low-power bus encoding algorithm based on weighted code mapping (WCM) and the delayed bus technique. The WCM algorithm transforms an original...