Now showing items 1-1 of 1
On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms
(Springer, 2019) info:eu-repo/semantics/article,
The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursive specifications in Denotational Semantics. In this paper we discuss whether the hypothesis of the aforementioned result can be ...