Personal Homepage of Bern Martens

Papers in international scientific journals (1990-2000)

• D. De Schreye, B. Martens, G. Sablon en M. Bruynooghe; Compiling bottom-up and mixed derivations into top-down executable logic programs; Journal of Automated Reasoning, 7(3):337--358, 1991.
• M. Bruynooghe, D. De Schreye en B. Martens; A general criterion for avoiding infinite unfolding during partial deduction; New Generation Computing, 11(1):47 79, 1992.
• B. Martens, D. De Schreye en T. Horvàth; Sound and complete partial deduction with unfolding based on well-founded measures; Theoretical Computer Science, 122(1 2):97--117, 1994.
• B. Martens en D. De Schreye; Why untyped non-ground meta-programming is not (much of) a problem; Journal of Logic Programming, 22(1):47--99, 1995.
• B. Martens en D. De Schreye; Automatic finite unfolding using well-founded measures; Journal of Logic Programming, 28(2):89--146, 1996.
• M. Leuschel, B. Martens en D. De Schreye; Controlling Generalisation and Polyvariance in Partial Deduction of Normal Logic Programs; ACM Transactions on Programming Languages and Systems, 20(1):208--258, 1998.
• M. Leuschel, B. Martens, and D. De Schreye, Some achievements and prospects in partial deduction, ACM Comput. Surv., 30(3):1-4, 1998.
• D. De Schreye, R. Glück, J. Jørgensen, M. Leuschel, B. Martens and M.H. Sørensen; Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments; Journal of Logic Programming, 41(2&3):231--277, 1999.
• W. Vanhoof, D. De Schreye, and B. Martens, Bottom-up partial deduction of logic programs, J. Funct. Logic Programming, 1999:1-33, 1999.
• D. De Schreye, M. Bruynooghe, B. Demoen, M. Denecker, B. Martens, and G. Janssens, Project report on LP+: a second generation logic programming language, AI Com., 13(1):13-18, 2000.