A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
From MaRDI portal
Publication:3985547
DOI10.1093/logcom/1.4.497zbMath0738.68016WikidataQ64216211 ScholiaQ64216211MaRDI QIDQ3985547
No author found.
Publication date: 27 June 1992
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1607&context=cis_reports
quantification; unification algorithm; correctness of interpretation; correctness of unification; restricted \(\beta\)-conversion; untyped unification and interpretation
68N17: Logic programming
Related Items
Higher-order matching for program transformation, Higher-order rewrite systems and their confluence, Unification under a mixed prefix, Unification with extended patterns, Implementing tactics and tacticals in a higher-order logic programming language, A proof procedure for the logic of hereditary Harrop formulas, Reduction and unification in lambda calculi with a general notion of subtype, A semantics for \(\lambda \)Prolog, Correspondences between classical, intuitionistic and uniform provability, Efficient resource management for linear logic proof search, Higher-order substitutions, Nominal unification
Uses Software