Reasoning algebraically about recursion

DOI10.1016/0167-6423(92)90019-8zbMath0769.68094OpenAlexW2063172650MaRDI QIDQ1193743

S. Singh

Publication date: 27 September 1992

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(92)90019-8

zbMATH Keywords

reasoningTarski's fixed point theoremrecursive programsweak-op- inverses

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Correctness of fixpoint transformations ⋮ Normal form approach to compiler design

This page was built for publication: Reasoning algebraically about recursion