Sciweavers

188 search results - page 16 / 38
» Back to the Complexity of Universal Programs
Sort
View
ICFP
1999
ACM
13 years 11 months ago
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Tur...
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
13 years 5 months ago
Efficient Detection of Errors in Java Components Using Random Environment and Restarts
Software model checkers are being used mostly to discover specific types of errors in the code, since exhaustive verification of complex programs is not possible due to state explo...
Pavel Parizek, Tomás Kalibera
CVPR
2009
IEEE
15 years 2 months ago
Constrained Clustering via Spectral Regularization
We propose a novel framework for constrained spectral clustering with pairwise constraints which specify whether two objects belong to the same cluster or not. Unlike previous m...
Zhenguo Li (The Chinese University of Hong Kong), ...
ICSE
1999
IEEE-ACM
13 years 11 months ago
Exploiting Smalltalk Modules in a Customizable Programming Environment
This paper describes how we have extended a module structure of the Smalltalk LearningWorks to provide a programming environment deigned for very large scale technology transfer. ...
Mark Woodman, Robert Griffiths, Malcolm Macgregor,...
ICFP
2010
ACM
13 years 8 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones