838 search results - page 114 / 168 » From Natural Language to Formal Proof Goal |
186
click to vote
HASKELL
2007
ACM
15 years 10 months ago
2007
ACM
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
264
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
163
click to vote
FOSSACS
2008
Springer
15 years 7 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
258
click to vote
SLOGICA
2011
15 years 1 months ago
2011
The paper contains a survey of (mainly unpublished) adaptive logics of inductive generalization. These defeasible logics are precise formulations of certain methods. Some attentio...
129
click to vote
ICFP
2000
ACM
15 years 10 months ago
2000
ACM
We show that a non-duplicating transformation into Continuation-Passing Style (CPS) has no effect on control-flow analysis, a positive effect on binding-time analysis for tradi...