4757 search results - page 274 / 952 » Monads for Functional Programming |
214
click to vote
NCA
2008
IEEE
15 years 6 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
169
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
188
click to vote
CC
2003
Springer
15 years 11 months ago
2003
Springer
vel Meta-Reasoning with Higher-Order Abstract Syntax Alberto Momigliano, Simon Ambler. A Normalisation Result for Higher-Order Calculi with Explicit Substitutions Eduardo Bonelli. ...
139
click to vote
IFL
2005
Springer
16 years 3 days ago
2005
Springer
Abstract Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevan...
161
click to vote
POPL
1991
ACM
15 years 10 months ago
1991
ACM
We present a new approach to the polymorphic typing of data accepting in-place modification in ML-like languages. This approach is based on restrictions over type generalization,...