Confluence and Convergence in Probabilistically Terminating Reduction Systems

September 15, 2017 Β· Declared Dead Β· πŸ› International Workshop/Symposium on Logic-based Program Synthesis and Transformation

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Maja H. Kirkeby, Henning Christiansen arXiv ID 1709.05123 Category cs.PL: Programming Languages Cross-listed cs.LO Citations 8 Venue International Workshop/Symposium on Logic-based Program Synthesis and Transformation Last Checked 3 months ago
Abstract
Convergence of an abstract reduction system (ARS) is the property that any derivation from an initial state will end in the same final state, a.k.a. normal form. We generalize this for probabilistic ARS as almost-sure convergence, meaning that the normal form is reached with probability one, even if diverging derivations may exist. We show and exemplify properties that can be used for proving almost-sure convergence of probabilistic ARS, generalizing known results from ARS.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Programming Languages

Died the same way β€” πŸ‘» Ghosted