Sciweavers

640 search results - page 83 / 128
» Logical types for untyped languages
Sort
View
POPL
2010
ACM
14 years 6 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
COLING
2010
13 years 4 months ago
DL Meet FL: A Bidirectional Mapping between Ontologies and Linguistic Knowledge
We present a transformation scheme that mediates between description logics (DL) or RDF-encoded ontologies and type hierarchies in feature logics (FL). The DL-to-FL direction is i...
Hans-Ulrich Krieger, Ulrich Schäfer
PODS
2004
ACM
115views Database» more  PODS 2004»
14 years 9 months ago
Foundations of Semantic Web Databases
The Semantic Web is based on the idea of adding more machine-readable semantics to web information via annotations written in a language called the Resource Description Framework ...
Claudio Gutiérrez, Carlos A. Hurtado, Alber...
SEMCO
2007
IEEE
14 years 3 months ago
Modeling Discriminative Global Inference
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
Nicholas Rizzolo, Dan Roth
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 9 months ago
A Non-Null Annotation Inferencer for Java Bytecode
We present a non-null annotations inferencer for the Java bytecode language. We previously proposed an analysis to infer non-null annotations and proved it soundness and completen...
Laurent Hubert