Skip to main content
Article thumbnail
Location of Repository

Composing Type-Checked Programs (Extended Abstract)

By Ulrich Geske, Hans-joachim Goltz and Mario Lenz


) Ulrich Geske Hans-Joachim Goltz National Research Centre for Informatics and Information Technology GMD-FIRST Berlin fgeske, Mario Lenz Department of Computer Science Humboldt University of Berlin January 13, 1995 1 Introduction Debugging of type errors in large programs of Prolog or in procedures with many arguments is often time consuming. For type-free programs of Prolog, types can be generated by abstract interpretation. In this paper we supply a classification of types, discuss meaning of the different types, show how they can be derived and used for error detection. Modularization of programs have not only advantages for structuring large programs, but especially for the generation of more specific types, too. For efficient use of these information we propose an extension of the format of the module interface. 2 Debugging and Composing Large Programs When composing large programs from many procedures not only knowledge of mode informat..

Year: 1995
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.