Uloženo v:
Podrobná bibliografie
Hlavní autoři: Momigliano, Alberto, Sassella, Martina
Médium: Preprint
Vydáno: 2024
Témata:
On-line přístup:https://arxiv.org/abs/2404.14921
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
_version_ 1866907878864977920
author Momigliano, Alberto
Sassella, Martina
author_facet Momigliano, Alberto
Sassella, Martina
contents We report on yet another formalization of the Church-Rosser property in lambda-calculi, carried out with the proof environment Beluga. After the well-known proofs of confluence for beta-reduction in the untyped settings, with and without Takahashi's complete developments method, we concentrate on eta-reduction and obtain the result for beta-eta modularly. We further extend the analysis to typed-calculi, in particular System F. Finally, we investigate the idea of pursuing the encoding directly in Beluga's meta-logic, as well as the use of Beluga's logic programming engine to search for counterexamples.
format Preprint
id arxiv_https___arxiv_org_abs_2404_14921
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle More Church-Rosser Proofs in BELUGA
Momigliano, Alberto
Sassella, Martina
Logic in Computer Science
Programming Languages
We report on yet another formalization of the Church-Rosser property in lambda-calculi, carried out with the proof environment Beluga. After the well-known proofs of confluence for beta-reduction in the untyped settings, with and without Takahashi's complete developments method, we concentrate on eta-reduction and obtain the result for beta-eta modularly. We further extend the analysis to typed-calculi, in particular System F. Finally, we investigate the idea of pursuing the encoding directly in Beluga's meta-logic, as well as the use of Beluga's logic programming engine to search for counterexamples.
title More Church-Rosser Proofs in BELUGA
topic Logic in Computer Science
Programming Languages
url https://arxiv.org/abs/2404.14921