Sciweavers

33 search results - page 6 / 7
» Deduction as Reduction
Sort
View
LPAR
2005
Springer
13 years 11 months ago
Strong Normalization of the Dual Classical Sequent Calculus
We investigate some syntactic properties of Wadler’s dual calculus, a term calculus which corresponds to classical sequent logic in the same way that Parigot’s λµ calculus co...
Daniel J. Dougherty, Silvia Ghilezan, Pierre Lesca...
CADE
1992
Springer
13 years 9 months ago
Linear-Input Subset Analysis
There are syntactically identifiable situations in which reduction does not occur in chain format linear deduction systems, i.e. situations in which linear-input subdeductions are ...
Geoff Sutcliffe
ENTCS
2007
91views more  ENTCS 2007»
13 years 5 months ago
Rule-Based Operational Semantics for an Imperative Language
Operational semantics for programming languages usually come in two flavours: big-step and small-step. Both are defined using deduction rules with a congruence rule allowing redu...
Florent Kirchner, François-Régis Sin...
DIAGRAMS
2004
Springer
13 years 11 months ago
Query Graphs with Cuts: Mathematical Foundations
Query graphs with cuts are inspired by Sowa’s conceptual graphs, which are in turn based on Peirce’s existential graphs. In my thesis ‘The Logic System of Concept Graphs with...
Frithjof Dau
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 3 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...