Redex -> Coq: towards a theory of decidability of Redex's reduction semantics

We propose the first steps in the development of a tool to automate the translation of Redex models into a (hopefully) semantically equivalent model in Coq, and to provide tactics to help in the certification of fundamental properties of such models. The work is heavily based on a model of Redex...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-02
Hauptverfasser:	Soldevila, Mallku, Ribeiro, Rodrigo, Ziliani, Beta
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Mechanization Semantics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!