7167 search results - page 891 / 1434 » Answer Set Programming |
258
click to vote
POPL
2005
ACM
16 years 5 months ago
2005
ACM
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
252
click to vote
POPL
2004
ACM
16 years 5 months ago
2004
ACM
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
273
click to vote
POPL
2004
ACM
16 years 5 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
137
click to vote
ICSE
2008
IEEE-ACM
16 years 5 months ago
2008
IEEE-ACM
Software Testing can take up to half of the resources of the development of new software. Although there has been a lot of work on automating the testing phase, fixing a bug after...
162
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...