Extensional Higher-Order Logic Programming

DOI10.1145/2499937.2499942zbMath1353.68031arXiv1106.3457OpenAlexW1591526886MaRDI QIDQ2946709

Panagiotis Rondogiannis, Angelos Charalambidis, Konstantinos Handjopoulos, William W. Wadge, Panos Rondogiannis

Publication date: 17 September 2015

Published in: Logics in Artificial Intelligence, ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.3457

zbMATH Keywords

extensionalitydenotational semanticsalgebraic latticeshigher-order logic programming

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (8)

Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs ⋮ The intricacies of three-valued extensional semantics for higher-order logic programs ⋮ The Expressive Power of Higher-Order Datalog ⋮ In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming ⋮ Unnamed Item ⋮ Equivalence of two fixed-point semantics for definitional higher-order logic programs ⋮ A fixed point theorem for non-monotonic functions ⋮ Extensional Semantics for Higher-Order Logic Programs with Negation

This page was built for publication: Extensional Higher-Order Logic Programming