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

  • Shin-ya Katsumata
Conference paper

DOI: 10.1007/978-3-540-27836-8_70

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3142)
Cite this paper as:
Katsumata S. (2004) A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems. In: Díaz J., Karhumäki J., Lepistö A., Sannella D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg

Abstract

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].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Shin-ya Katsumata
    • 1
  1. 1.Laboratory for Foundations of Computer Science, School of InformaticsThe University of EdinburghEdinburghUK

Personalised recommendations