Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Henk Doornbos"'
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 124:100730
Central to algorithmic graph theory are the concepts of acyclicity and strongly connected components of a graph, and the related search algorithms. This article is about combining mathematical precision and concision in the presentation of these conc
Publikováno v:
Theoretical Computer Science, 179(1-2), 103-135. Elsevier
Several concise formulations of mathematical induction are presented and proved equivalent. The formulations are expressed in variable-free relation algebra and thus are in terms of relations only, without mentioning the related objects. It is shown
Autor:
Henk Doornbos, Roland Backhouse
Publikováno v:
Science of Computer Programming, 26(1-3), 217-236. Elsevier
The notion of reductivity of a relation with respect to a datatype is introduced and related to inductivity and initiality. The use of reductivity in constructing terminating programs is discussed. A calculus of reductivity, discussed in more detail
Autor:
Henk Doornbos, Roland Backhouse
Datatype-generic programs are programs that are parameterised by a datatype. We review the allegorical foundations of a methodology of designing datatype-generic programs. The notion of F-reductivity, where F parametrises a datatype, is reviewed and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22f95cd9970a6657cb08277615b2d5e4
http://eprints.nottingham.ac.uk/1858/
http://eprints.nottingham.ac.uk/1858/
Autor:
Henk Doornbos, Roland Backhouse
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540436133
Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
Well-foundedness and inductive properties of relations are expressed in terms of fixed points. A class of fixed point equations, called "hylo" equations, is introduced. A methodology of recursive program design based on the use of hylo equations is p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a66bad86fc56929c1851fb6c189c3a2a
https://doi.org/10.1007/3-540-47797-7_6
https://doi.org/10.1007/3-540-47797-7_6
Publikováno v:
Relational Methods in Computer Science ISBN: 9783211829714
Relational Methods in Computer Science
Relational Methods in Computer Science
We are programmers, in the sense that it is our concern to improve the process of program construction. Therefore we want to answer questions like: What is programming, why is it so difficult and error-prone, and how can we learn what is needed to ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acbe24cf98f0454d3e8414a6222b5a2e
https://doi.org/10.1007/978-3-7091-6510-2_10
https://doi.org/10.1007/978-3-7091-6510-2_10
Autor:
A. J. M. van Gasteren, C.J. Aarts, Roland Backhouse, Paul F. Hoogendijk, Eerke Albert Boiten, T.S. Voermans, Henk Doornbos, J.C.S.P. van der Woude, H.P.J. van Geldrop van Eijk
Publikováno v:
Information Processing Letters, 53(3), 131-136. Elsevier
The aim of this paper is to present a small calculus of extreme fixed points and to show it in action. The fixed-point theorem that was the main incentive for writing this paper is the fusion theorem presented in Section 3. It exploits the calculatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1fb5d1614e5ef5fb67e08dfaf70c37db
https://research.tue.nl/nl/publications/bfb3de3b-268f-4429-962f-78021816f6b8
https://research.tue.nl/nl/publications/bfb3de3b-268f-4429-962f-78021816f6b8