| |
| 1998 | ||
|---|---|---|
| 10 | EE | A. Bijlsma: An Application of Program Derivation Techniques to 18th-Century Mathematics. MPC 1998: 44-51 |
| 9 | A. J. M. van Gasteren, A. Bijlsma: An extension of the program derivation format. PROCOMET 1998: 167-185 | |
| 1996 | ||
| 8 | A. Bijlsma, Carel S. Scholten: Point-free Substitution. Sci. Comput. Program. 27(2): 205-214 (1996) | |
| 1993 | ||
| 7 | A. Bijlsma: Quasi-Boolean Equivalence. Inf. Process. Lett. 45(5): 243-247 (1993) | |
| 6 | A. Bijlsma: Calculating with Procedure Calls. Inf. Process. Lett. 46(5): 211-217 (1993) | |
| 1991 | ||
| 5 | A. Bijlsma: Derivation of Logic Programs by Functional Methods. Inf. Process. Lett. 39(6): 325-332 (1991) | |
| 1989 | ||
| 4 | A. Bijlsma: Transformational Programming and Forests. MPC 1989: 157-173 | |
| 3 | A. Bijlsma, P. A. Matthews, J. G. Wiltink: A Sharp Proof Rule for Procedures in wp Semantics. Acta Inf. 26(5): 409-419 (1989) | |
| 2 | A. Bijlsma: Calculating with Pointers. Sci. Comput. Program. 12(3): 191-205 (1989) | |
| 1986 | ||
| 1 | A. Bijlsma, J. G. Wiltink, P. A. Matthews: Equivalence of the Gries and Martin Proof Rules for Procedure Calls. Acta Inf. 23(4): 357-360 (1986) | |
| 1 | A. J. M. van Gasteren | [9] |
| 2 | P. A. Matthews | [1] [3] |
| 3 | Carel S. Scholten | [8] |
| 4 | J. G. Wiltink | [1] [3] |