Cargando…
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...
Autores principales: | Dal Lago, Ugo, Guerrieri, Giulio, Heijltjes, Willem |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7788600/ http://dx.doi.org/10.1007/978-3-030-45231-5_8 |
Ejemplares similares
-
Spinal Atomic Lambda-Calculus
por: Sherratt, David, et al.
Publicado: (2020) -
The calculi of lambda conversion (AM-6)
por: Church, Alonzo
Publicado: (1985) -
Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic
por: Faggian, Claudia, et al.
Publicado: (2021) -
Decomposed Collaborative Modeling Approach for Probabilistic Fatigue Life Evaluation of Turbine Rotor
por: Huang, Ying, et al.
Publicado: (2020) -
Algebras for Tree Decomposable Graphs
por: Bruni, Roberto, et al.
Publicado: (2020)