Sciweavers

3116 search results - page 30 / 624
» Positively dependent types
Sort
View
TACAS
2007
Springer
108views Algorithms» more  TACAS 2007»
15 years 3 months ago
State of the Union: Type Inference Via Craig Interpolation
The ad-hoc use of unions to encode disjoint sum types in C programs and the inability of C’s type system to check the safe use of these unions is a long standing source of subtle...
Ranjit Jhala, Rupak Majumdar, Ru-Gang Xu
164
Voted
POPL
2009
ACM
15 years 10 months ago
Positive supercompilation for a higher order call-by-value language
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
Peter A. Jonsson, Johan Nordlander
ATAL
2003
Springer
15 years 2 months ago
Adjustable Autonomy Challenges in Personal Assistant Agents: A Position Paper
The successful integration and acceptance of many multi-agent systems into daily lives crucially depends on the ability to develop effective policies for adjustable autonomy. Adju...
Rajiv T. Maheswaran, Milind Tambe, Pradeep Varakan...
CORR
2010
Springer
134views Education» more  CORR 2010»
14 years 9 months ago
Bit-size estimates for triangular sets in positive dimension
We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over Q. These estimates are worst case upper bo...
Xavier Dahan, Abdulilah Kadri, Éric Schost
HASKELL
2006
ACM
15 years 3 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser