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...

Celý popis

Podrobná bibliografia

Vydané v:	Mathematical structures in computer science Ročník 29; číslo 8; s. 1309 - 1343
Hlavní autori:	MOMIGLIANO, ALBERTO, PIENTKA, BRIGITTE, THIBODEAU, DAVID
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cambridge, UK Cambridge University Press 01.09.2019
Predmet:	Mechanization Programming languages Reasoning Semantics
ISSN:	0960-1295, 1469-8072
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!