79 search results - page 1 / 16 » A Natural Deduction Approach to Dynamic Logic |
TYPES
1995
Springer
13 years 8 months ago
1995
Springer
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
IJCAI
1997
13 years 6 months ago
1997
The paper describes a transition logic, TL, and a deductive formalism for it. It shows how various important aspects (such as ramification, qualification, specificity, simultaneit...
ESOP
2005
Springer
13 years 10 months ago
2005
Springer
Program slicing is a well-known methodology that aims at identifying the program statements that (potentially) affect the values computed at some point of interest. Within imperat...
CADE
1999
Springer
13 years 9 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
LANMR
2007
13 years 6 months ago
2007
Teaching engineering students courses such as computer science theory, automata theory and discrete mathematics took us to realize that introducing basic notions of logic, especial...