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

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1988
Accession Number
ADA193645

Entities

People

  • Bharat Jayaraman
  • Frank S. Silbermann

Organizations

  • University of North Carolina at Chapel Hill

Tags

Communities of Interest

  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Calculus
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Environment
  • Generators
  • Language
  • North Carolina
  • Notation
  • Programming Languages
  • Semantics
  • Test And Evaluation

Readers

  • Computational Linguistics