Search the dblp DataBase
A. Bijlsma: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- A. Bijlsma
Transformational Programming and Forests. [Citation Graph (0, 0)][DBLP]
MPC, 1989, pp:157-173 [Conf] - A. Bijlsma
An Application of Program Derivation Techniques to 18th-Century Mathematics. [Citation Graph (0, 0)][DBLP]
MPC, 1998, pp:44-51 [Conf] - A. J. M. van Gasteren, A. Bijlsma
An extension of the program derivation format. [Citation Graph (0, 0)][DBLP]
PROCOMET, 1998, pp:167-185 [Conf] - A. Bijlsma, P. A. Matthews, J. G. Wiltink
A Sharp Proof Rule for Procedures in wp Semantics. [Citation Graph (0, 0)][DBLP]
Acta Inf., 1989, v:26, n:5, pp:409-419 [Journal] - A. Bijlsma, J. G. Wiltink, P. A. Matthews
Equivalence of the Gries and Martin Proof Rules for Procedure Calls. [Citation Graph (0, 0)][DBLP]
Acta Inf., 1986, v:23, n:4, pp:357-360 [Journal] - A. Bijlsma
Derivation of Logic Programs by Functional Methods. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1991, v:39, n:6, pp:325-332 [Journal] - A. Bijlsma
Quasi-Boolean Equivalence. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1993, v:45, n:5, pp:243-247 [Journal] - A. Bijlsma
Calculating with Procedure Calls. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1993, v:46, n:5, pp:211-217 [Journal] - A. Bijlsma
Calculating with Pointers. [Citation Graph (0, 0)][DBLP]
Sci. Comput. Program., 1989, v:12, n:3, pp:191-205 [Journal] - A. Bijlsma, Carel S. Scholten
Point-free Substitution. [Citation Graph (0, 0)][DBLP]
Sci. Comput. Program., 1996, v:27, n:2, pp:205-214 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002