Mathematical Semantics for Higher Order Programming Languages.

Abstract

Complete operational and mathematical semantics are presented for a higher order applicative algorithmic language (BAL). Both semantics involve partially ordered domains closed under limits of convergent sequences. Procedure calls are formalized via lambda calculus reductions, or copy rule. Evaluations involve a more general form of computability described as nondeterministic computability. The mathematical semantics is obtained via embeddings in reflexive domains. Both semantics are proved to be equivalent, and several applications are given. The adequacy of the copy rule is proved in standard situations where computability is deterministic. Several examples are presented. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1980
Accession Number
ADA089733

Entities

People

  • Luis E. Sanchis

Organizations

  • Syracuse University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Air Force
  • Calculus
  • Computational Science
  • Computations
  • Computer Languages
  • Computer Programming
  • Computer Science
  • Construction
  • Embedding
  • Formal Languages
  • Identities
  • Information Science
  • Language
  • Programming Languages
  • Recursive Functions
  • Sequences
  • Test And Evaluation

Fields of Study

  • Mathematics

Readers

  • Computational Linguistics
  • Mathematical Modeling and Probability Theory.