4757 search results - page 311 / 952 » Monads for Functional Programming |
190
Voted
IFIP
2005
Springer
16 years 4 days ago
2005
Springer
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...
147
click to vote
TLDI
2003
ACM
15 years 12 months ago
2003
ACM
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...
192
click to vote
ERSHOV
2003
Springer
15 years 12 months ago
2003
Springer
By obfuscation we mean any efficient semantic-preserving transformation of computer programs aimed at bringing a program into such a form, which impedes the understanding of its al...
157
click to vote
BIRTHDAY
1994
Springer
15 years 10 months ago
1994
Springer
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
253
click to vote
B
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A recent contribution to the formal specification and verification of concurrent systems is the integration of the state- and event-based approaches B and CSP, specifical...