Sciweavers

8486 search results - page 83 / 1698
» Ordered Enumeration Method
Sort
View
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
14 years 2 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold
ESOP
2003
Springer
14 years 28 days ago
Type Error Slicing in Implicitly Typed Higher-Order Languages
Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that ...
Christian Haack, J. B. Wells
EMMCVPR
1999
Springer
13 years 12 months ago
Auxiliary Variables for Markov Random Fields with Higher Order Interactions
Markov Random Fields are widely used in many image processing applications. Recently the shortcomings of some of the simpler forms of these models have become apparent, and models ...
Robin D. Morris
AFP
1995
Springer
126views Formal Methods» more  AFP 1995»
13 years 11 months ago
Functional Programming with Overloading and Higher-Order Polymorphism
The Hindley/Milner type system has been widely adopted as a basis for statically typed functional languages. One of the main reasons for this is that it provides an elegant comprom...
Mark P. Jones
AAAI
2008
13 years 10 months ago
A First-Order Theory of Stanislavskian Scene Analysis
At the turn of the last century, Constantin Stanislavski developed a new system of acting, replacing the mannered gestures and forced emotion then popular with a more natural styl...
Leora Morgenstern