Sciweavers

3319 search results - page 364 / 664
» Subshifts, Languages and Logic
Sort
View
SIGMOD
2008
ACM
123views Database» more  SIGMOD 2008»
16 years 7 months ago
SchemaScope: a system for inferring and cleaning XML schemas
We present SchemaScope, a system to derive Document Type Definitions and XML Schemas from corpora of sample XML documents. Tools are provided to visualize, clean, and refine exist...
Geert Jan Bex, Frank Neven, Stijn Vansummeren
ICFP
2004
ACM
16 years 6 months ago
Multi-return function call
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
Olin Shivers, David Fisher
ICFP
2003
ACM
16 years 6 months ago
An extension of HM(X) with bounded existential and universal data-types
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
Vincent Simonet
ICCS
2009
Springer
16 years 1 months ago
Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application
Abstract. In this paper, we extend Simple Conceptual Graphs with Reiter’s default rules. The motivation for this extension came from the type of reasonings involved in an agronom...
Jean-François Baget, Madalina Croitoru, J&e...
PPDP
2009
Springer
16 years 1 months ago
Dependent type inference with interpolants
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
Hiroshi Unno, Naoki Kobayashi