207 search results - page 5 / 42 » Elementary Strong Functional Programming |
AAECC
2007
Springer
13 years 7 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
SIAMJO
2010
13 years 2 months ago
2010
Abstract: In this paper, we study KKT optimality conditions for constrained nonlinear programming problems and strong and Mordukhovich stationarities for mathematical
ILP
1998
Springer
13 years 12 months ago
1998
Springer
In this paper we argue that the use of a language with a type system, together with higher-order facilities and functions, provides a suitable basis for knowledge representation in...
JAR
2008
13 years 7 months ago
2008
This article describes the formal verification of a compilation algorithm that transforms parallel moves (parallel assignments between variables) into a semanticallyequivalent sequ...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...