Well-definedness and observational equivalence for inductive–coinductive programs

DOI10.1093/LOGCOM/EXV091zbMATH Open1452.68044OpenAlexW2340067173MaRDI QIDQ5225850FDOQ5225850

Authors: Henning Basold, Helle Hvid Hansen 

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

Recommendations

• Program equivalence is coinductive
• Inductive completeness of logics of programs
• Inductive Logic Programming
• scientific article; zbMATH DE number 1670488
• scientific article; zbMATH DE number 2061716
• Deductive and inductive synthesis of equational programs
• scientific article; zbMATH DE number 2247255
• Inductive assertions and operational semantics

zbMATH Keywords

productivityobservational equivalenceterminationinductive typescoinductive typestesting logic

Mathematics Subject Classification ID

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

Cited In (2)

• Title not available (Why is that?)
• Mixed Inductive/Coinductive Types and Strong Normalization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225850)