Generic procedures: An implementation and an undecidability result

  • Authors:
  • Narain Gehani

  • Affiliations:
  • Bell Labs, Murray Hill, NJ 07974, U.S.A.

  • Venue:
  • Computer Languages
  • Year:
  • 1980

Quantified Score

Hi-index 0.00

Visualization

Abstract

Modern programming languages allow the user to define new data types. This increases the desirability of having generic procedures as they reduce programming effort and program size, allow for portability across types and are a means of abstraction. A simple but powerful notation for incorporating generic procedures in a language is proposed along with an efficient macro-like compile time technique for implementing them. Unfortunately, pathological recursive procedure call sequences create an undecidability problem for the suggested implementation technique. A proof is given for the above undecidability problem and practical remedies for avoiding it are suggested.