3566 search results - page 215 / 714 » Signed Logic Programs |
199
click to vote
POPL
2002
ACM
16 years 3 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...
245
click to vote
ICFP
2009
ACM
16 years 3 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-...
190
click to vote
BANFF
1995
15 years 6 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 ...
133
Voted
ICLP
2003
Springer
15 years 8 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...
234
click to vote
ICFP
2009
ACM
16 years 3 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...