Sciweavers

243 search results - page 11 / 49
» Towards a Type System for Analyzing JavaScript Programs
Sort
View
ICFP
1999
ACM
13 years 11 months ago
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Tur...
XPU
2010
Springer
13 years 5 months ago
Towards Understanding Communication Structure in Pair Programming
Pair Programming has often been reported to be beneficial in software projects. To better understand where these benefits come from we evaluate the aspect of intra-pair communica...
Kai Stapel, Eric Knauss, Kurt Schneider, Matthias ...
ECOOP
2005
Springer
14 years 1 months ago
Towards Reusable Heterogeneous Data-Centric Disentangled Parts
This paper presents our ongoing research towards a safe system evolution. Our approach is based on data-centric, objectoriented systems. Within those systems we utilise (i) multi-...
Michael Reinsch, Takuo Watanabe
SAS
1994
Springer
136views Formal Methods» more  SAS 1994»
13 years 11 months ago
Constraint-Based Type Inference and Parametric Polymorphism
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
Ole Agesen
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...