Automata, Languages and Programming

Volume 3142 of the series Lecture Notes in Computer Science pp 831-845

A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems

  • Shin-ya KatsumataAffiliated withLaboratory for Foundations of Computer Science, School of Informatics, The University of Edinburgh

* Final gross prices may vary according to local VAT.

Get Access


We generalise the notion of pre-logical predicates [HS02] to arbitrary simply typed formal systems and their categorical models. We establish the basic lemma of pre-logical predicates and composability of binary pre-logical relations in this generalised setting. This generalisation takes place in a categorical framework for typed higher-order abstract syntax and semantics [Fio02,MS03].