This paper presents a case for the use of higher-order logic as a foundation for computational logic. A suitable polymorphically-typed, higher-order logic is introduced and its syntax and proof theory briefly described. In addition, a metric space of closed terms suitable for knowledge representation purposes is presented. The approach to representing individuals is illustrated with some examples, as is the technique of programming with abstractions. The paper concludes by placing the results in the wider context of previous and current research in the use of higherorder logic in computational logic. © 2002 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Lloyd, J. W. (2002). Higher-order computational logic. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2407, 105–137. https://doi.org/10.1007/3-540-45628-7_6
Mendeley helps you to discover research relevant for your work.