Sciweavers

1613 search results - page 224 / 323
» Functional and Constraint Logic Programming
Sort
View
COR
2007
106views more  COR 2007»
13 years 9 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...
POPL
2012
ACM
12 years 5 months ago
A language for automatically enforcing privacy policies
It is becoming increasingly important for applications to protect sensitive data. With current techniques, the programmer bears the burden of ensuring that the application’s beh...
Jean Yang, Kuat Yessenov, Armando Solar-Lezama
SAS
2009
Springer
171views Formal Methods» more  SAS 2009»
14 years 10 months ago
Bottom-Up Shape Analysis
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
Bhargav S. Gulavani, Supratik Chakraborty, Ganesan...
POPL
2010
ACM
14 years 7 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
FPCA
1989
14 years 1 months ago
Theorems for Free!
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., v...
Philip Wadler