Sciweavers

3481 search results - page 270 / 697
» Higher-Order Logic Programming as Constraint Logic Programmi...
Sort
View
DEXAW
2008
IEEE
93views Database» more  DEXAW 2008»
15 years 10 months ago
Overlay GHC: An Extension of Guarded Horn Clauses for Overlay Programming
Today’s high-speed network allows sophisticated applications of overlay networks. Meanwhile, usage of multicore processors has been spreading. The level of concurrency we need t...
Kenji Saito
ENTCS
2006
171views more  ENTCS 2006»
15 years 4 months ago
Program Extraction From Proofs of Weak Head Normalization
We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order ...
Malgorzata Biernacka, Olivier Danvy, Kristian St&o...
PLDI
2011
ACM
14 years 7 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
IPPS
2006
IEEE
15 years 10 months ago
Memory minimization for tensor contractions using integer linear programming
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...
A. Allam, J. Ramanujam, Gerald Baumgartner, P. Sad...
ICALP
2009
Springer
16 years 4 months ago
An Explicit Formula for the Free Exponential Modality of Linear Logic
Christine Tasson, Nicolas Tabareau, Paul-Andr&eacu...