[logic-ml] Talk by John Power (U. Bath), Mon 15 Dec at UTokyo (Hongo)

[Ichiro Hasuo]

Dear colleagues,

John Power from U. Bath is visiting us and he is making a talk
Monday next week. Feel free to join us. See you there!

Best regards,
Ichiro Hasuo
http://www-mmm.is.s.u-tokyo.ac.jp/?plain=false&lang=en&pos=seminar

------------------------------

Mon 15 Dec 2014, 14:00-15:30

化学東館 236教室（理学部7号館の隣．ご存知ない方は先に理学部7号館415へお越しください）
Room 236, Chemistry Building East (“Kagaku-Higashikan”). Next to our
building (School of Science Bldg. No. 7)

アクセス： https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html （一番下）
Access: http://www-mmm.is.s.u-tokyo.ac.jp/ (see bottom)

John Power <http://www.bath.ac.uk/comp-sci/contacts/academics/john_power/>
(U. Bath), 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.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.fos.kuis.kyoto-u.ac.jp/pipermail/logic-ml/attachments/20141209/620474ab/attachment.html>