4940 search results - page 349 / 988 » On the Complexity of Universal Programs |
189
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...
168
click to vote
ASPLOS
2000
ACM
15 years 11 months ago
2000
ACM
By studying the behavior of programs in the SPECint95 suite we observed that six out of eight programs exhibit a new kind of value locality, the frequent value locality, according...
180
click to vote
AAAI
1996
15 years 8 months ago
1996
The Airport Example The Omelette Example Copyright c 1996 American Association for Artificial Intelligence. All rights reserved. Despite the existence of programs that are able to ...
184
click to vote
EXPERT
2006
15 years 6 months ago
2006
on abstract principles that you can't easily apply in a formal, deductive fashion. So, the favorite tools of logicians and mathematicians, such as firstorder logic, aren'...
194
click to vote
POPL
2012
ACM
14 years 2 months ago
2012
ACM
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...