378 search results - page 60 / 76 » Higher-order transformation of logic programs |
HASKELL
2006
ACM
14 years 1 months ago
2006
ACM
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
LOPSTR
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
DEXA
2004
Springer
14 years 24 days ago
2004
Springer
Although many spatio-temporal conceptual models has been proposed in the last years, users must express their queries on the underlying physical data structures. In the context of ...
IPPS
2002
IEEE
14 years 10 days ago
2002
IEEE
This paper describes a generic mechanism to migrate threads in heterogeneous distributed environments. To maintain high portability and flexibility, thread migration is implement...
PODS
2005
ACM
14 years 7 months ago
2005
ACM
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...