Metraipolis › archive › dc_9bd627d8ecff
Comparing Call-by-Name and Call-by-Value Reduction and Reduction Strategies in Calculi for Classical Logic — arXiv:2608.11927
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.11927
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T05:53:11.891Z
- SHA-256 of the archived text
bd8e99a16a1a8f2192b7bef75c3ae451bf98d4695879ed04c4272d32856bb57e- Stable URL of this page
https://metraipolis.com/documento/dc_9bd627d8ecff
How to cite
Comparing Call-by-Name and Call-by-Value Reduction and Reduction Strategies in Calculi for Classical Logic — arXiv:2608.11927 — arXiv (en), https://arxiv.org/abs/2608.11927 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9bd627d8ecff (Metraipolis archive dc_9bd627d8ecff, sha256 bd8e99a16a1a8f2192b7bef75c3ae451bf98d4695879ed04c4272d32856bb57e)
BibTeX
@misc{dc9bd627d8ecff,
title = {Comparing Call-by-Name and Call-by-Value Reduction and Reduction Strategies in Calculi for Classical Logic — arXiv:2608.11927},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.11927},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9bd627d8ecff; sha256 bd8e99a16a1a8f2192b7bef75c3ae451bf98d4695879ed04c4272d32856bb57e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.11927. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We define call-by-name and call-by-value reduction and reduction strategies for the calculi slmu (symmetric lmu), lmmt, and Xs (X with implicit substitution). We establish a strong relation between these notions through defining a single interpretation from slmu to lmmt that respects normal reduction, as well as the call-by-name and call-by-value reduction in slmu within the their counterpart in lmmt; for the strategies, we will show similar, but weaker results. We also define a single mapping from lmmt to Xs, and show that this also respects all three notions. We then continue with studying the natural encoding of Xs into lmmt, and show that only full reduction is respected, but that reduction steps are needed to model substitution, so the CBN and CBV strategies cannot be respected. We conclude with studying the combination of our efforts and define an interpretation of slmu into Xs, and show that CBN and CBV reduction are respected. This result underlines that Xs and lmmt are similar, but different calculi, and that the nature of slmu makes that any encoding into either can never fully respect the strategies. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-13 in cs.LO). Categorie arXiv: Logic in Computer Science (cs.LO). Pagina del lavoro: https://arxiv.org/abs/2608.11927 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T05:48:53.031Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).