1071 search results - page 16 / 215 » Programming with enumerable sets of structures |
ESOP
2000
Springer
14 years 1 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
VL
1993
IEEE
14 years 1 months ago
1993
IEEE
This paper presents a new programming language named SPARCL that has four major elements: it is a visual language, it is a logic programming language, it relies on sets to organiz...
SIGCSE
2004
ACM
14 years 3 months ago
2004
ACM
This paper presents a family of programming projects appropriate to a sophomore-level data structures course, centered around the concept of a buffer pool serving as the access i...
GPCE
2008
Springer
13 years 11 months ago
2008
Springer
High-level query constructs help greatly improve the clarity of programs and the productivity of programmers, and are being introduced to increasingly more languages. However, the...
PPDP
2009
Springer
14 years 4 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...