Sciweavers

756 search results - page 5 / 152
» Understanding COBOL Systems using Inferred Types
Sort
View
ICFP
1999
ACM
13 years 12 months ago
Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML
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...
Atsushi Ohori, Nobuaki Yoshida
CSMR
1999
IEEE
13 years 12 months ago
A Software Defect Report and Tracking System in an Intranet
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...
António Silva Monteiro, Miguel Goulã...
JFP
2007
136views more  JFP 2007»
13 years 7 months ago
Practical type inference for arbitrary-rank types
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. ...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...
ICFP
2008
ACM
14 years 7 months ago
From ML to MLF: graphic type constraints with efficient type inference
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 ...
Boris Yakobowski, Didier Rémy
POPL
2011
ACM
12 years 10 months ago
Dynamic inference of static types for ruby
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...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...