An encoding of the $$\lambda $$-calculus in the String MultiSet Rewriting calculus
Acta Informatica · 2024-06 · 61 (2) · 161-181
DOI: 10.1007/s00236-024-00456-w ↗Kurz gefasst
Fachartikel in der Zeitschrift Acta Informatica, online erschienen am 13.03.2024. Verfasst von Attila Bagossy und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 21 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: EFOP.
Abstract (Originalsprache)
In this paper, we present an encoding of the $$\lambda $$ λ -calculus in a multiset rewriting system and provide a few applications of the construction. For this purpose, we choose the calculus named String MultiSet Rewriting, which was introduced in Barbuti et al. (Electron Notes Theor Comput Sci 194:19–34, 2008) by Barbuti et al. With the help of our encoding, we give alternative proofs for the standardization and the finiteness of developments theorems in the $$\lambda $$ λ -calculus.
Förderung
- EFOP
Zitieren
APA
Bagossy, A., & Battyányi, P. (2024). An encoding of the $$\lambda $$-calculus in the String MultiSet Rewriting calculus. Acta Informatica, 61(2), 161-181. https://doi.org/10.1007/s00236-024-00456-w
Vancouver
Bagossy A, Battyányi P. An encoding of the $$\lambda $$-calculus in the String MultiSet Rewriting calculus. Acta Informatica. 2024;61(2):161-181. doi:10.1007/s00236-024-00456-w
BibTeX
@article{Bagossy2024,
author = {Bagossy, Attila and Battyányi, Péter},
title = {An encoding of the $$\lambda $$-calculus in the String MultiSet Rewriting calculus},
journal = {Acta Informatica},
year = {2024},
volume = {61},
number = {2},
pages = {161--181},
doi = {10.1007/s00236-024-00456-w}
}
EUVIMED