4257 search results - page 323 / 852 » The Logical Modularity of Programs |
138
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
163
click to vote
ICLP
1999
Springer
15 years 11 months ago
1999
Springer
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...
166
click to vote
INFORMATICALT
2000
15 years 6 months ago
2000
The paper presents a simple programming language and rewriting system called GENS. It is based on an extension of the -calculus called E-calculus. GENS is a multiparadigm language:...
159
click to vote
ESOP
2010
Springer
16 years 4 months ago
2010
Springer
The combination of message passing and locking to protect shared state is a useful concurrency pattern. However, programs that employ this pattern are susceptible to deadlock. That...
193
click to vote
HASKELL
2009
ACM
16 years 1 months ago
2009
ACM
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...