1423 search results - page 240 / 285 » Languages of Nested Trees |
253
click to vote
POPL
2009
ACM
16 years 4 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
233
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
160
click to vote
ICFP
2006
ACM
16 years 4 months ago
2006
ACM
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
125
click to vote
WEBDB
2009
Springer
15 years 10 months ago
2009
Springer
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
128
click to vote
SEMWEB
2009
Springer
15 years 10 months ago
2009
Springer
OWL Ontology language can be very expressive. This could provide difficulty in ontology understanding process. We belief, that an ontology visualization equipped with intuitive int...