International audienceThe SmallEiffel compiler uses a simple type inference mechanism to translate Eiffel source code to C code. The most important aspect in our technique is that many occurrences of late binding are replaced by static binding. Moreover, when dynamic dispatch cannot be removed, inlining is still possible. The advantage of this approach is that it speeds up execution time and decreases considerably the amount of generated code. SmallEiffel compiler source code itself is a large scale benchmark used to show the quality of our results. Obviously, this efficient technique can also be used for class-based languages without dynamic class creation: for example, it is possible for C++ or Java and not possible for Smalltalk
Although dynamically typed languages allow developers to be more productive in writing source code, ...
The Typed Smalltalk project is building an optimizing compiler for a variant of Smalltalk. Typed Sma...
We have designed and implemented a type inference algorithm for the full SELF language. The algorit...
Cette publi est considérée comme un journal (ACM SIGPLAN Notices) dans la communauté.International a...
We present the implementation of a type inference algorithm for untyped object-oriented programs wi...
Dynamically-typed languages allow faster software development by not posing the type constraints. St...
International Workshop on Smalltalk TechnologiesInternational audienceDynamically typed languages pr...
144 pages Defended and granted with Highest Honors in October 2000.This work falls within the scope ...
Highly dynamic languages like Smalltalk do not have much static type information immediately availab...
Highly dynamic languages like Smalltalk do not have much static type information immediately availa...
Rapport interne.In this paper, we present our work on the design and implementation of weak referenc...
The lack of static type information in dynamically-typed languages often poses obstacles for develop...
International audienceBeing able to combine static and dynamic typing within the same language has c...
Type information is a crucial information to support object-oriented reengineering. In a dynamically...
Rapport interne.In this partial report, we present the current state of our work in 2004 within the ...
Although dynamically typed languages allow developers to be more productive in writing source code, ...
The Typed Smalltalk project is building an optimizing compiler for a variant of Smalltalk. Typed Sma...
We have designed and implemented a type inference algorithm for the full SELF language. The algorit...
Cette publi est considérée comme un journal (ACM SIGPLAN Notices) dans la communauté.International a...
We present the implementation of a type inference algorithm for untyped object-oriented programs wi...
Dynamically-typed languages allow faster software development by not posing the type constraints. St...
International Workshop on Smalltalk TechnologiesInternational audienceDynamically typed languages pr...
144 pages Defended and granted with Highest Honors in October 2000.This work falls within the scope ...
Highly dynamic languages like Smalltalk do not have much static type information immediately availab...
Highly dynamic languages like Smalltalk do not have much static type information immediately availa...
Rapport interne.In this paper, we present our work on the design and implementation of weak referenc...
The lack of static type information in dynamically-typed languages often poses obstacles for develop...
International audienceBeing able to combine static and dynamic typing within the same language has c...
Type information is a crucial information to support object-oriented reengineering. In a dynamically...
Rapport interne.In this partial report, we present the current state of our work in 2004 within the ...
Although dynamically typed languages allow developers to be more productive in writing source code, ...
The Typed Smalltalk project is building an optimizing compiler for a variant of Smalltalk. Typed Sma...
We have designed and implemented a type inference algorithm for the full SELF language. The algorit...