558 search results - page 53 / 112 » Compiling Resources in a Linear Logic Programming Language |
EUROCOLT
1999
Springer
14 years 2 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
ESOP
2004
Springer
14 years 4 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
ICFEM
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. Certificate translation is a method that transforms certificates of source programs into certificates of their compilation. It provides strong guarantees on low-level cod...
EUROSYS
2009
ACM
14 years 7 months ago
2009
ACM
Memory transactions, similar to database transactions, allow a programmer to focus on the logic of their program and let the system ensure that transactions are atomic and isolate...
VEE
2010
ACM
14 years 5 months ago
2010
ACM
Intense research on virtual machines has highlighted the need for flexible software architectures that allow quick evaluation of new design and implementation techniques. The inte...