A case study in programming coinductive proofs: Howe’s method

Bisimulation proofs play a central role in programming languages in establishing rich properties such as contextual equivalence. They are also challenging to mechanize, since they require a combination of inductive and coinductive reasoning on open terms. In this paper, we describe mechanizing the p...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Mathematical structures in computer science Jg. 29; H. 8; S. 1309 - 1343
Hauptverfasser:	MOMIGLIANO, ALBERTO, PIENTKA, BRIGITTE, THIBODEAU, DAVID
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cambridge, UK Cambridge University Press 01.09.2019
Schlagworte:	Mechanization Programming languages Reasoning Semantics
ISSN:	0960-1295, 1469-8072
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!