Sciweavers

462 search results - page 29 / 93
» Function Types in Complete Type Inference
Sort
View
DM
2000
108views more  DM 2000»
13 years 7 months ago
On completeness of word reversing
Word reversing is a combinatorial operation on words that detects pairs of equivalent words in monoids that admit a presentation of a certain form. Here we give conditions for this...
Patrick Dehornoy
ECIR
2003
Springer
13 years 9 months ago
From Uncertain Inference to Probability of Relevance for Advanced IR Applications
Uncertain inference is a probabilistic generalisation of the logical view on databases, ranking documents according to their probabilities that they logically imply the query. For ...
Henrik Nottelmann, Norbert Fuhr
ICDT
2010
ACM
149views Database» more  ICDT 2010»
14 years 15 days ago
Mapping Polymorphism
We examine schema mappings from a type-theoretic perspective and aim to facilitate and formalize the reuse of mappings. Starting with the mapping language of Clio, we present a ty...
Ryan Wisnesky, Mauricio Hernandez, Lucian Popa
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
13 years 5 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
FLAIRS
2004
13 years 9 months ago
Formation of Probabilistic Concepts through Observations Containing Discrete and Continuous Attributes
The probabilistic concept formation general problem in dealing with mixed-data scale environments is due to the use of different evaluation function for each attribute type. We cl...
Ricardo Batista Rebouças, João Jos&e...