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

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical structures in computer science Vol. 29; no. 8; pp. 1309 - 1343
Main Authors:	MOMIGLIANO, ALBERTO, PIENTKA, BRIGITTE, THIBODEAU, DAVID
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.09.2019
Subjects:	Mechanization Programming languages Reasoning Semantics
ISSN:	0960-1295, 1469-8072
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!