3535 search results - page 4 / 707 » Logic Program Specialisation |
67
Voted
WLP
1997
Springer
15 years 1 months ago
1997
Springer
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transform...
ESOP
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most ...
DAGSTUHL
1996
14 years 10 months ago
1996
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalua...
FASE
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
58
Voted
ICFP
2007
ACM
15 years 9 months ago
2007
ACM
User-defined data types, pattern-matching, and recursion are ubiquitous features of Haskell programs. Sometimes a function is called with arguments that are statically known to be...