Sciweavers

125 search results - page 9 / 25
» Tabling for Higher-Order Logic Programming
Sort
View
LICS
2008
IEEE
14 years 2 months ago
Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule
Separation logic involves two dual forms of modularity: local reasoning makes part of the store invisible within a static scope, whereas hiding local state makes part of the store...
François Pottier
AGP
1999
IEEE
14 years 3 days ago
The Relative Complement Problem for Higher-Order Patterns
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
Alberto Momigliano, Frank Pfenning
JELIA
1990
Springer
13 years 11 months ago
Semantic Interpretation as Higher-Order Deduction
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
Fernando C. N. Pereira
EUROPAR
2004
Springer
14 years 1 months ago
Concurrent Table Accesses in Parallel Tabled Logic Programs
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
PPDP
2004
Springer
14 years 1 months ago
Just enough tabling
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
Konstantinos F. Sagonas, Peter J. Stuckey