1445 search results - page 128 / 289 » Uniformly Hard Languages |
149
click to vote
POPL
2012
ACM
13 years 11 months ago
2012
ACM
Despite recent successes, large-scale proof development within proof assistants remains an arcane art that is extremely timeconsuming. We argue that this can be attributed to two ...
263
Voted
POPL
2004
ACM
16 years 4 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...
152
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
165
click to vote
OOPSLA
2007
Springer
15 years 10 months ago
2007
Springer
Java bug finders perform static analysis to find implementation mistakes that can lead to exploits and failures; Java compilers perform static analysis for optimization. If Java...
148
click to vote
ASPLOS
2006
ACM
15 years 10 months ago
2006
ACM
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hardware specification, and temporal predictability. T...