Sciweavers

46 search results - page 3 / 10
» The Infer Type Refactoring and its Use for Interface-Based P...
Sort
View
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
14 years 1 months ago
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...
ECOOP
2007
Springer
14 years 1 months ago
Declarative Object Identity Using Relation Types
Object-oriented languages define the identity of an object to be an address-based object identifier. The programmer may customize the notion of object identity by overriding the ...
Mandana Vaziri, Frank Tip, Stephen Fink, Julian Do...
ICSE
2007
IEEE-ACM
14 years 7 months ago
Refactoring for Parameterizing Java Classes
Type safety and expressiveness of many existing Java libraries and their client applications would improve, if the libraries were upgraded to define generic classes. Efficient and...
Adam Kiezun, Michael D. Ernst, Frank Tip, Robert M...
SAS
2004
Springer
105views Formal Methods» more  SAS 2004»
14 years 27 days ago
Type Inference Against Races
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supp...
Cormac Flanagan, Stephen N. Freund
APLAS
2000
ACM
13 years 12 months ago
A Generalization of Hybrid Let-Polymorphic Type Inference Algorithms
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type sy...
Oukseh Lee, Kwangkeun Yi