Logic programming beyond the classical Horn clause theories
3 posts
We discuss the influences of structural proof theory on logic programming and vice versa. Attachments Abstract Dale Miller (87 kB)
We discuss the problem of cut elimination in an intuitionistic version of Church’s Type Theory with constraints, a problem that arises in considering executable fragments suitable for logic programming. Attachments Abstract Olivier Hermant and James Lipton (129 kB)