Sciweavers

624 search results - page 13 / 125
» The Complexity of Type Analysis of Object Oriented Programs
Sort
View
JOT
2008
57views more  JOT 2008»
13 years 7 months ago
A Static Analysis to Detect Re-Entrancy in Object Oriented Programs
Manuel Fähndrich, Diego Garbervetsky, Wolfram...
SIGMOD
2003
ACM
147views Database» more  SIGMOD 2003»
14 years 7 months ago
Formal semantics and analysis of object queries
Modern database systems provide not only powerful data models but also complex query languages supporting powerful features such as the ability to create new database objects and ...
Gavin M. Bierman
OOPSLA
2010
Springer
13 years 6 months ago
Type classes as objects and implicits
Type classes were originally developed in Haskell as a disciplined alternative to ad-hoc polymorphism. Type classes have been shown to provide a type-safe solution to important ch...
Bruno C. d. S. Oliveira, Adriaan Moors, Martin Ode...
ISAAC
2010
Springer
240views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...
Hugo Férée, Emmanuel Hainry, Mathieu...