15 citations · 18 across the 8 of their papers we have counts for
8 papers
Which algorithm to select in sports timetabling?
David Van Bulck, Dries Goossens, Jan-Patrick Clarner +7
Any sports competition needs a timetable, specifying when and where teams meet each other. The recent International Timetabling Competition (ITC2021) on sports timetabling showed t…
Solving Interactive Fiction Games via Partial Evaluation and Bounded Model Checking
Martin Mariusz Lester
We present a case study on using program verification tools, specifically model-checkers for C programs, to solve simple interactive fiction games from around 1980. Off-the-shelf m…
What can a 1980s BASIC programming textbook teach us today?
Martin Lester
Elementary Basic, published in 1982, is an introductory programming text with a novel central conceit, namely that the fictional 19th century detective Sherlock Holmes used a compu…
Analysis of MiniJava Programs via Translation to ML
Martin Mariusz Lester
MiniJava is a subset of the object-oriented programming language Java. Standard ML is the canonical representative of the ML family of functional programming languages, which inclu…
Verifying Liveness Properties of ML Programs
M. M. Lester, R. P. Neatherway, C. -H. L. Ong +1
Higher-order recursion schemes are a higher-order analogue of Boolean Programs; they form a natural class of abstractions for functional programs. We present a new, efficient algor…
Understanding the Expressive Power of Unhygienic Substitution in Metaprogramming via Combinatory Logic
Martin Lester
Recent work on combinatory logic demonstrates a compositional translation from lambda calculus that gives meaning to open terms. As the meaning of open terms is a key difficulty in…