Accession Number:

ADA193645

Title:

Practical Higher-Order Functional and Logic Programming Based on Lambda-Calculus and Set-Abstraction,

Descriptive Note:

Corporate Author:

NORTH CAROLINA UNIV AT CHAPEL HILL DEPT OF COMPUTER SCIENCE

Personal Author(s):

• Silbermann, Frank S.
• Jayaraman, Bharat

Report Date:

1988-01-01

Pagination or Media Count:

12.0

Abstract:

The authors propose new variation of relative set abstraction as an extension to a lambdacalculus based functional language. This feature interacts orthogonally with the standard functional language capabilities, yet provides the full expressive power of first-order Horn-logic programming, as well as a very useful subset of higher-order Horn-logic programming. This resulting language lends itself to efficient interpretation, in that complete operational procedures are possible without computationally expensive primitives such as higher-order unification, unification relative to an equational theory, or general theorem-proving.

Descriptors:

• *HIGH LEVEL LANGUAGES
• VARIATIONS
• COMPUTER LOGIC

Subject Categories:

• Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE