Sciweavers

2231 search results - page 284 / 447
» Alternation as a programming paradigm
Sort
View
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 5 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
OOPSLA
2010
Springer
15 years 5 months ago
Back to the futures: incremental parallelization of existing sequential runtime systems
Many language implementations, particularly for high-level and scripting languages, are based on carefully honed runtime systems that have an internally sequential execution model...
James Swaine, Kevin Tew, Peter A. Dinda, Robert Br...
ICSE
2009
IEEE-ACM
15 years 4 months ago
HOLMES: Effective statistical debugging via efficient path profiling
Statistical debugging aims to automate the process of isolating bugs by profiling several runs of the program and using statistical analysis to pinpoint the likely causes of failu...
Trishul M. Chilimbi, Ben Liblit, Krishna K. Mehra,...
EMNLP
2010
15 years 4 months ago
Top-Down Nearly-Context-Sensitive Parsing
We present a new syntactic parser that works left-to-right and top down, thus maintaining a fully-connected parse tree for a few alternative parse hypotheses. All of the commonly ...
Eugene Charniak
ESOP
2012
Springer
14 years 2 months ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen