A PSF library of data types (2007)
Abstract. We present a library of basic data types for the process specification formalism PSF. The specification is written in the algebraic specification formalism ASF, which is a sublanguage of...
A PSF Library of Data Types (1995)
. We present a library of basic data types for the process specification formalism PSF. The specification is written in the algebraic specification formalism ASF, which is a sublanguage of PSF. 1...
Experience with a clustered parallel reduction machine (1993)
Beemster, M., Hartel, P. H., Hertzberger, L. O., Hofman, R. F. H., Langendoen, K. G., Li, L. L., ...
Experience with a clustered parallel reduction machine (1993)
Beemster, M., Hartel, P. H., Hertzberger, L. O., Hofman, R. F. H., Langendoen, K. G., Li, L. L., ...
Experience with a clustered parallel reduction machine (1993)
Beemster, M., Hartel, P. H., Hertzberger, L. O., Hofman, R. F. H., Langendoen, K. G., Li, L. L., ...
Experience with a clustered parallel reduction machine (1993)
Beemster, M., Hartel, P.H., Hertzberger, L.O., Hofman, R.F.H., Langendoen, K.G., Li, L.L., ...
A clustered architecture has been designed to exploit divide and conquer parallelism in functional programs. The programming methodology developed for the machine is based on explicit annotations and...
Experience with a clustered parallel reduction machine (1993)
Mulder, J.C., Barendregt, H.P., Vree, W.G., Milikowski, R., Li, L.L., Langendoen, K.G., ...
Experience with a clustered parallel reduction machine (1993)
Beemster, M., Hartel, Prof.dr. P.H., Hertzberger, Dr. L.O., Hofman, R.F.H., Langendoen, K.G., Li, L.L., ...
A clustered architecture has been designed to exploit divide and conquer parallelism in functional programs. The programming methodology developed for the machine is based on explicit annotations and...
Experience with a clustered parallel reduction machine (1993)
Beemster, M., Hartel, P.H., Hertzberger, L.O., Hofman, R.F.H., Langendoen, K.G., Li, L.L., ...
A clustered architecture has been designed to exploit divide and conquer parallelism in functional programs. The programming methodology developed for the machine is based on explicit annotations and...
Experience with a Clustered Parallel Reduction Machine (1993)
M. Beemster, P. H. Hartel, L. O. Hertzberger, K. G. Langendoen, L. L. Li, ...
A clustered architecture has been designed to exploit divide and conquer parallelism in functional programs. The programming methodology developed for the machine is based on explicit annotations and...
Programming clustered parallel reduction machines (1992)
Barendregt, H. P., Beemster, M., Hartel, P. H., Hertzberger, L. O., Hofman, R. F. H., Langendoen, K. G., ...
Programming clustered parallel reduction machines (1992)
Barendregt, H. P., Beemster, M., Hartel, P. H., Hertzberger, L. O., Hofman, R. F. H., Langendoen, K. G., ...
Programming clustered parallel reduction machines (1992)
Barendregt, H. P., Beemster, M., Hartel, P. H., Hertzberger, L. O., Hofman, R. F. H., Langendoen, K. G., ...
A modular approach to protocol verification using process algebra (1986)
A version of the Alternating Bit Protocol is verified by means of Process Algebra. To avoid a combinatorial explosion, a notion of "modules" is introduced and the protocol is divided in two such...
Mulder, J. C. (Jacob Cornelis)
Proefskrif (D. Ed.)--Universiteit van Suid-Afrika, 1972.
Van Der Burgt, C J, Merkx, G F, Janssen, A H, Mulder, J C, Suijkerbuijk, R F, Smeets, D F
A balanced complex chromosome rearrangement (CCR) involving four chromosomes is very rare and may lead to different types of aneuploid germ cells. We report a liveborn child with multiple congenital...