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]. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Katsumata, S. Y. (2004). A generalisation of pre-logical predicates to simply typed formal systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3142, 831–845. https://doi.org/10.1007/978-3-540-27836-8_70
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
