A Generalization of Equational Proof Theory? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2002

A Generalization of Equational Proof Theory?

Abstract

Recently rule based languages focused on the use of rewriting as a modeling tool which results in making specifications executable. To extend the modeling capabilities of rule based languages, we explored in a previous work the possibility of making the rule applications subject to probabilistic choices, and started to study the generalization of the results in the rewriting community about abstract reduction systems to systems with probabilistic choices. This paper presents a new contribution on this line by presenting a generalization of classical equational proof theory. We obtain a nice proof theory which is sound and complete, and which has initial models.

Domains

Other [cs.OH]
No file

Dates and versions

inria-00101069 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00101069 , version 1

Cite

Olivier Bournez. A Generalization of Equational Proof Theory?. [Intern report] A02-R-333 || bournez02e, 2002, 2 p. ⟨inria-00101069⟩
116 View
0 Download

Share

Gmail Facebook X LinkedIn More