Sciweavers

400 search results - page 56 / 80
» Logical relations for monadic types
Sort
View
POPL
2004
ACM
14 years 8 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann
FPCA
1989
13 years 11 months ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler
DLOG
2011
12 years 11 months ago
Extracting Finite Sets of Entailments from OWL Ontologies
The canonical standard description logic reasoning service is classification, that is, the generation of the set of atomic subsumptions which are entailed by some ontology. While ...
Samantha Bail, Bijan Parsia, Ulrike Sattler
DEBU
2008
118views more  DEBU 2008»
13 years 7 months ago
Big, Fast XQuery: Enabling Content Applications
Increasingly, companies recognize that most of their important information does not exist in relational stores but in documents. For a long time, textual information has been rela...
Mary Holstege
IJDAR
2006
102views more  IJDAR 2006»
13 years 7 months ago
Table form document analysis based on the document structure grammar
Structure analysis of table form documents is an important issue because a printed document and even an electronic document do not provide logical structural information but merely...
Akira Amano, Naoki Asada, Masayuki Mukunoki, Masah...