4192 search results - page 512 / 839 » Probabilistic Logic Programming |
280
click to vote
PADL
2009
Springer
16 years 5 months ago
2009
Springer
This paper proposes a declarative description of user interfaces that s from low-level implementation details. In particular, the user interfaces specified in our framework are exe...
155
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
154
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
184
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
137
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...