479 search results - page 25 / 96 » The theory and calculus of aliasing |
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equ...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Behavioral theory for higher-order process calculi is less well developed than for first-order ones such as the π-calculus. In particular, effective coinductive characterization...
CADE
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
ICFP
2005
ACM
14 years 7 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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI. CBI differs from exi...