@article{8b6f829bfb1544dcaccdfa55d73d4df4,
title = "Look Ma, Backtracking without Recursion Dedicated to my colleague Ruurd Kuiper, on the occasion of his retirement",
abstract = "I show how backtracking can be discovered naturally without using a recursive function (nor using a loop with an explicit stack). Rather, my approach involves a form of self application that can be elegantly expressed in an object-oriented program, and that is reminiscent of how recursion is done in lambda calculus. It also illustrates why reasoning about object-oriented pro- grams can be hard.",
keywords = "computer science, programming, object-oriented programming, functional programming, backtracking, recursion, fixed-point combinator, self-application, functional, self application, object-oriented",
author = "Tom Verhoeff",
note = "T. Verhoeff is Assistant Professor in Computer Science at Eindhoven University of Technology, where he works in the group Software En- gineering & Technology. His research interests are support tools for verified software development and model driven engineering. He re- ceived the IOI Distinguished Service Award at IOI 2007 in Zagreb, Croatia, in particular for his role in setting up and maintaining a web archive of IOI-related material and facilities for communication in the IOI community, and in establishing, developing, chairing, and contrib- uting to the IOI Scientific Committee from 1999 until 2007.; International Olympiad in Informatics (IOI) Conference 2021 ; Conference date: 21-06-2021 Through 21-06-2021",
year = "2021",
month = jun,
day = "10",
doi = "10.15388/ioi.2021.10",
language = "English",
volume = "15",
pages = "119--132",
journal = "Olympiads in Informatics",
issn = "1822-7732",
publisher = "Vilnius University",
url = "https://ioi2021.sg/ioi-conference/",
}