Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-5
|
Results: 5
Inductive benchmarking for purely functional data structures
Authors:
Moss, GE Runciman, C
Citation:
Ge. Moss et C. Runciman, Inductive benchmarking for purely functional data structures, J FUNCT PRO, 11, 2001, pp. 525-556
The accepting power of unary string logic programs
Authors:
Matsushita, T Runciman, C
Citation:
T. Matsushita et C. Runciman, The accepting power of unary string logic programs, THEOR COMP, 266(1-2), 2001, pp. 59-79
Haskell and XML: Generic combinators or type-based translation?
Authors:
Wallace, M Runciman, C
Citation:
M. Wallace et C. Runciman, Haskell and XML: Generic combinators or type-based translation?, ACM SIGPL N, 34(9), 1999, pp. 148-159
The bits between the lambdas: Binary data in a lazy functional language
Authors:
Wallace, M Runciman, C
Citation:
M. Wallace et C. Runciman, The bits between the lambdas: Binary data in a lazy functional language, ACM SIGPL N, 34(3), 1999, pp. 107-117
Performance monitoring
Authors:
Charles, N Runciman, C
Citation:
N. Charles et C. Runciman, Performance monitoring, RESEARCH DIRECTIONS IN PARALLEL FUNCTIONAL PROGRAMMING, 1999, pp. 233-246
Risultati:
1-5
|