On randomised strategies in the \(\lambda \)-calculus

DOI10.1016/j.tcs.2019.09.033zbMath1481.03004arXiv1805.03934OpenAlexW2976884326MaRDI QIDQ1989325

Ugo Dal Lago, Gabriele Vanoni

Publication date: 21 April 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.03934

zbMATH Keywords

reduction strategies\( \lambda \)-calculusprobabilistic rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Perpetual reductions in \(\lambda\)-calculus
• On probabilistic term rewriting
• Probabilistic Termination
• Sub-λ-calculi, Classified
• Markov Chains
• Markov Chains
• Random Descent
• Term Rewriting and Applications
• On the Stochastic Matrices Associated with Certain Queuing Processes

This page was built for publication: On randomised strategies in the \(\lambda \)-calculus