213 search results - page 19 / 43 » Automated Termination Analysis for Logic Programs with Cut |
137
click to vote
ICLP
1992
Springer
15 years 5 months ago
1992
Springer
We discuss a declarative characterization of inheritance in logic programming. Our approach is inspired both by existing literature on denotational models for inheritance and by e...
160
click to vote
CSL
2007
Springer
15 years 7 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
115
click to vote
ESOP
2010
Springer
15 years 10 months ago
2010
Springer
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...
CADE
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
194
click to vote
POPL
2006
ACM
16 years 1 months ago
2006
ACM
This paper specifies, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer a...