Streams and strings in formal proofs

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

• Type: Journal
• Year: 2002
• Where: TCS
• Authors: Alessandra Carbone
• Keywords: Algebraic Terms, Logical Ow Graph, Ow Graphs, TCS 2002, Theoretical Computer Science