Dependent types for program understanding

22Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Weakly-typed languages such as Cobol often force programmers to represent distinct data abstractions using the same low-level physical type. In this paper, we describe a technique to recover implicitly-defined data abstractions from programs using type inference. We present a novel system of dependent types which we call guarded types, a path-sensitive algorithm for inferring guarded types for Cobol programs, and a semantic characterization of correct guarded typings. The results of our inference technique can be used to enhance program understanding for legacy applications, and to enable a number of type-based program transformations. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Komondoor, R., Ramalingam, G., Chandra, S., & Field, J. (2005). Dependent types for program understanding. In Lecture Notes in Computer Science (Vol. 3440, pp. 157–173). Springer Verlag. https://doi.org/10.1007/978-3-540-31980-1_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free