Compile-Time Type-Matching

Open Access
Publisher Website
Google Scholar
Abstract
Run-time type-matching is an inefficient process which can be avoided by a suitably structured language. A procedure is outlined for analyzing a program at compile-time to determine the types of all its expressions and to insert transfer functions on them where necessary. This is given a systematic basis by treating the available types as a partially ordered set. Applications are illustrated from CPL. The treatment is extended to cover structures, arrays and procedures.

This publication has 0 references indexed in Scilit: