Loading...
Decomposing Probabilistic Lambda-Calculi
A notion of probabilistic lambda-calculus usually comes with a prescribed reduction strategy, typically call-by-name or call-by-value, as the calculus is non-confluent and these strategies yield different results. This is a break with one of the main advantages of lambda-calculus: confluence, which...
Saved in:
| Published in: | Foundations of Software Science and Computation Structures |
|---|---|
| Main Authors: | , , |
| Format: | Artigo |
| Language: | Inglês |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7788600/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-45231-5_8 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|