3713 search results - page 375 / 743 » Constructing a Calculus of Programs |
127
click to vote
PEPM
1994
ACM
15 years 9 months ago
1994
ACM
Abstract. Selective eta-expansion is a powerful "binding-time improvement", i.e., a sourceprogram modification that makes a partial evaluator yield better results. But li...
137
click to vote
TYPES
1993
Springer
15 years 9 months ago
1993
Springer
Abstract. We explore the expressive power of the formalism called Natural Operational Semantics, NOS, introduced by Burstall and Honsell for defining the operational semantics of ...
171
Voted
PLANX
2007
15 years 6 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
159
click to vote
AAAI
2000
15 years 6 months ago
2000
Just as actions can have indirect effects on the state of the world, so too can sensing actions have indirect effects on an agent's state of knowledge. In this paper, we inve...
160
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...