1320 search results - page 184 / 264 » Efficient Implementation of a Linear Logic Programming Langu... |
155
click to vote
FORTE
2004
15 years 7 months ago
2004
Abstract. We present automated techniques for the explanation of counterexamples, where a counter-example should be understood as a sequence of program statements. Our approach is ...
153
click to vote
PLDI
2006
ACM
16 years 6 days ago
2006
ACM
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
158
click to vote
ECOOP
1998
Springer
15 years 10 months ago
1998
Springer
In this paper, we propose architectural support for object manipulation, stack processing and method invocation to enhance the execution speed of Java bytecodes. First, a virtual a...
138
click to vote
IFIP
1989
Springer
15 years 10 months ago
1989
Springer
ÐBSR (Broadcasting with Selective Reduction) is a PRAM more powerful than any CRCW PRAM. In order to extend the Broadcast Instruction of BSR and make it more useful for a large cl...
154
click to vote
PEPM
2007
ACM
16 years 11 days ago
2007
ACM
Having been convinced of the potential benefits of partial evaluation, we wanted to conduct some experiments in our favourite Computer Algebra System, Maple. Maple is a large lan...