BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260921T003246Z
UID:Seminar-dept-459@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20180320T130000
DTEND:20180320T140000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Temur Kutsia: Pattern-based calculi with finitary matching\n\nFinitary matching problems are those that have finitely many solutions. Pattern calculi generalize the lambda-calculus, replacing the abstraction over variables by an abstraction over terms that are called patterns. Consequently, reduction requires solving a pattern matching problem. The framework we describe in this talk considers the case when such problems are finitary. It is parametrized by the solving function, which is responsible for computing solutions to the matching problems. A concrete instance of the function gives a concrete version of the pattern calculus. We impose conditions on the solving function, obtaining a generic confluence proof for a class of pattern calculi with finitary matching. Instances of the solving function are presented.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=459
LOCATION:Ashton Lecture Theater
END:VEVENT
END:VCALENDAR