275 search results - page 24 / 55 » Non-Termination Inference of Logic Programs |
101
click to vote
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
SAS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
KI
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Rule-based programming paradigm is omnipresent in number of engineering domains. However, there are some fundamental semantical differences between it, and classic progr...
JFP
2000
14 years 9 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
PPDP
2005
Springer
15 years 3 months ago
2005
Springer
Type checking and type inference are fundamentally similar problems. However, the algorithms for performing the two operations, on the same type system, often differ significant...