Strategic Computation and Deduction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2008

Strategic Computation and Deduction


We introduce the notion of abstract strategies for abstract reduction systems. Adequate properties of termination, confluence and normalization under strategy can then be defined. Thanks to this abstract concept, we draw a parallel between strategies for computation and strategies for deduction. We define deduction rules as rewrite rules, a deduction step as a rewriting step and a proof construction step as a narrowing step in an adequate abstract reduction system. Computation, deduction and proof search are thus captured in the uniform foundational concept of abstract reduction system in which abstract strategies have a clear formalisation.
Fichier principal
Vignette du fichier
strategic-3K.pdf (490.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00433745 , version 1 (20-11-2009)


  • HAL Id : inria-00433745 , version 1


Claude Kirchner, Florent Kirchner, Helene Kirchner. Strategic Computation and Deduction. Christoph Benzmüller and Chad E. Brown and Jörg Siekmann and Richard Statman. Reasoning in Simple Type Theory. Festchrift in Honour of Peter B. Andrews on His 70th Birthday, 17, College Publications, pp.339-364, 2008, Studies in Logic and the Foundations of Mathematics, 978-1-904987-70-3. ⟨inria-00433745⟩
283 View
100 Download


Gmail Facebook Twitter LinkedIn More