Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

TCS
2002

favoriteEmaildiscussreport

69views Theoretical Computer Science» more TCS 2002»

Streams and strings in formal proofs

13 years 4 months ago

Streams and strings in formal proofs

Download www.ihes.fr

Streams are acyclic directed subgraphs of the logical ow graph of a proof representing bundles of paths with the same origin and the same end. The notion of stream is used to describe the evolution of proofs during cut-elimination in purely algebraic terms. The algebraic and combinatorial properties of ow graphs emerging from our analysis serve to elucidate logical phenomena. However, the full logical signi

Alessandra Carbone

Real-time Traffic

Algebraic Terms | Logical Ow Graph | Ow Graphs | TCS 2002 | Theoretical Computer Science |

claim paper

Related Content

» Coinductive Proofs for Basic Real Computation

» An Immunological Approach to Change Detection Theoretical Results

» Effective Complexity and its Relation to Logical Depth

» Independent Parallel Compact Finite Automatons for Accelerating MultiString Matching

» Algorithmic Verification of SinglePass List Processing Programs

» On Deniability in the Common Reference String and Random Oracle Model

» Verifying Pointer and String Analyses with Region Type Systems

» Damaged BZip Files Are Difficult to Repair

» A decision procedure for subset constraints over regular languages

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	TCS
Authors	Alessandra Carbone

Comments (0)