Sciweavers

624 search results - page 35 / 125
» The Complexity of Type Analysis of Object Oriented Programs
Sort
View
DLS
2005
148views Languages» more  DLS 2005»
13 years 9 months ago
Compile-time meta-programming in a dynamically typed OO language
Compile-time meta-programming allows programs to be constructed by the user at compile-time. Although LISP derived languages have long had such facilities, few modern languages ar...
Laurence Tratt
CEC
2007
IEEE
14 years 2 months ago
Estimation of distribution algorithms for testing object oriented software
— One of the main tasks software testing involves is the generation of the test cases to be used during the test. Due to its expensive cost, the automation of this task has becom...
Ramón Sagarna, Andrea Arcuri, Xin Yao
ICFP
1999
ACM
13 years 12 months ago
Flexible Type Analysis
Run-time type dispatch enables a variety of advanced optimization techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, and fla...
Karl Crary, Stephanie Weirich
POPL
2005
ACM
14 years 8 months ago
A simple typed intermediate language for object-oriented languages
Traditional class and object encodings are difficult to use in practical type-preserving compilers because of the complexity of the encodings. We propose a simple typed intermedia...
Juan Chen, David Tarditi
JUCS
2008
149views more  JUCS 2008»
13 years 7 months ago
Binary Methods Programming: the Clos Perspective
: Implementing binary methods in traditional object-oriented languages is difficult: numerous problems arise regarding the relationship between types and classes in the context of ...
Didier Verna