Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Programming Language Implementation and Logic Programming

PLILP 1990: Programming Language Implementation and Logic Programming pp 30–44Cite as

Inference-based overloading resolution for ADA

  • Algorithmic Programming
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 456))

Abstract

We present an incremental type inference and overloading resolution algorithm for ADA. The algorithm is used within a language-specific ADA editor; it is based on inference rules and order-sorted unification. The method is founded on the notion of context relations, a calculus for the incremental analysis of incomplete program fragments. This calculus has recently been extended for the analysis of user-defined polymorphic or overloaded objects, and the semantic analysis for ADA described in this paper was the first field test for the new extensions. Although overloading resolution in incomplete fragments in general is NP-complete, we have obtained an editor with reasonable response time behaviour for up to medium-sized programs.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7 References

  1. Bahlke, R. and Snelting, G.: The PSG system: from formal language definitions to interactive programming environments. ACM TOPLAS 8, 4 (October 1986), pp. 547–576.

    Google Scholar 

  2. Despeyroux, T.: Executable specification of static semantics. Proc. Semantics of data types, LNCS 173, pp. 215–233.

    Google Scholar 

  3. Reference manual for the ADA programming language. ANSI/MIL-STD 1815, January 1983.

    Google Scholar 

  4. Grosch, F.J.: Inferenzbasierte semantische Analyse für ADA. Diploma thesis, Technische Hochschule Darmstadt, Fachbereich Informatik, 1989 (in German).

    Google Scholar 

  5. Kahn, G.: Natural semantics. Proc. STACS 1987, LNCS 247.

    Google Scholar 

  6. Reps, T., Teitelbaum, T. and Demers, A.: Incremental context-dependent analysis for language-based editors. ACM TOPLAS 5, 3 (July 1983), pp. 449–477.

    Google Scholar 

  7. Snelting, G. and Henhapl, W.: Unification in many-sorted algebras as a device for incremental semantic analysis. Proc. 13th POPL, ACM 1986, pp. 229–235.

    Google Scholar 

  8. Snelting, G.: The calculus of context relations. Report PI/R4-89, Fachbereich Informatik, Technische Hochschule Darmstadt. Submitted for Publication.

    Google Scholar 

  9. Snelting, G. and Bahlke, R.: PSG: a theory-based environment generator. Proc. International conference on software development environments and factories. Pitnam Publishers, pp. 131–140.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Praktische Informatik, Technische Hochschule Darmstadt, Magdalenenstr. 11c, D-61, Darmstadt

    Franz-Josef Grosch & Gregor Snelting

Authors
  1. Franz-Josef Grosch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gregor Snelting
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierre Deransart Jan Maluszyński

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grosch, FJ., Snelting, G. (1990). Inference-based overloading resolution for ADA. In: Deransart, P., Maluszyński, J. (eds) Programming Language Implementation and Logic Programming. PLILP 1990. Lecture Notes in Computer Science, vol 456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024174

Download citation

  • DOI: https://doi.org/10.1007/BFb0024174

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53010-7

  • Online ISBN: 978-3-540-46298-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation