850 search results - page 74 / 170 » A Logic Programming Language Based on Binding Algebras |
114
click to vote
ESOP
2010
Springer
15 years 10 months ago
2010
Springer
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...
PEPM
2007
ACM
15 years 7 months ago
2007
ACM
Having been convinced of the potential benefits of partial evaluation, we wanted to conduct some experiments in our favourite Computer Algebra System, Maple. Maple is a large lan...
127
click to vote
VLDB
1994
ACM
15 years 5 months ago
1994
ACM
Expert database systems extend the functionality of conventional database systems by providing a facility for creating and automatically executing Condition-Action rules. While Con...
103
click to vote
ICALP
2000
Springer
15 years 5 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
107
click to vote
FUIN
2006
15 years 1 months ago
2006
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., vi...