Accession Number : AD0780354

Title :   Operational and Mathematical Semantics for Recursive Polyadic Program Schemata (Extended Abstract),


Personal Author(s) : De Roever,W. P.

Report Date : SEP 1973

Pagination or Media Count : 10

Abstract : The language PL for first-order recursive program schemes with call-by-value as parameter mechanism is described using models for sequential and independent parallel computation. The language MU for binary relations over cartesian products which has minimal fixed point operators is defined. An injection between PL and MU is specified together with the conditions subject to which this injection induces a translation. MU is axiomatized using a many-sorted generalization of TARSKI's axioms for binary relations, SCOTT's induction rule and fixed point axiom and new axioms to characterize projection functions, whence by the translation result a calculus for first-order program schemes is obtained. (Author)

Descriptors :   *Programming languages, *Semantics, *Mathematical logic, Recursive functions, Parallel processing, Computations, Set theory, Netherlands

Subject Categories : Linguistics
      Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE