
Alves, T.L., Hage, J. & Rademaker, P. (2011). A Comparative Study of Code Query Technologies. In Source Code Analysis and Manipulation (SCAM), 2011 11th IEEE International Working Conference on (pp. 145-154). Alves, T., Hage, J. & Rademaker, P. (2011). A Comparative Study of Code Query Technologies. : Department of Information and Computing Sciences, Utrecht University. Khadka, R., Reijnders, G., Saeidi, A., Jansen, R.L. & Hage, J. (2011). A method engineering based legacy to SOA migration method. In Proceedings of the 27th IEEE International Conference on Software Maintenance (ICSM'11) (pp. 163-172). Khadka, R., Saeidi, A.M., Jansen, R.L., Hage, J. & Helms, R.W. (2011). An Evaluation of Service Frameworks for the Management of Service Ecosystems. In In the 15th Pacific Asian Conference on Information Systems (PACIS 2011). Reijnders, G., Khadka, R., Jansen, R.L. & Hage, J. (2011). Developing a legacy to SOA Migration Method. : Department of Information and Computing Sciences, Utrecht University. Hage, J. (2011). Language Implementation Patterns: Create your own Domain-Specific and General Programming Languages, by Terence Parr, Pragmatic Bookshelf, http://www.pragprog.com, ISBN 9781934356456. Journal of functional programming, 21(02), 215-217. Holdermans, S. & Hage, J. (2011). Making ``stricterness'' more relevant. Higher-Order and Symbolic Computation, 23, 315-335. Hage, J., Rademaker, P. & Vugt, N. van (2010). A comparison of plagiarism detection tools. : Department of Information and Computing Sciences, Utrecht University. Boustani, N el & Hage, J. (2010). Corrective Hints for Type Incorrect Generic Java Programs. In Proceedings of the ACM SIGPLAN 2010 Workshop on Partial Evaluation and Program Manipulation (PEPM '10) (pp. 5-14). Boustani, N el & Hage, J. (2009). Improving Type Error Messages for Generic Java. In G. Puebla & G. Vidal (Eds.), Proceedings of the ACM SIGPLAN 2009 Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '09) (pp. 131-140). ACM Press. Holdermans, S. & Hage, J. (2010). Making ``Stricterness'' More Relevant. In Proceedings of the ACM SIGPLAN 2010 Workshop on Partial Evaluation and Program Manipulation (PEPM '10) (pp. 121-130). ACM Press. Hage, J. & Keeken, P. (2009). Neon: A Library for Language Usage Analysis. In D. Gasevic & E..van.Wyk R. Laemmel (Eds.), Proceedings of the 1st Conference on Software Language Engineering (SLE '08) Vol. 5452. Lecture Notes in Computer Science (pp. 35-53). Springer. Hage, J. & Harju, T. (2009). On Involutions Arising From Graphs. In D..Harel J. Kok A. Condon & E. Winfree (Eds.), Algorithmic Bioprocesses (Natural Computating Series - Springer) (pp. 623-630). Holdermans, S. & Hage, J. (2010). Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators. In Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, ICFP 2010 (pp. 63-74). Hage, J. (2010). Preproceedings of the 22nd Symposium on Implementation and Application of Functional Languages (IFL 2010). : Department of Information and Computing Sciences, Utrecht University. Hage, J. & Heeren, B.J. (2009). Strategies for Solving Constraints in Type and Effect Systems. Electronic Notes in Theoretical Computer Science, 236, 163-183. Boustani, N el & Hage, J. (2009). Corrective Hints for Type Incorrect Generic Java Programs. onbekend: UU BETA ICS Departement Informatica. Camphuijsen, P., Hage, J. & Holdermans, S. (2009). Soft Typing PHP. onbekend: UU BETA ICS Departement Informatica. Holdermans, S. & Hage, J. (2008). Heap recycling for lazy languages. In J. Hatcliff, R. Glück & O. de Moor (Eds.), Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'08, San Francisco, California, USA, January 7–8, 2008 (pp. 189-197). ACM Press. Boustani, N el & Hage, J. (2008). Improving Type Error Messages for Generic Java. UU-CS 2008-038. onbekend: UU WINFI Informatica en Informatiekunde. Dolstra, E., Hage, J., Heeren, B.J., Holdermans, S., Jeuring, J.T., Löh, A., Löh, C., Middelkoop, A., Rodriguez Yakushev, A. & Schie, J. van (2008). Report on the tenth {ICFP} programming contest. In ICFP '08: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming (pp. 397-408). New York, NY, USA: ACM. Hage, J., Holdermans, S. & Middelkoop, A. (2007). A generic usage analysis with subeffect qualifiers. In R. Hinze & N. Ramsey (Eds.), Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, ICFP 2007, Freiburg, Germany, October 1--3 (pp. 235-246). ACM Press. Hage, J. & Heeren, B.J. (2007). Heuristics for type error discovery and recovery. In Z. Horváth, V. Zsók & A. Butterfield (Eds.), Implementation of Functional Languages -- IFL 2006 (pp. 199-216). Heidelberg: Springer Verlag. Hage, J. & Keeken, P. (2007). Mining Helium programs with Neon. UU-CS 2007-012. onbekend: UU WINFI Informatica en Informatiekunde. Dolstra, E., Hage, J., Heeren, B.J., Holdermans, S., Jeuring, J.T., Löh, A., Middelkoop, A., Rodriguez Yakushev, A., Schie, J.C. van & Löh, C. (2007). Morph Endo! Report on the Tenth Interstellar Contest on Fuun Programming. UU-CS 2007-029. onbekend: UU WINFI Informatica en Informatiekunde. Dolstra, E., Hage, J., Heeren, B.J., Holdermans, S., Jeuring, J.T., Löh, A., Middelkoop, A., Rodriguez Yakushev, A., Schie, J.C. van & Löh, C. (2007). Morph Endo! Task description of the Tenth Interstellar Contest on Fuun Programming. UU-CS 2007-027. onbekend: UU WINFI Informatica en Informatiekunde. Hage, J. & Harju, T. (2007). On Involutive Anti-Automorphisms of Finite Abelian Groups. UU-CS 2007-053. onbekend: UU WINFI Informatica en Informatiekunde. Hage, J. (2007). Programmeerplagiaatdetectie met Marble. TINFON, Tijdschrift voor informatieonderwijs, 16, 4-8. Hage, J. & Keeken, P. (2007). The Neon DSEL for Mining Helium Programs. UU-CS 2007-23. onbekend: UU WINFI Informatica en Informatiekunde. Hage, J. & Harju, T. (2007). Towards a characterization of bipartite switching classes by means of forbidden subgraphs. Discussiones Mathematicae Graph Theory, 27, 471-483. Hage, J. & Heeren, B.J. (2006). Heuristics for type error discovery and recovery (revised revised). onbekend: UU WINFI Informatica en Informatiekunde. Hage, J. & Heeren, B.J. (2006). Heuristics for type error discovery and recovery (revised). UU-CS 2006-007. onbekend: UU WINFI Informatica en Informatiekunde. Hage, J. & Keeken, P. (2006). Mining for Helium. onbekend: UU WINFI Informatica en Informatiekunde. Hage, J. (2006). Programmeerplagiaatdetectie met Marble. onbekend: UU WINFI Informatica en Informatiekunde. Hage, J. & Heeren, B.J. (2006). Strategies for solving constraints in program analysis. onbekend: UU WINFI Informatica en Informatiekunde. Ehrenfeucht, A., Hage, J., Harju, T. & Rozenberg, G. (2006). The embedding problem for switching classes of graphs. Fundamenta Informaticae, 74, 1-17. Hage, J. & Harju, T. (2006). Towards a characterization of bipartite switching classes by means of forbidden subgraphs. onbekend: UU WINFI Informatica en Informatiekunde. Hage, J. & Heeren, B.J. (2005). Heuristics for type error discovery and recovery. CS-UU 2005-029. onbekend: UU WINFI Informatica en Informatiekunde. Hage, J. & Heeren, B.J. (2005). Ordering Type Constraints: A Structured Approach. UU-CS 2005-016. onbekend: UU WINFI Informatica en Informatiekunde. Ehrenfeucht, A., Hage, J., Harju, T. & Rozenberg, G. (2005). The Embedding Problem For Switching Classes. UU-CS 2005-07. onbekend: UU WINFI Informatica en Informatiekunde. Hage, J. (2005). The Helium Logging Facility. UU-CS 2005-055. onbekend: UU WINFI Informatica en Informatiekunde. Heeren, B.J. & Hage, J. (2005). Type Class Directives. In Manuel Hermenegildo & Daniel Cabeza (Eds.), Proceedings of the 7th International Symposium on Practical Aspects of Declarative Languages (PADL'05) (pp. 253-267). Berlin: Springer-Verlag. Hage, J. & Harju, T. (2004). A characterization of acyclic switching classes using forbidden subgraphs. SIAM Journal on Discrete Mathematics, 18, 159-176. Heeren, B.J. & Hage, J. (2004). A first attempt at type class directives. UU-CS 2004-039. Utrecht: Utrecht University: Information and Computing Sciences. Ehrenfeucht, A., Hage, J., Harju, T. & Rosenberg, G. (2004). Embedding in Switching Classes with Skew Gains. UU-CS 2004-023. Utrecht: Utrecht University: Information and Computing Sciences. Ehrenfeucht, A., Hage, J., Harju, T. & Rozenberg, G. (2004). Embedding in Switching Classes with Skew Gains. In H. Ehrig, G. Engels, F. Parisi-Presicce & G. Rozenberg (Eds.), Graph Transformations, Second International Conference, ICGT 2004 (pp. 257-270). Springer-Verlag. Heeren, B.J., Hage, J. & Swierstra, S.D. (2003). Constraint based type inferencing in Helium. In M.-C. Silaghi & M. Zanker (Eds.), Workshop Proceedings of Immediate Applications of Constraint Programming (pp. 59-80). Cork. Hage, J. (2003). Enumerating submultisets of multisets. Information Processing Letters, 85, 221-226. Hage, J., Harju, T. & Welzl, E. (2003). Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Swithing Classes. Fundamenta Informaticae, 58, 23-37. Heeren, B.J., Hage, J. & Swierstra, S.D. (2003). Scripting the type inference process. In Eighth ACM Sigplan International Conference on Functional Programming (pp. 3-13). New York: ACM Press. Hage, J., Harju, T. & Welzi, E. (2002). Euler graphs, triangle-free graphs and bipartite graphs in switching classes. UU-CS 2002-017. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences. Hage, J., Harju, T. & Welzl, E. (2002). Euler graphs, triangle-free graphs and bipartite graphs in switching classes. In A. Corradini, H. Ehrig, H.-J. Kreowski & G. Rozenberg (Eds.), Graph Transformation, First Int. Conf on Graph Transformations, ICGT 2002 (pp. 48-60). Berlin: Springer Verlag. Heeren, B.J., Hage, J. & Swierstra, S.D. (2002). Generalizing Hindley-Milner Type Inference Algorithms. UU-CS 2002-031. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences. Heeren, B.J. & Hage, J. (2002). Parametric Type Inferencing for Helium. UU-CS 2002-035. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences. Hage, J. (2001). Enumerating submultisets of multisets. UU-CS 2001-27. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences. Hage, J. (2001, September 26). Structural Aspects of Switching Classes. LIACS (152 pag.) (Leiden: eigen beheer). Prom./coprom.: G. Rozenberg. Hage, J. & Harju, T. (2000). A characterization of acyclic switching classes using forbidden subgraphs. Leiden: Leiden University, Department of Computer Science. Ehrenfeucht, A., Hage, J., Harju, T. & Rozenberg, G. (2000). Complexity Issues in Switching of Graphs. In H. Ehrig, G. Engels, H.-J. Kreowski & G. Rozenberg (Eds.), Theory And Application Of Graph Transformations - TAGT '98 (pp. 59-70). Berlin: Springer Verlag. Ehrenfeucht, A., Hage, J., Harju, T. & Rozenberg, G. (2000). Pancyclicity in Switching Classes. Inf. Proc. Letters, 73, 153-156. Hage, J. & Harju, T. (2000). The size of switching classes with skew gains. Discrete Math., 215, 81-92. Hage, J. (1999). The membership problem for switching classes with skew gains. Fundamenta Informaticae, 39, 375-387. Hage, J. & Harju, T. (1998). Acyclicity of Switching Classes. European J. Combin., 19, 321-327. Ehrenfeucht, A., Hage, J., Harju, T. & Rozenberg, G. (1997). Complexity Problems In Switching Classes Of Graphs. : Leiden University, Department of Computer Science. Hage, J. & Harju, T. (1996). The size of 2-classes in group labeled 2-structures. : Leiden University, Department of Computer Science. Hage, J. (1994). ARL and PR2, reversible languages. Leiden: Leiden University.