Sciweavers

1036 search results - page 55 / 208
» Natural Narrowing for General Term Rewriting Systems
Sort
View
EMNLP
2010
13 years 5 months ago
Constraints Based Taxonomic Relation Classification
Determining whether two terms in text have an ancestor relation (e.g. Toyota and car) or a sibling relation (e.g. Toyota and Honda) is an essential component of textual inference ...
Quang Do, Dan Roth
ATAL
2005
Springer
14 years 1 months ago
Integrating a MAS and a Pandemonium: the open-source framework AKIRA
The open-source framework AKIRA integrates Multiagent and Pandemonium elements. We describe the main components of the framework, showing that the hybrid nature of the Agents, hav...
Giovanni Pezzulo, Gianguglielmo Calvi, Rino Falcon...
POPL
2005
ACM
14 years 8 months ago
Associated types with class
Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...
Manuel M. T. Chakravarty, Gabriele Keller, Simon L...
PODC
2003
ACM
14 years 28 days ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...
PLDI
2010
ACM
14 years 5 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala