3535 search results - page 221 / 707 » Logic Program Specialisation |
257
click to vote
POPL
2002
ACM
16 years 6 months ago
2002
ACM
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
293
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
236
click to vote
BANFF
1995
15 years 10 months ago
1995
The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs ...
180
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
285
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...