Sciweavers

754 search results - page 116 / 151
» Nested Expressions in Logic Programs
Sort
View
EGC
2005
Springer
14 years 1 months ago
XDTM: The XML Data Type and Mapping for Specifying Datasets
We are concerned with the following problem: How do we allow a community of users to access and process diverse data stored in many different formats? Standard data formats and da...
Luc Moreau, Yong Zhao, Ian T. Foster, Jens-S. V&ou...
ISSTA
2004
ACM
14 years 1 months ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
13 years 11 months ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
IPL
2008
102views more  IPL 2008»
13 years 7 months ago
The connection between two ways of reasoning about partial functions
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
John S. Fitzgerald, Cliff B. Jones
FSTTCS
2010
Springer
13 years 5 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To