756 search results - page 5 / 152 » Understanding COBOL Systems using Inferred Types |
121
click to vote
ICFP
1999
ACM
15 years 6 months ago
1999
ACM
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...
111
Voted
CSMR
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper describes a case study where SofTrack a Software Defect Report and Tracking System - was implemented using internet technology in a geographically distributed organizat...
140
Voted
JFP
2007
15 years 2 months ago
2007
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...
134
Voted
ICFP
2008
ACM
16 years 2 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
143
Voted
POPL
2011
ACM
14 years 5 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...