Загрузка...
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...
Сохранить в:
| Опубликовано в: : | Foundations of Software Science and Computation Structures |
|---|---|
| Главные авторы: | , , |
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
2020
|
| Предметы: | |
| Online-ссылка: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7788600/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-45231-5_8 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|