License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2022.17
URN: urn:nbn:de:0030-drops-162987
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16298/
Faggian, Claudia ;
Guerrieri, Giulio
Strategies for Asymptotic Normalization
Abstract
We present an abstract technique to study normalizing strategies when termination is asymptotic, that is, it appears as a limit. Asymptotic termination occurs in several settings, such as effectful, and in particular probabilistic computation - where the limits are distributions over the possible outputs - or infinitary lambda-calculi - where the limits are infinitary terms such as Böhm trees.
As a concrete application, we obtain a result which is of independent interest: a normalization theorem for Call-by-Value (and - in a uniform way - for Call-by-Name) probabilistic lambda-calculus.
BibTeX - Entry
@InProceedings{faggian_et_al:LIPIcs.FSCD.2022.17,
author = {Faggian, Claudia and Guerrieri, Giulio},
title = {{Strategies for Asymptotic Normalization}},
booktitle = {7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022)},
pages = {17:1--17:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-233-4},
ISSN = {1868-8969},
year = {2022},
volume = {228},
editor = {Felty, Amy P.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16298},
URN = {urn:nbn:de:0030-drops-162987},
doi = {10.4230/LIPIcs.FSCD.2022.17},
annote = {Keywords: rewriting, strategies, normalization, lambda calculus, probabilistic rewriting}
}
|
Keywords: |
|
rewriting, strategies, normalization, lambda calculus, probabilistic rewriting |
|
Collection: |
|
7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
28.06.2022 |
