Abstract John Power

Coalgebraic Logic Programming: from Semantics to Implementation;
embracing the laxness

(joint with Ekaterina Komendantskaya)

  Coinductive definitions, such as that of an infinite stream, may
  often be described by elegant logic programs, but ones for which
  SLD-refutation is of no value as SLD-derivations fall into infinite
  loops.  Such definitions give rise to questions of lazy corecursive
  derivations and parallelism, as execution of such logic programs can
  have both recursive and corecursive features at once. Observational
  and coalgebraic semantics have been used to study them
  abstractly. However, the programming developments have often
  occurred separately and have usually been implementation-led.

  Here, we start to give a coherent semantics-led account of the
  issues, proceeding from abstract category theoretic semantics and
  developing coalgebra to try to characterise naturally arising
  trees. As part of the project but not presented in this talk, the
  work is proceeding towards implementation of a new dialect, CoALP,
  of logic programming, characterised by guarded lazy corecursion and
  parallelism.


Share this page:

Contact details

Department of Mathematics
University of Leicester
University Road
Leicester LE1 7RH
United Kingdom

Tel.: +44 (0)116 229 7407

Campus Based Courses

Undergraduate: mathsug@le.ac.uk
Postgraduate Taught: mathspg@le.ac.uk

Postgraduate Research: pgrmaths@le.ac.uk

Distance Learning Course  

Actuarial Science:

DL Study

Student complaints procedure

AccessAble logo

The University of Leicester is committed to equal access to our facilities. DisabledGo has detailed accessibility guides for College House and the Michael Atiyah Building.