Sciweavers

322 search results - page 47 / 65
» Expressive power and abstraction in Essence
Sort
View
CADE
2007
Springer
16 years 1 days ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
EDBT
2002
ACM
136views Database» more  EDBT 2002»
15 years 12 months ago
The Geometry of Uncertainty in Moving Objects Databases
Abstract. This work addresses the problem of querying moving objects databases. which capture the inherent uncertainty associated with the location of moving point objects. We addr...
Goce Trajcevski, Ouri Wolfson, Fengli Zhang, Sam C...
EDBT
2008
ACM
137views Database» more  EDBT 2008»
15 years 12 months ago
Optimizing away joins on data streams
Abstract. Monitoring aggregates on IP traffic data streams is a compelling application for data stream management systems. Often, such streaming aggregation queries involve joining...
Lukasz Golab, Theodore Johnson, Nick Koudas, Dives...
83
Voted
ICFP
2006
ACM
15 years 11 months ago
Simple unification-based type inference for GADTs
Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a simple but powerful generaliz...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...
LATA
2009
Springer
15 years 6 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig