Well-definedness and observational equivalence for inductive–coinductive programs

DOI10.1093/LOGCOM/EXV091zbMath1452.68044OpenAlexW2340067173MaRDI QIDQ5225850

Helle Hvid Hansen, Henning Basold

Publication date: 29 July 2019

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exv091

zbMATH Keywords

productivityterminationinductive typesobservational equivalencecoinductive typestesting logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Categorical semantics of formal languages (18C50) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

This page was built for publication: Well-definedness and observational equivalence for inductive–coinductive programs