Add to ORKGthis paper can be seen as yielding syntactic derivations of all operationally valid equational properties of recursion
AbstractIn this paper, we investigate the structural properties of the set of fixpoints for the clas...
We introduce the notion of well-founded recursive order-sorted equational logic (OS) theories modu...
International audienceFixed points of endofunctors play a central role in program semantics (initial...
Language textbooks give an approach to handling assignment and decision statements which is straight...
International audienceWe study the logical properties of the (parametric) well-founded fixed point o...
this paper are related to "program verification" very much like predicate logic and its co...
AbstractNew tools are presented for reasoning about properties of recursively defined domains. We wo...
AbstractThis paper is concerned with the existence and properties of various fixpoints of nondetermi...
A precise meaning is given to general recursive definitions of functionals of arbitrarily high type...
It is shown how Gödel's famous diagonal argument and a generalization of the recursion theorem are d...
AbstractThis paper is concerned with the equational logic of corecursion, that is of definitions inv...
AbstractThis paper continues the study of the general theory, begun in [4], of semantic domains base...
New tools are presented for reasoning about properties of recursively de ned domains. We work within...
International audienceWell-founded fixed points have been used in several areas of knowledge represe...
Abstract. We propose an axiomatization of fixpoint operators in typed call-by-value programming lang...
AbstractIn this paper, we investigate the structural properties of the set of fixpoints for the clas...
We introduce the notion of well-founded recursive order-sorted equational logic (OS) theories modu...
International audienceFixed points of endofunctors play a central role in program semantics (initial...
Language textbooks give an approach to handling assignment and decision statements which is straight...
International audienceWe study the logical properties of the (parametric) well-founded fixed point o...
this paper are related to "program verification" very much like predicate logic and its co...
AbstractNew tools are presented for reasoning about properties of recursively defined domains. We wo...
AbstractThis paper is concerned with the existence and properties of various fixpoints of nondetermi...
A precise meaning is given to general recursive definitions of functionals of arbitrarily high type...
It is shown how Gödel's famous diagonal argument and a generalization of the recursion theorem are d...
AbstractThis paper is concerned with the equational logic of corecursion, that is of definitions inv...
AbstractThis paper continues the study of the general theory, begun in [4], of semantic domains base...
New tools are presented for reasoning about properties of recursively de ned domains. We work within...
International audienceWell-founded fixed points have been used in several areas of knowledge represe...
Abstract. We propose an axiomatization of fixpoint operators in typed call-by-value programming lang...
AbstractIn this paper, we investigate the structural properties of the set of fixpoints for the clas...
We introduce the notion of well-founded recursive order-sorted equational logic (OS) theories modu...
International audienceFixed points of endofunctors play a central role in program semantics (initial...