Visualizing and writing variable-free compositional relational programs

Representing argument binding in compositional relational programs is an issue due to the syntactic problems. We first present our former research on using visualization to overcome this problem, and relevant user studies, and go on to discuss our recent work on syntactic improvements in solving the same problem. We are looking forward to feedback on this early stage research.

Gorkem studied his masters degree in Abertay Dundee in Computer Games Technology, delivering a thesis on Optimizing collision detection in games. After working in games for a while, he started studying towards a doctorate degree in Uppsala University, Sweden. His study focuses on the representation of relational programming languages.


Event details

  • When: 20th May 2015 14:00 - 15:00
  • Where: Cole 1.33a
  • Format: Seminar