3323 search results - page 241 / 665 » Computational Semantics with Functional Programming |
184
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
163
click to vote
ICFP
1999
ACM
15 years 11 months ago
1999
ACM
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
163
click to vote
SIGGRAPH
1990
ACM
15 years 10 months ago
1990
ACM
We presenta real-time robot motion plannerthatis fastandcomplete to a resolution. The technique is guaranteed to find a path if one exists at the resolution, and all paths returne...
190
click to vote
GCC
2006
Springer
15 years 10 months ago
2006
Springer
Grid computing is becoming more and more attractive to provide a convenient uniform platform for coordinating highly distributed and heterogeneous resources and services. GridPPI ...
202
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...