Sciweavers

3552 search results - page 157 / 711
» Proof theory in the abstract
Sort
View
LPAR
2007
Springer
16 years 17 days ago
Completeness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
Marc Bezem, Tore Langholm, Michal Walicki
CONCUR
2005
Springer
15 years 12 months ago
A Theory of System Behaviour in the Presence of Node and Link Failures
d Abstract) Adrian Francalanza and Matthew Hennessy University of Sussex, Falmer Brighton BN1 9RH, England Abstract. We develop a behavioural theory of distributed programs in the ...
Adrian Francalanza, Matthew Hennessy
POPL
2009
ACM
16 years 7 months ago
Focusing on pattern matching
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows ...
Neelakantan R. Krishnaswami
FSEN
2007
Springer
16 years 18 days ago
Logical Bisimulations and Functional Languages
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be the proof of congruence and, related to this, enhancements of the bisimul...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
LFCS
2007
Springer
16 years 17 days ago
The Intensional Lambda Calculus
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
Sergei N. Artëmov, Eduardo Bonelli