Polymorphic Lemmas and Definitions in λProlog and Twelf: 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:3115:31, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,511 bytes +1,511‎ Created page with "Title: Polymorphic Lemmas and Definitions in λProlog and Twelf Research Question: How can we implement polymorphic lemmas and definitions in λProlog and Twelf, two popular higher-order logic programming languages? Methodology: We encoded a higher-order logic using an encoding that maps both terms and types of the object logic (higher-order logic) to terms of the metalanguage (λProlog). We discussed both the Terzo and Teyjus implementations of λProlog and compared..."
Retrieved from "https://simplesci.org/wiki/Polymorphic_Lemmas_and_Definitions_in_λProlog_and_Twelf"