10899 search results - page 695 / 2180 » The GP Programming System |
199
click to vote
GCSE
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. A well-known problem in program generation is scoping. When identifiers (i.e., symbolic names) are used to refer to variables, types, or functions, program generators mu...
218
click to vote
LICS
1994
IEEE
15 years 11 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 ...
179
click to vote
ECOOP
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Transactional memory (TM) has recently emerged as an effective tool for extracting fine-grain parallelism from declarative critical sections. In order to make STM systems...
173
click to vote
TPDS
1998
15 years 7 months ago
1998
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
207
click to vote
DSL
2009
15 years 5 months ago
2009
Programmers often write custom parsers for the command line input of their programs. They do so, in part, because they believe that both their program's parameterization and t...