| Abstrakt: | Board games are an interesting domain. The rules must be such that a human can follow them, which places some limit on the allowed complexity of the game. On the other hand, describing rules in natural language allows for constructions that are difficult to express in usual programming languages. This provides a unique challange for the field of programming languages. In this thesis, we tackle precisely this problem and make first steps towards a programming language for board games. We devise a language that takes a unified approach to both declarative and imperative statements (which are both ubiquitous in board game rules).
|
|---|