Sciweavers

5451 search results - page 460 / 1091
» Typed Operational Semantics
Sort
View
POPL
1989
ACM
15 years 10 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
DATESO
2008
131views Database» more  DATESO 2008»
15 years 8 months ago
Towards Cost-based Optimizations of Twig Content-based Queries
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
Michal Krátký, Radim Baca
TLCA
2005
Springer
16 years 7 days ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird
193
Voted
SIGMOD
2000
ACM
164views Database» more  SIGMOD 2000»
15 years 11 months ago
A Data Model and Data Structures for Moving Objects Databases
We consider spatio-temporal databases supporting spatial objects with continuously changing position and extent, termed moving objects databases. We formally define a data model f...
Luca Forlizzi, Ralf Hartmut Güting, Enrico Na...
FOCS
1998
IEEE
15 years 11 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov