Sciweavers

3653 search results - page 338 / 731
» On Recognizable Timed Languages
Sort
View
POPL
2002
ACM
16 years 7 months ago
Functional logic overloading
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conce...
Matthias Neubauer, Peter Thiemann, Martin Gasbichl...
SIGMOD
2009
ACM
158views Database» more  SIGMOD 2009»
16 years 7 months ago
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Whether beloved or despised, XML Schema is momentarily the only industrially accepted schema language for XML and is unlikely to become obsolete any time soon. Nevertheless, many ...
Geert Jan Bex, Wouter Gelade, Wim Martens, Frank N...
PODS
2008
ACM
143views Database» more  PODS 2008»
16 years 7 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
EDBT
2008
ACM
158views Database» more  EDBT 2008»
16 years 7 months ago
Expressive query specification through form customization
A form-based query interface is usually the preferred means to provide an unsophisticated user access to a database. Not only is such an interface easy to use, requiring no techni...
Magesh Jayapandian, H. V. Jagadish
ICFP
2006
ACM
16 years 6 months ago
Good advice for type-directed programming aspect-oriented programming and extensible generic functions
Type-directed programming is an important idiom for software design. In type-directed programming the behavior of programs is guided by the type structure of data. It makes it pos...
Geoffrey Washburn, Stephanie Weirich