| Extensible unification by metastructures U Neumerkel Proceeding of the META 90, 1990 | 67 | 1990 |
| Applying static analysis techniques for inferring termination conditions of logic programs F Mesnard, U Neumerkel International Static Analysis Symposium, 93-110, 2001 | 55 | 2001 |
| The Vienna abstract machine A Krall, U Neumerkel Programming Language Implementation and Logic Programming: International …, 1990 | 40 | 1990 |
| A novel term compression scheme and data representation in the binwam P Tarau, U Neumerkel Programming Language Implementation and Logic Programming: 6th International …, 1994 | 30 | 1994 |
| Specialization of Prolog programs with partially static goals and binarization UW Neumerkel | 23 | 1992 |
| Detecting optimal termination conditions of logic programs F Mesnard, E Payet, U Neumerkel International Static Analysis Symposium, 509-525, 2002 | 19 | 2002 |
| Localizing and explaining reasons for non-terminating logic programs with failure-slices U Neumerkel, F Mesnard International Conference on Principles and Practice of Declarative …, 1999 | 14 | 1999 |
| A transformation based on the equality between terms U Neumerkel Logic Program Synthesis and Transformation: Proceedings of LOPSTR 93 …, 1994 | 13 | 1994 |
| GUPU: A Prolog course environment and its programming methodology U Neumerkel | 12 | 1996 |
| Precise garbage collection in Prolog J Wielemaker, U Neumerkel CICLOPS 8, 1-15, 2008 | 10 | 2008 |
| The binary WAM, a simplified Prolog engine U Neumerkel Technical report, Technische Universität Wien, 1993. http://www. complang …, 1993 | 9 | 1993 |
| Declarative program development in Prolog with GUPU U Neumerkel, S Kral arXiv preprint cs/0207044, 2002 | 8 | 2002 |
| Teaching Prolog and CLP U Neumerkel Tutorial. PAP 95, 1995 | 7 | 1995 |
| Compact representation of terms and instructions in the BinWAM P Tarau, U Neumerkel Technical Report 93-3, Dept. d'Informatique, Universit e de Moncton, 1993 | 7 | 1993 |
| Better termination for Prolog with constraints M Triska, U Neumerkel, J Wielemaker arXiv preprint arXiv:0903.2168, 2009 | 6 | 2009 |
| cTI: Bottom-Up Termination Inference for Logic Programs. S Burckel, S Hoarau, F Mesnard, U Neumerkel WLP, 123-134, 2000 | 6 | 2000 |
| A programming course for declarative programming with Prolog U Neumerkel | 6 | 1997 |
| Prolog multi-threading support P Moura, J Wielemaker, M Carro, P Nunes, P Robinson, R Marques, ... ISO/IEC DTR 132115, 2007, 2008 | 5 | 2008 |
| A generalised finite domain constraint solver for SWI-Prolog M Triska, U Neumerkel, J Wielemaker In Proceedings of the 22nd Workshop on (Constraint) Logic Programming (WLP …, 2008 | 5 | 2008 |
| Continuation Prolog: A new intermediary language for WAM and BinWAM code generation U Neumerkel Post-ILPS’95 Workshop on Implementation of Logic Programming Languages. F16G, 1995 | 5 | 1995 |
