We address the problem of transforming typed functional programs into relational form. In this form a program can be run in various ``directions'' with various arguments left free, making it possible to acquire different behaviors from a single specification. We present an implementation of relational convertor for the subset of Objective Caml and evaluate it on a number of benchmarks, obtaining some relational programs never written before.
Conference DayThu 7 SepDisplayed time zone: Belfast change
14:00 - 15:15
|Typer: an infix statically typed Lisp|
|Relational conversion for OCaml|
|Towards abductive functional programming|
Koko MuroyaUniversity of Birmingham, UK