174 search results - page 31 / 35 » Directional Type Checking of Logic Programs |
135
click to vote
PPDP
2010
Springer
15 years 10 days ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
147
click to vote
EON
2008
15 years 3 months ago
2008
We reuse here the framework, the setting, and the semantic modelling for the automated synthesis of the SWS Challenge Mediator presented in the companion paper [5], and show how to...
158
Voted
IFIP
2010
Springer
14 years 9 months ago
2010
Springer
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with "strangers". This makes ...
138
click to vote
POPL
2010
ACM
15 years 12 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
155
click to vote
MCMASTER
1993
15 years 6 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...