{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:19:06Z","timestamp":1742987946624,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642333132"},{"type":"electronic","value":"9783642333149"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33314-9_8","type":"book-chapter","created":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T00:05:18Z","timestamp":1347408318000},"page":"114-129","source":"Crossref","is-referenced-by-count":1,"title":["Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures"],"prefix":"10.1007","author":[{"given":"Rudolf","family":"Berghammer","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Fischer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-19422-3_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"R. Berghammer","year":"1988","unstructured":"Berghammer, R., Ehler, H., Zierer, H.: Development of Graph Algorithms by Program Transformation. In: G\u00f6ttler, H., Schneider, H.-J. (eds.) WG 1987. LNCS, vol.\u00a0314, pp. 206\u2013218. Springer, Heidelberg (1988)"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6423(99)00043-X","volume":"38","author":"R. Berghammer","year":"2000","unstructured":"Berghammer, R., Hoffmann, T.: Deriving relational programs for computing kernels by reconstructing a proof of Richardson\u2019s theorem. Sci. of Comput. Progr.\u00a038, 1\u201325 (2000)","journal-title":"Sci. of Comput. Progr."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0020-0255(01)00163-3","volume":"139","author":"R. Berghammer","year":"2001","unstructured":"Berghammer, R., Hoffmann, T.: Relational depth-first-search with applications. Inform. Sci.\u00a0139, 167\u2013186 (2001)","journal-title":"Inform. Sci."},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/11555964_4","volume-title":"Computer Algebra in Scientific Computing","author":"R. Berghammer","year":"2005","unstructured":"Berghammer, R., Neumann, F.: RelView \u2013 An OBDD-Based Computer Algebra System for Relations. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2005. LNCS, vol.\u00a03718, pp. 40\u201351. Springer, Heidelberg (2005)"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.entcs.2007.01.011","volume":"177","author":"R. Berghammer","year":"2007","unstructured":"Berghammer, R., Fischer, S.: Implementing relational specifications in a constraint functional language. Electr. Notes on Theor. Comput. Sci.\u00a0177, 169\u2013183 (2007)","journal-title":"Electr. Notes on Theor. Comput. Sci."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-642-13321-3_4","volume-title":"Mathematics of Program Construction","author":"R. Berghammer","year":"2010","unstructured":"Berghammer, R., Struth, G.: On Automated Program Construction and Verification. In: Bolduc, C., Desharnais, J., Ktari, B. (eds.) MPC 2010. LNCS, vol.\u00a06120, pp. 22\u201341. Springer, Heidelberg (2010)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-21070-9_10","volume-title":"Relational and Algebraic Methods in Computer Science","author":"R. Berghammer","year":"2011","unstructured":"Berghammer, R.: A Functional, Successor List Based Version of Warshall\u2019s Algorithm with Applications. In: de Swart, H. (ed.) RAMICS 2011. LNCS, vol.\u00a06663, pp. 109\u2013124. Springer, Heidelberg (2011)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(97)00087-2","volume":"63","author":"R. Bird","year":"1997","unstructured":"Bird, R., Ravelo, J.: On computing representatives. Inf. Proc. Lett.\u00a063, 1\u20137 (1997)","journal-title":"Inf. Proc. Lett."},{"key":"8_CR9","unstructured":"Bird, R.: Introduction to functional programming using Haskell, 2nd edn. Prentice Hall (1998)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/BFb0054287","volume-title":"Mathematics of Program Construction","author":"T. Brunn","year":"1998","unstructured":"Brunn, T., M\u00f6ller, B., Russling, M.: Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach. In: Jeuring, J. (ed.) MPC 1998. LNCS, vol.\u00a01422, pp. 96\u2013121. Springer, Heidelberg (1998)"},{"key":"8_CR11","series-title":"LNCS","first-page":"130","volume-title":"RAMiCS 2012","author":"N. Danilenko","year":"2012","unstructured":"Danilenko, N.: Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings. In: Kahl, W., Griffin, T.G. (eds.) RAMiCS 2012. LNCS, vol.\u00a07560, pp. 130\u2013145. Springer, Heidelberg (2012)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-56402-0_54","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Erwig","year":"1993","unstructured":"Erwig, M.: Graph Algorithms = Iteration + Data Structures? The Structure of Graph Algoritms and a Corresponding Style of Programming. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol.\u00a0657, pp. 277\u2013292. Springer, Heidelberg (1993)"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/258949.258955","volume":"32","author":"M. Erwig","year":"1997","unstructured":"Erwig, M.: Functional programming with graphs. ACM SIGPLAN Notices\u00a032, 52\u201365 (1997)","journal-title":"ACM SIGPLAN Notices"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1017\/S0956796801004075","volume":"11","author":"M. Erwig","year":"2001","unstructured":"Erwig, M.: Inductive graphs and functional graph algorithms. J. of Funct. Progr.\u00a011, 467\u2013492 (2001)","journal-title":"J. of Funct. Progr."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97 (Shortest path). Comm. of the ACM\u00a05, 345 (1962)","journal-title":"Comm. of the ACM"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/0205006","volume":"5","author":"M.L. Fredmann","year":"1976","unstructured":"Fredmann, M.L.: New bounds on the complexity of the shortest path problem. SIAM J. on Comput.\u00a05, 83\u201389 (1976)","journal-title":"SIAM J. on Comput."},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-60117-1_16","volume-title":"Mathematics of Program Construction","author":"J. Gibbons","year":"1995","unstructured":"Gibbons, J.: An Initial Algebra Approach to Directed Graphs. In: M\u00f6ller, B. (ed.) MPC 1995. LNCS, vol.\u00a0947, pp. 282\u2013303. Springer, Heidelberg (1995)"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19&20","author":"M. Hanus","year":"1994","unstructured":"Hanus, M.: The integration of functions into logic programming: From theory to practice. J. of Logic Progr.\u00a019&20, 583\u2013628 (1994)","journal-title":"J. of Logic Progr."},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11828563_16","volume-title":"Relations and Kleene Algebra in Computer Science","author":"W. Kahl","year":"2006","unstructured":"Kahl, W.: Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell. In: Schmidt, R.A. (ed.) RelMiCS\/AKA 2006. LNCS, vol.\u00a04136, pp. 235\u2013250. Springer, Heidelberg (2006)"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"King, D.J., Launchbury, J.: Structuring depth-first search algorithms in Haskell. In: Proc. ACM Symposium on Principles of Programming, pp. 344\u2013356. ACM Press (1995)","DOI":"10.1145\/199448.199530"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-59451-5_9","volume-title":"Advanced Functional Programming","author":"J. Launchbury","year":"1995","unstructured":"Launchbury, J.: Graph Algorithms with a Functional Flavour. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol.\u00a0925, pp. 308\u2013331. Springer, Heidelberg (1995)"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s002360050182","volume":"36","author":"J. Ravelo","year":"1999","unstructured":"Ravelo, J.: Two graph algorithms derived. Acta Informat.\u00a036, 489\u2013510 (1999)","journal-title":"Acta Informat."},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0167-6423(95)00030-5","volume":"26","author":"M. Russling","year":"1996","unstructured":"Russling, M.: Deriving a class of layer-oriented graph algorithms. Sci. of Comput. Progr.\u00a026, 117\u2013132 (1996)","journal-title":"Sci. of Comput. Progr."},{"key":"8_CR24","unstructured":"Schmidt, G., Str\u00f6hlein, T.: Relations and graphs. Discrete Mathematics for Computer Scientists. EATCS Monographs on Theoretical Computer Science. Springer (1993)"},{"key":"8_CR25","first-page":"314","volume":"1","author":"G. Schmidt","year":"2004","unstructured":"Schmidt, G.: A proposal for a multilevel relational reference language. J. of Relat. Meth. in Comput. Sci.\u00a01, 314\u2013338 (2004)","journal-title":"J. of Relat. Meth. in Comput. Sci."},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-540-78913-0_26","volume-title":"Relations and Kleene Algebra in Computer Science","author":"G. Schmidt","year":"2008","unstructured":"Schmidt, G.: Rectangles, Fringes, and Inverses. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) RelMiCS\/AKA 2008. LNCS, vol.\u00a04988, pp. 352\u2013366. Springer, Heidelberg (2008)"},{"key":"8_CR27","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Num. Math.\u00a013, 354\u2013356 (1969)","journal-title":"Num. Math."},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"73","DOI":"10.2307\/2268577","volume":"6","author":"A. Tarski","year":"1941","unstructured":"Tarski, A.: On the calculus of relations. J. of Symb. Logic\u00a06, 73\u201389 (1941)","journal-title":"J. of Symb. Logic"},{"key":"8_CR29","unstructured":"Thomson, S.: Haskell \u2013 The craft of functional programming. Addison-Wesley (1999)"},{"key":"8_CR30","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"Warshall, S.: A theorem on Boolean matrices. J. of the ACM\u00a09, 11\u201312 (1962)","journal-title":"J. of the ACM"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33314-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:05:34Z","timestamp":1558299934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33314-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642333132","9783642333149"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33314-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}