Higher-Order Logic Programming

14 September 2020

The talk will be about λProlog--a higher-order logic programming language. It augments logic programming with higher-order programming which makes it possible to natively support HOAS to facilitate working with variable bindings. Higher-order unification is undecidable, but there is a subset of the language for which unification can always be computed. I will talk about the benefits of the higher-order programming and how the higher-order unification is implemented

Speaker: Ekaterina Verbitskaia

λProlog site: http://www.lix.polytechnique.fr/~dale/lProlog
Teyjus: λProlog implementation: http://teyjus.cs.umn.edu/
Book "Programming with Higher-Order Logic" https://sites.google.com/site/proghol/

The seminar will be held in google meet on Monday September 14 at 17:15 (google meet room: https://meet.google.com/myu-dhmz-gvu)