Sciweavers

2152 search results - page 29 / 431
» On Automating the Calculus of Relations
Sort
View
70
Voted
CSL
2002
Springer
15 years 11 days ago
On Generalizations of Semi-terms of Particularly Simple Form
Abstract. We show that Gentzen's sequent calculus admits generalization of semi-terms of particularly simple form. This theorem extends one of the main results in [BS95] to la...
Matthias Baaz, Georg Moser
96
Voted
LICS
2007
IEEE
15 years 6 months ago
Strong Normalization as Safe Interaction
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...
Colin Riba
79
Voted
LICS
2007
IEEE
15 years 6 months ago
Environmental Bisimulations for Higher-Order Languages
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
HYBRID
1992
Springer
15 years 4 months ago
A Formal Approach to Computer Systems Requirements Documentation
This paper demonstrates how the extended duration calculus [4] can be used to support the approach to documentation of computer systems presented by in [1]. This approach uses the ...
Marcin Engel, Marcin Kubica, Jan Madey, David Lorg...
134
Voted
AI
2011
Springer
14 years 7 months ago
A unifying action calculus
Abstract McCarthy’s Situation Calculus is arguably the oldest special-purpose knowledge representation formalism, designed to axiomatize knowledge of actions and their effects. ...
Michael Thielscher