8132 search results - page 286 / 1627 » Dependability, Abstraction, and Programming |
164
click to vote
IOR
2006
15 years 6 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
160
click to vote
AC
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. These notes form the basis of four lectures given at the Summer School on Generic Programming, Oxford, UK, which took place dur
144
click to vote
ASPLOS
2000
ACM
15 years 11 months ago
2000
ACM
be honored. Abstracting with credit is permitted. To copy otherwise, to sion and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1
178
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. We propose an extension of the Applied Pi
167
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. This paper provides a call-by-name and a call-by-value calculus, both of which have a Curry-Howard correspondence to the minimal normal logic K. The calculi are extension...