AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem (2007)
Peter Harry Eidorff, Fritz Henglein, Christian Mossin, Peter Harry, Eidorff Fritz, Henglein Christian Mossin, ...
. AnnoDomini is a commercially available source-to-source conversion tool for finding and fixing Year 2000 problems in COBOL programs. AnnoDomini uses type-based specification, analysis, and...
the Principles of Programming Lnguages (POPL 99), 1999. (2007)
Order Mads Tofte, M. Tofte, L. Birkedal, M. Elsman, Mads Tofte, Gordon Plotkin, ...
Publications and notes in chronological
AnnoDomini: From Type Theory to Year 2000 Conversion Tool (1999)
Peter Harry Eidorff, Fritz Henglein, Christian Mossin, Peter Harry, Eidorff Fritz, Mads Tofte, ...
AnnoDomini is a source-to-source conversion tool for making COBOL programs Year 2000 compliant. It is technically and conceptually built upon type-theoretic techniques and methods: type-based...
Flow analysis of typed higher-order programs /--Christian Mossin. (1997)
Abstracts in English and Danish.
Abstract. We present a type-based ow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis predicts a...
Higher-Order Value Flow Graphs (1997)
. The concepts of value- and control-flow graphs are important for program analysis of imperative programs. An imperative value flow graph can be constructed by a single pass over the program text....
Higher-Order Value Flow Graphs (1997)
. The concepts of value- and control-flow graphs are important for program analysis of imperative programs. An imperative value flow graph can be constructed by a single pass over the program text....
David N. Turner, Philip Wadler, Christian Mossin
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a typeinference based program...
Th International, David N. Turner, Philip Wadler, Christian Mossin
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a typeinference based program...
David N. Turner, Philip Wadler, Christian Mossin
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a typeinference based program...
David Turner, Philip Wadler, Christian Mossin
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a type-inference based program...