Abstract
Without comparison, the most pressing problem for the industry of computing is the Year 2000 problem.
In this talk we explain what the Year 2000 problem is and show its close connection to type theory. We present a new type discipline which allows users to find and correct Year 2000 problems in COBOL programs. The type discipline is implemented in a tool called AnnoDomini, which is sold as a commercial product for remediation of IBM OS/VS COBOL programs (www.hafnium.com). Although developed specifically for business applications, AnnoDomini borrows heavily from research in programming languages. AnnoDomini is written in Standard ML, it provides users with abstract (year) types, it is implemented using unification-based type inference, it was specified using operational semantics, and the core of its design was guided by formulating and proving theorems. The talk presents the basic ideas of AnnoDomini and ends with a demo.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tofte, M. (1999). A Type Discipline for Solving Year 2000 Problems in COBOL Programs. In: Kutyłowski, M., Pacholski, L., Wierzbicki, T. (eds) Mathematical Foundations of Computer Science 1999. MFCS 1999. Lecture Notes in Computer Science, vol 1672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48340-3_40
Download citation
DOI: https://doi.org/10.1007/3-540-48340-3_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66408-6
Online ISBN: 978-3-540-48340-3
eBook Packages: Springer Book Archive