2272 search results - page 255 / 455 » A Calculus for |
164
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
135
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
109
click to vote
BIRTHDAY
2009
Springer
15 years 11 months ago
2009
Springer
In previous work, we proposed a modal fragment of the situation calculus called ES, which fully captures Reiter’s basic action theories. ES also has epistemic features, includin...
123
click to vote
CCS
2009
ACM
15 years 11 months ago
2009
ACM
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
138
click to vote
FOSSACS
2009
Springer
15 years 11 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...