Deducing type information from context in Ada based PDLs

Eran Gabber*, Amiram Yehudai

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

Abstract

An algorithm is described for deducing type information of partially declared objects in Ada-based PDLs (program design languages). The type information is deduced from the usage context of the objects. The algorithm tries to implement an insight into the design by checking every detail in the design using all available information deduced from its usage. In this way, the algorithm provides better type checking of incomplete designs, which allows earlier detection of design errors. The algorithm is intended to be a part of an Ada-based PDL processor. A prototype of this algorithm was implemented in Prolog. Some examples demonstrating the usefulness of the algorithm are given together with their resource consumption.

Original languageEnglish
Pages71-78
Number of pages8
StatePublished - 1988
EventThird Israel Conference on Computer Systems and Software Engineering - Tel-Aviv, Israel
Duration: 6 Jun 19887 Jun 1988

Conference

ConferenceThird Israel Conference on Computer Systems and Software Engineering
CityTel-Aviv, Israel
Period6/06/887/06/88

Cite this