Sciweavers

4573 search results - page 677 / 915
» Automated Reasoning
Sort
View
LICS
2008
IEEE
15 years 10 months ago
On the Expressiveness and Decidability of Higher-Order Process Calculi
In higher-order process calculi the values exchanged in communications may contain processes. A core calculus of higher-order concurrency is studied; it has only the operators nec...
Ivan Lanese, Jorge A. Pérez, Davide Sangior...
124
Voted
LICS
2008
IEEE
15 years 10 months ago
An Algebraic Process Calculus
We present an extension of the πI-calculus with formal sums of terms. The study of the properties of this sum reveals that its neutral element can be used to make assumptions abo...
Emmanuel Beffara
131
Voted
LICS
2008
IEEE
15 years 10 months ago
Cut Elimination for Monomial MALL Proof Nets
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
Olivier Laurent, Roberto Maieli
135
Voted
LICS
2008
IEEE
15 years 10 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
121
Voted
LICS
2008
IEEE
15 years 10 months ago
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence
We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible...
Taolue Chen, Wan Fokkink