16430 search results - page 119 / 3286 » On Computable Tree Functions |
126
Voted
IFL
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We describe the architecture of a virtual machine for executing functional logic programming languages. A distinguishing feature of our machine is that it preserves the o...
122
Voted
CACM
2010
15 years 3 months ago
2010
Suppose that you want to delegate the ability to process your data, without giving away access to it. We show that this separation is possible: we describe a "fully homomorph...
131
click to vote
SAC
2009
ACM
15 years 10 months ago
2009
ACM
We present a GPU-based algorithm for computing discretized distance functions on road networks. As applications, we provide algorithms for computing discrete Order-k Network Voron...
217
Voted
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. Qualification has been recently introduced as a generalization of uncertainty in the field of Logic Programming. In this paper we investigate a more expressive language f...
133
Voted
TPHOL
1995
IEEE
15 years 7 months ago
1995
IEEE
This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL, which o e...