797 search results - page 28 / 160 » Eliminating Proofs from Programs |
314
click to vote
CC
2011
Springer
14 years 9 months ago
2011
Springer
For decades, the design and implementation of arrays in programming languages has reflected a natural tension between productivity and performance. Recently introduced HPCS langua...
160
click to vote
ISLPED
2004
ACM
15 years 11 months ago
2004
ACM
Microprocessor designers use techniques such as clock gating to reduce power dissipation. An unfortunate side-effect of these techniques is the processor current fluctuations th...
185
click to vote
CSL
2001
Springer
15 years 10 months ago
2001
Springer
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of m...
172
click to vote
FOAL
2009
ACM
16 years 12 days ago
2009
ACM
We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in se...
164
click to vote
LOGCOM
2007
15 years 5 months ago
2007
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...