Sciweavers

2272 search results - page 291 / 455
» A Calculus for
Sort
View
CADE
2010
Springer
15 years 5 months ago
Monotonicity Inference for Higher-Order Formulas
Abstract. Formulas are often monotonic in the sense that if the formula is satisfiable for given domains of discourse, it is also satisfiable for all larger domains. Monotonicity i...
Jasmin Christian Blanchette, Alexander Krauss
134
Voted
APLAS
2010
ACM
15 years 4 months ago
Reasoning about Computations Using Two-Levels of Logic
We describe an approach to using one logic to reason about specifications written in a second logic. One level of logic, called the "reasoning logic", is used to state th...
Dale Miller
CORR
2010
Springer
132views Education» more  CORR 2010»
15 years 4 months ago
Acyclic Solos and Differential Interaction Nets
We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the pi-calculus. As a consequence, it is shown that ...
Thomas Ehrhard, Olivier Laurent
CORR
2008
Springer
90views Education» more  CORR 2008»
15 years 4 months ago
On characterising strong bisimilarity in a fragment of CCS with replication
We provide a characterisation of strong bisimilarity in a fragment of CCS that contains only prefix, parallel composition, synchronisation and a limited form of replication. The ch...
Daniel Hirschkoff, Damien Pous
AAECC
2006
Springer
102views Algorithms» more  AAECC 2006»
15 years 4 months ago
An effective proof of the well-foundedness of the multiset path ordering
The contribution of this paper is an effective proof of the well-foundedness of MPO, as a term of the Calculus of Inductive Constructions. This proof is direct, short and simple. ...
Solange Coupet-Grimal, William Delobel