Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs
Two distinct research approaches have been proposed for assigning a purely extensional semantics to higher-order logic programming. The former approach uses classical domain theoretic tools while the latter builds on a fixed-point construction defined on a syntactic instantiation of the source progr...
| मुख्य लेखकों: | , , |
|---|---|
| स्वरूप: | लेख |
| भाषा: | English |
| प्रकाशित: |
Open Publishing Association
2015-09-01
|
| श्रृंखला: | Electronic Proceedings in Theoretical Computer Science |
| ऑनलाइन पहुंच: | http://arxiv.org/pdf/1509.03013v1 |