64 search results - page 9 / 13 » Normal Forms for Inductive Logic Programming |
CONCUR
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
PLPV
2009
ACM
14 years 4 months ago
2009
ACM
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
JFP
2007
13 years 7 months ago
2007
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...