85 search results - page 15 / 17 » Specialization of Lazy Functional Logic Programs |
CCS
2011
ACM
12 years 7 months ago
2011
ACM
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
SIAMCOMP
2008
13 years 7 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
ENTCS
2007
13 years 7 months ago
2007
Poly-controlled partial evaluation (PCPE) is a flexible approach for specializing logic programs, which has been recently proposed. It takes into account repertoires of global co...
VMCAI
2010
Springer
14 years 5 months ago
2010
Springer
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
PLDI
2010
ACM
14 years 5 months ago
2010
ACM
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...