A Treatment of Higher-Order Features in Logic Programming: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 15:4515:45, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,629 bytes +1,629‎ Created page with "Title: A Treatment of Higher-Order Features in Logic Programming Research Question: How can higher-order notions be effectively incorporated into logic programming, and what are the implications of this approach? Methodology: The authors propose using the terms of a typed lambda calculus as representational devices and implementing a richer form of unification for probing their structures. They address three main issues: suitable encoding of lambda terms, handling bran..."
Retrieved from "https://simplesci.org/wiki/A_Treatment_of_Higher-Order_Features_in_Logic_Programming"