journal articles - utrecht · pdf filemations with rewriting strategies and dependent dynamic...

Journal Articles

2005

[1] M. Bravenboer, A. van Dam, K. Olmos, and E. Visser. Program trans-formation with scoped dynamic rewrite rules. Fundamenta Informaticae,2005. (Conditionally accepted).

[2] E. Visser. A survey of strategies in rule-based program transformationsystems. Journal of Symbolic Computation, 2005. (To appear).

2004

[1] A. I. Baars, A. Loh, and S. D. Swierstra. Parsing permutation phrases.Journal of Functional Programming, 14(6):635–646, 2004.

[2] J. Hage and T. Harju. A characterization of acyclic switching classes usingforbidden subgraphs. SIAM Journal on Discrete Mathematics, 18(1):159 –176, 2004.

[3] B. Heeren and D. Leijen. Gebruiksvriendelijke compiler voor het onderwijs.Informatie, 46(8):46 – 50, Oktober 2004.

[4] R. Hinze, J. Jeuring, and A. Loh. Type-indexed data types. Science ofComputer Programming, 51(1-2):117–151, 2004.

[5] L. Meertens. Calculating the Sieve of Eratosthenes. Journal of FunctionalProgramming, 14(6):759–763, 2004.

2003

[1] F. Atanassow, D. Clarke, and J. Jeuring. Scripting XML in Generic Haskell.Journal of Universal Computer Science, 2003. to appear.

[2] J. Hage. Enumerating submultisets of multisets. Inf. Proc. Letters,85(4):221 – 226, 2003.

[3] J. Hage, T. Harju, and E. Welzl. Euler graphs, triangle-free graphs andbipartite graphs in switching classes. Fundamenta Informaticae, 58(1):23–37, November 2003.


[5] J. Jeuring. Het ontwikkelen van XML-tools (the development of XML tools,in Dutch). IT Monitor, (8):4–7, September 2003.

1

2002

[1] R. Hinze. Functional pearl: A fresh look at binary search trees. Journal ofFunctional Programming, 2002. In press.

[2] R. Hinze. Functional pearl: Formatting: a class act. Journal of FunctionalProgramming, 2002. In press.

[3] R. Hinze. Polytypic values possess polykinded types. Science of Com-puter Programming, Special issue on Mathematics of Program Construc-tion, 2002. In press.

[4] P. Jansson and J. Jeuring. Polytypic data conversion programs. Science ofComputer Programming, 43(1):35–75, 2002.

[5] I. Prasetya, A. Azurat, and S. Swierstra. Embedding programming logicsin HOL theorem prover. Jurnal Ilmu Komputer dan Teknologi Informasi,2(1), 2002.

[6] I. Prasetya and S. Swierstra. Factorizing fault tolerance. Journal ofTheoretical Computer Science, Special Edition on Dependable Computing,290(2):1201–1222, october 2002.

2001

[1] L. Bijlsma. Model-based specification. Information Processing Letters,77:77–84, 2001.

[2] R. Hinze and J. Jeuring. Functional pearl: Weaving a web. 11(6):681–689,2001.

[3] I. Prasetya, A. Azurat, and S. Swierstra. Sebuah framework untukmekanisasi multi logika. Jurnal Ilmu Komputer dan Teknologi Informasi,1(2), 2001.

[4] I. Prasetya, S. Swierstra, and B. Widjaja. Teori komposisi komponen.Jurnal Ilmu Komputer dan Teknologi Informasi, 1(1), 2001.

[5] A. van IJzendoorn. Extreme programming. TINFON, 10(2):48–50, August2001.

2000

[1] A. Ehrenfeucht, J. Hage, T. Harju, and G. Rozenberg. Pancyclicity inswitching classes. Inf. Proc. Letters, 73(5–6):153 – 156, 2000.

[2] J. Hage and T. Harju. The size of switching classes with skew gains. DiscreteMath., 215:81 – 92, 2000.

[3] P. Johann and E. Visser. Warm fusion in Stratego: A case study in thegeneration of program transformation systems. Annals of Mathematics andArtificial Intelligence, 29(1–4):1–34, 2000.

[4] K. B. Oege de Moor and S. D. Swierstra. First class attribute gram-mars. Informatica: An International Journal of Computing and Infor-matics, 24(2):329–341, June 2000. Special Issue: Attribute grammars andTheir Applications.

2

1999

[1] J. Hage. The membership problem for switching classes with skew gains.Fundamenta Informaticae, 39(4):375–387, 1999.

[2] P. van Oostrum. Using emacs and aucTEX for preparing LATEX documents.MAPS, 23:108–112, 1999.

1998

[1] L. Bijlsma and R. Nederpelt. Dijkstra-scholten predicate calculus: conceptsand misconceptions. Acta Informatica, 35:1007–1036, 1998.

[2] J. Hage and T. Harju. Acyclicity of switching classes. European J. Combin.,19:321–327, 1998.

[3] P. Jansson and J. Jeuring. Functional pearl: Polytypic unification. Journalof Functional Programming, 8(5):527–536, September 1998.

[4] E. Visser. Polymorphic syntax definition. Theoretical Computer Science,199:57–86, 1998.

1997

[1] I. Prasetya. Mechanically verified self-stabilizing hierarchical algorithms.Lecture Notes in Computer Science, 1217:399 – 415, 1997.

1996

[1] A. Bijlsma and C. S. Scholten. Point-free substitution. Science of ComputerProgramming, 27:205–214, 1996.

[2] M. G. J. van den Brand and E. Visser. Generation of formatters for context-free languages. ACM Transactions on Software Engineering and Method-ology, 5(1):1–41, January 1996.

[3] P. van Oostrum. Page layout in LATEX. MAPS, 16:108–125, 1996.

1995

[1] A. Bijlsma, R. W. Bulterman, W. H. J. Feijen, A. J. M. van Gasteren, C. S.Scholten, F. W. van der Sommen, and A. I. J. Wijnands. Calculating thegalois adjoint. Information Processing Letters, 53:137–139, 1995.

1994

[1] J. Fokker and P. van Oostrum. Plaatjes in een tekst. MAPS, 13:153–166,1994.

[2] J. Jeuring. The derivation of on-line algorithms, with an application tofinding palindromes. Algorithmica, 11:146–184, 1994.

[3] E. Kranakis, D. D. Krizanc, and L. Meertens. Link length of rectilinearHamiltonian tours in grids. Ars Combinatoria, 38:177–192, 1994.

[4] P. van Oostrum. Headers and footers in LATEX. MAPS, 13:127–135, 1994.

3

1993

[1] P. J. A. Lentfert and S. D. Swierstra. Distributed maximum maintenanceon hierarchically divided graphs. Formal Aspects of Computing, 5(1):21–60,1993.

[2] I. Prasetya. Formalization of variables access constraints to support com-positionality of liveness properties. Lecture Notes in Computer Science,780:324–337, 1993.

[3] I. Prasetya. On the style of mechanical proving. Lecture Notes in ComputerScience, 780:475–488, 1993.

[4] P. van Oostrum. Gebruik en management van TEX in een Unix omgeving.MAPS, 11:88–102, 1993.

1992

[1] J. Fokker. The systematic construction of a one-combinator basis forlambda-terms. Formal Aspects of Computing, 4:776–780, 1992.

[2] L. Meertens. Paramorphisms. Formal Aspects of Computing, 4:413–424,1992.

1991

[1] M. M. Fokkinga, J. Jeuring, L. Meertens, and E. Meijer. A translationfrom attribute grammars to catamorphisms. The Squiggolist, 2(1):20–26,1991.

[2] M. M. Fokkinga and L. Meertens. Map-functor factorized. The Squiggolist,2(1):17–19, 1991.

[3] L. Meertens. A neutral suggestion. The Squiggolist, 2(1):16, 1991.

[4] L. Meertens and J. van der Woude. A tribute to attributes. The Squiggolist,2(1):10–15, 1991.

[5] P. van Oostrum. Program text generation with TEX/LATEX. MAPS, 6:99–106, 1991.

1990

[1] J. Jeuring. The largest ascending substree — an exercise in nub theory.The Squiggolist, 1:36–44, 1990.

1989

[1] J. Jeuring and L. Meertens. The least-effort cabinet formation. The Squig-golist, 1(2), 1989.

[2] E. Kranakis and L. Meertens. Optimal packing of similar triangles. EATCSBulletin, 38:181–185, 1989.

[3] L. Meertens. Reducing hopeful majority. The Squiggolist, 1(1):5, 1989.

4

1986

[1] L. Meertens. From B to ABC: the salient changes. The B Newsletter, 5:2–6,1986.

1985

[1] L. Meertens. Eh? B be ‘ABC’, see? The B Newsletter, 4, 1985.

[2] L. Meertens. A proposal for matrix/vector functions in B. The B Newslet-ter, 3, 1985.

[3] L. Meertens. ∼ 1 <> 1, a nice distinction? The B Newsletter, 4, 1985.

[4] L. Meertens. What is in the name of B? The B Newsletter, 3, 1985.

[5] L. Meertens and S. Pemberton. Description of B. SIGPLAN Notices,20(2):58–76, February 1985.

1983

[1] L. Meertens and P. M. Vitanyi. Big Omega contra the wild functions.EATCS Bulletin, 16:14–19, 1983.

1982

[1] C. Bron, E. Dijkstra, and S. Swierstra. A memory-management unit forthe optimal exploitation of a small address space. Information ProcessingLetters, 15(1):20–22, 1982.

[2] L. Meertens. Quick reference to B. ALGOL Bulletin, 48:7–17, 1982.

1980

[1] K. R. Apt and L. Meertens. Completeness with finite systems of intermedi-ate assertions for recursive program schemes. SIAM Journal on Computing,9:665–671, 1980.

1979

[1] K. R. Apt, J. A. Bergstra, and L. Meertens. Recursive assertions are notenough—or are they? Theoretical Computer Science, 8:73–87, 1979.

[2] C. J. Cheney, C. H. Lindsey, L. Meertens, and H. Wupper. Changing linelengths in random files. ALGOL Bulletin, 44:15, 1979.

1978

[1] L. Geurts and L. Meertens. Remarks on Abstracto. ALGOL Bulletin,42:56–63, 1978.

5

1977

[1] T. V. Janssen, G. H. Kok, and L. Meertens. On restrictions on transforma-tional grammars reducing the generative power. Linguistics and Philosophy,1:111–118, 1977.

1976

[1] A. Atkinson, A. Heemskerk, and S. Swierstra. Construction of a unitaryscattering amplitude. Nuclear Physics, 1976.

[2] L. Meertens. A note on integral division. ALGOL Bulletin, 39:30–32, 1976.

[3] L. Meertens. A space-saving technique for assigning ALGOL 68 multiplevalues. Information Processing Letters, 5:97–99, 1976.

1975

[1] J. W. de Bakker and L. Meertens. On the completeness of the inductiveassertion method. Journal of Computer and System Sciences, 11:323–357,1975.

[2] A. van Wijngaarden, B. Mailloux, J. Peck, C. Koster, M. Sintzoff, C. Lind-sey, L. Meertens, and R. Fisker. Revised Report on the Algorithmic Lan-guage ALGOL 68. Acta Informatica, 5:1–236, 1975.

1973

[1] L. Meertens. On static scope checking in ALGOL 68. ALGOL Bulletin,35:45–58, 1973.

1971

[1] L. Meertens. Designing letter-like shapes. Page (Bulletin of the ComputerArts Society), 17:2–3, 1971.

1969

[1] L. Andriessen, L. Geurts, and L. Meertens. Componist en computer. DeGids, 132:304–311, 1969.

[2] N. H. Frijda and L. Meertens. A simulation model of human informationretrieval. Sciences du Comportement, 7:237–243, 1969.

[3] L. Meertens. On the generation of ALGOL 68 programs involving infinitemodes. ALGOL Bulletin, 30:90–92, 1969.

1968

[1] L. Meertens. Componeren met de computer. Informatie, 10:418–421, 1968.

6

1962

[1] L. Meertens. Kunstmatige intelligentie, een programma voor het optimaaloplossen van een klasse van problemen. Mededelingen van het NederlandsRekenmachine Genootschap, 4:6–13, 1962.

selecttypeisbookproceedings

Books

2005

[1] M. Bravenboer, A. van Dam, K. Olmos, and E. Visser. Program trans-formation with scoped dynamic rewrite rules. Fundamenta Informaticae,2005. (Conditionally accepted).

[2] R. Guerra, J. Jeuring, and D. Swierstra. Generic validation in an XPath-Haskell data binding. In Proceedings of PLAN-X 2005, 2005.

[3] B. Heeren and J. Hage. Type class directives. In Seventh InternationalSymposium on Practical Aspects of Declarative Languages, pages 253 – 267,Berlin, 2005. Springer Verlag.

[4] K. Olmos and E. Visser. Composing source-to-source data-flow transfor-mations with rewriting strategies and dependent dynamic rewrite rules. InR. Bodik, editor, 14th International Conference on Compiler Construction(CC’05). Springer-Verlag, April 2005. (Accepted for publication).

[5] E. Visser. A survey of strategies in rule-based program transformationsystems. Journal of Symbolic Computation, 2005. (To appear).

2004

[1] F. Atanassow, D. Clarke, and J. Jeuring. UUXML: A type-preserving XMLSchema–Haskell data binding. In B. Jayaraman, editor, Practical Aspects ofDeclarative Languages, 6th International Symposium, PADL 2004, Dallas,TX, USA, June 2004, Proceedings, number 3057 in LNCS, pages 71–85,Berlin Heidelberg, June 2004. Springer–Verlag.

[2] F. Atanassow and J. Jeuring. Inferring type isomorphisms generically. InD. Kozen, editor, Proceedings of the 7th International Conference on Math-ematics of Program Construction, MPC’04, volume 3125 of LNCS, pages32–53. Springer-Verlag, 2004.

[3] F. Atanassow and J. Jeuring. Inferring type isomorphisms generically. InD. Kozen, editor, Mathematics of Program Construction, 7th InternationalConference, MPC 2004, Stirling, Scotland, UK, July 2004, Proceedings,number 3125 in LNCS, pages 32–53, Berlin Heidelberg, July 2004. Springer–Verlag.

[4] A. I. Baars, A. Loh, and S. D. Swierstra. Parsing permutation phrases.Journal of Functional Programming, 14(6):635–646, 2004.

7

[5] A. I. Baars and S. D. Swierstra. Type-safe, self inspecting code. In Pro-ceedings of the ACM SIGPLAN workshop on Haskell, pages 69–79. ACMPress, 2004.

[6] M. Bravenboer and E. Visser. Concrete syntax for objects. Domain-specific language embedding and assimilation without restrictions. In D. C.Schmidt, editor, Proceedings of the 19th ACM SIGPLAN Conference onObject-Oriented Programing, Systems, Languages, and Applications (OOP-SLA’04), pages 365–383, Vancouver, Canada, October 2004. ACM Press.

[7] M. Bravenboer and E. Visser. Reusable and adaptable strategies for gen-erative programming. In M. Haveraaen et al., editors, GPCE SoftwareTransformation Systems Workshop (STSW’04), Vancouver, Canada, Oc-tober 2004. Position paper.

[8] A. Dijkstra and S. D. Swierstra. Explicit implicit parameters. UU-CS2004-059, 2004. submitted for publication.

[9] A. Dijkstra and S. D. Swierstra. Typing haskell with an attribute grammar.UU-CS 2004-0037, 2004. Lecture Notes of the summer school on AdvancedFunctional Programming 2005 (AFP05).

[10] E. Dolstra, M. de Jonge, and E. Visser. Nix: A safe and policy-free systemfor software deployment. In L. Damon, editor, 18th Large Installation Sys-tem Administration Conference (LISA ’04), pages 79–92, Atlanta, Georgia,USA, November 2004. USENIX.

[11] E. Dolstra, G. Florijn, M. de Jonge, and E. Visser. Transparantie in vari-abiliteit: Heldere keuzes in een eenduidige configuratieomgeving. Infor-matie, 46(1):18–21, Feb. 2004.

[12] E. Dolstra, E. Visser, and M. de Jonge. Imposing a memory managementdiscipline on software deployment. In J. Estublier and D. Rosenblum, ed-itors, 26th International Conference on Software Engineering (ICSE’04),pages 583–592, Edinburgh, Scotland, May 2004. IEEE Computer Society.

[13] A. Ehrenfeucht, J. Hage, T. Harju, and G. Rozenberg. Embedding inswitching classes with skew gains. In H. Ehrig, G. Engels, F. Parisi-Presicce,and G. Rozenberg, editors, Graph Transformations, Second InternationalConference, ICGT 2004, volume LNCS 3256, pages 257 – 270. SpringerVerlag, September/October 2004. Same as technical report UU-CS-2004-023.

[14] B. Fischer and E. Visser. Adding concrete syntax to a prolog-based pro-gram synthesis system (extended abstract). In M. Bruynooghe, editor, 13thInternational Symposium Logic Based Program Synthesis and Transforma-tion: , LOPSTR 2003, volume 3018 of Lecture Notes in Computer Science,pages 56–58, Heidelberg, November 2004. Springer-Verlag.

[15] B. Fischer and E. Visser. Retrofitting the AutoBayes program synthesissystem with concrete object syntax. In C. Lengauer et al., editors, Domain-Specific Program Generation, volume 3016 of Lecture Notes in ComputerScience, pages 239–253. Spinger-Verlag, 2004.

8

[16] J. Hage and T. Harju. A characterization of acyclic switching classes usingforbidden subgraphs. SIAM Journal on Discrete Mathematics, 18(1):159 –176, 2004.

[17] B. Heeren and J. Hage. A first attempt at type class directives. TechnicalReport UU-CS-2002-031, Institute of Information and Computing Science,University Utrecht, Netherlands, September 2004. Technical Report.

[18] B. Heeren and D. Leijen. Gebruiksvriendelijke compiler voor het onderwijs.Informatie, 46(8):46 – 50, Oktober 2004.


[20] G. Karsai and E. Visser, editors. Proceedings of the Third Interna-tional Conference on Generative Programming and Component Engineering(GPCE 2004), volume 3286 of Lecture Notes in Computer Science, Van-couver, Canada, October 2004. Springer.

[21] A. Loh. Exploring Generic Haskell. PhD thesis, Utrecht University, Sept.2004.

[22] L. Meertens. Calculating the Sieve of Eratosthenes. Journal of FunctionalProgramming, 14(6):759–763, 2004.

[23] L. Meertens and S. Fitzpatrick. The distributed construction of a globalcoordinate system in a network of static computational nodes from inter-node distances. Kestrel Institute Technical Report KES.U.04.04, KestrelInstitute, Palo Alto, 2004.

[24] H. Passier and J. Jeuring. Ontology based feedback generation in design-oriented e-learning systems. In P. Isaias, P. Kommers, and M. McPherson,editors, Proceedings of the IADIS International conference, e-Society, vol-ume II, pages 992–996, 2004.

[25] S. D. Swierstra. Linear, online, functional pretty printing (corrected andextended version. UU-CS 2004-025a, 2004. under consideration for JFP.

[26] E. Visser. Program transformation with Stratego/XT: Rules, strategies,tools, and systems in StrategoXT-0.9. In C. Lengauer et al., editors,Domain-Specific Program Generation, volume 3016 of Lecture Notes inComputer Science, pages 216–238. Spinger-Verlag, June 2004.

[27] T. E. J. Vos and S. D. Swierstra. Facilitating the verification of diffus-ing computations and their applications. In M. Solar, D. Fernndez-Baca,and E. Cuadros-Vargas, editors, 30ma Conferencia Latinoamericana deInformtica (CLEI2004), pages 42–53. Sociedad Peruana de Computacin,Sept. 2004. ISBN 9972-9876-2-0.

2003

[1] F. Atanassow, D. Clarke, and J. Jeuring. Scripting XML in Generic Haskell.Journal of Universal Computer Science, 2003. to appear.

9

[2] F. Atanassow, D. Clarke, and J. Jeuring. Scripting XML with GenericHaskell. Technical Report UU-CS-2003-023, Utrecht University, 2003.

[3] F. Atanassow, D. Clarke, and J. Jeuring. Scripting XML with GenericHaskell. In Proceedings of the 7th Brazilian Symposium on ProgrammingLanguages, SBLP 2003, 2003. An extended version of this paper appearsas ICS, Utrecht University, technical report UU-CS-2003-023.

[4] O. S. Bagge, K. T. Kalleberg, M. Haveraaen, and E. Visser. Design of theCodeBoost transformation system for domain-specific optimisation of C++programs. In D. Binkley and P. Tonella, editors, Third IEEE InternationalWorkshop on Source Code Analysis and Manipulation (SCAM’03), pages65–74, Amsterdam, September 2003. IEEE Computer Society Press.

[5] D. Clarke, editor. First International Workshop on Aliasing, Confinementand Ownershop in Object-Oriented Programming (IWACO), number UU-CS-2003-030. Utrecht University, July 2003. Workshop at ECOOP 2003.

[6] D. Clarke, S. Drossopoulou, and J. Noble. International workshop on alias-ing, confinement, and ownership in object-oriented programming: Work-shop report. In European Conference on Object-Oriented Programming(ECOOP’03): Workshop Reader, LNCS, Darmstadt, Germany, July 2003.to appear.

[7] D. Clarke and A. Loh. Generic haskell, specifically. In J. Gibbons andJ. Jeuring, editors, Generic Programming, IFIP, pages 21–47. Kluwer Aca-demic Publishers, 2003.

[8] D. Clarke, M. Richmond, and J. Noble. Saving the world from badbeans: Deployment-time confinement checking. In ACM Conference onObject-Oriented Programming Systems, Languages and Applications (OOP-SLA’03), Anaheim, California, USA, October 2003.

[9] D. Clarke and T. Wrigstad. External uniqueness. In 10th Workshop onFoundations of Object-Oriented Languages (FOOL), New Orleans, LA, Jan-uary 2003.

[10] D. Clarke and T. Wrigstad. External uniqueness is unique enough. InL. Cardelli, editor, European Conference on Object-Oriented Programming(ECOOP’03), volume 2743 of LNCS, pages 176–200, Darmstadt, Germany,July 2003.

[11] E. Dolstra. Integrating software construction and software deployment.In B. Westfechtel, editor, 11th International Workshop on Software Con-figuration Management (SCM-11), volume 2649 of Lecture Notes in Com-puter Science, pages 102–117, Portland, Oregon, USA, May 2003. Springer-Verlag.

[12] E. Dolstra, G. Florijn, M. de Jonge, and E. Visser. Capturing timelinevariability with transparent configuration environments. In J. Bosch andP. Knauber, editors, IEEE Workshop on Software Variability Management(SVM’03), Portland, Oregon, USA, May 2003. IEEE.

10

[13] E. Dolstra, G. Florijn, and E. Visser. Timeline variability: The variabilityof binding time of variation points. In J. van Gurp and J. Bosch, editors,Workshop on Software Variability Modeling (SVM’03), number 2003-7-01in IWI preprints, Groningen, The Netherlands, February 2003. ReseachInstitute of Computer Science and Mathematics, University of Groningen.

[14] B. Fischer and E. Visser. Adding concrete syntax to a Prolog-based pro-gram synthesis system (extended abstract). In M. Bruynooghe, editor, Pre-proceedings of the International Symposium on Logic Based Program Syn-thesis and Transformation (LOPSTR’03), number Report CW 365, pages39–48, Uppsala, Sweden, August 2003. Department of Computer Science,K. U. Leuven.

[15] S. Fitzpatrick and L. Meertens. Distributed coordination through anar-chic optimization. In V. Lesser, C. L. Ortiz, Jr., and M. Tambe, editors,Distributed Sensor Networks: A Multiagent Perspective, pages 257–295.Kluwer Academic Publishers, 2003.

[16] J. Fokker. Imperatief programmeren. Technical Report edu-450, Instituteof Information and Computing Sciences, Utrecht University, 2003.

[17] J. Gibbons and J. Jeuring, editors. Generic Programming. Proceedingsof the IFIP TC2 Working Conference on Generic Programming, SchlossDagstuhl, July 2002. Kluwer Academic Publishers, 2003.

[18] J. Hage. Enumerating submultisets of multisets. Inf. Proc. Letters,85(4):221 – 226, 2003.

[19] J. Hage, T. Harju, and E. Welzl. Euler graphs, triangle-free graphs andbipartite graphs in switching classes. Fundamenta Informaticae, 58(1):23–37, November 2003.

[20] B. Heeren, J. Hage, and S. D. Swierstra. Constraint based type inferencingin Helium. In M.-C. Silaghi and M. Zanker, editors, Workshop Proceedingsof Immediate Applications of Constraint Programming, pages 59 – 80, Cork,September 2003.

[21] B. Heeren, J. Hage, and S. D. Swierstra. Scripting the type inferenceprocess. In Eighth ACM Sigplan International Conference on FunctionalProgramming, pages 3 – 13, New York, 2003. ACM Press.

[22] B. Heeren, D. Leijen, and A. van IJzendoorn. Helium, for learning Haskell.In ACM Sigplan 2003 Haskell Workshop, pages 62 – 71, New York, 2003.ACM Press.

[23] R. Hinze and J. Jeuring. Generic Haskell: applications. In GenericProgramming, Advanced Lectures, volume 2793 of LNCS, pages 57–97.Springer-Verlag, 2003.

[24] R. Hinze and J. Jeuring. Generic Haskell: practice and theory. InGeneric Programming, Advanced Lectures, volume 2793 of LNCS, pages1–56. Springer-Verlag, 2003.

11


[26] R. Hughes and S. Swierstra. Polish parsers, step by step. In Eighth ACMSigplan International Conference on Functional Programming, pages 239–248, New York, August 2003. ACM Press.

[27] J. Jeuring. Het ontwikkelen van XML-tools (the development of XML tools,in Dutch). IT Monitor, (8):4–7, September 2003.

[28] J. Jeuring, editor. Proceedings Haskell Workshop. HW’03. ACM Press,2003.

[29] J. Jeuring and S. Peyton Jones, editors. Advanced Functional Programming,AFP’02, Advanced Lectures, volume 2638 of LNCS. Springer-Verlag, 2003.

[30] P. Johann and E. Visser. Strategies for fusing logic and control via lo-cal, application-specific transformations. Technical Report UU-CS-2003-050, Institute of Information and Computing Sciences, Utrecht University,February 2003.

[31] R. Lammel, E. Visser, and J. Visser. Strategic programming meets adaptiveprogramming. In Proceedings of Aspect-Oriented Software Development(AOSD’03), pages 168–177, Boston, USA, March 2003. ACM Press.

[32] D. Leijen. The λ Abroad – A Functional Approach to Software Components.PhD thesis, Utrecht University, Nov. 2003.

[33] A. Loh, D. Clarke, and J. Jeuring. Dependency-style generic haskell. InInternational Conference on Functional Programming (ICFP’03), Uppsala,Sweden, August 2003.

[34] J. Noble, R. Biddle, E. Tempero, A. Potanin, and D. Clarke. Towards amodel of encapsulation. In International Workshop on Aliasing, Confine-ment, and Ownership (IWACO), Darmstadt, Germany, July 2003.

[35] K. Olmos and E. Visser. Turning dynamic typing into static typing byprogram specialization. In D. Binkley and P. Tonella, editors, ThirdIEEE International Workshop on Source Code Analysis and Manipula-tion (SCAM’03), pages 141–150, Amsterdam, The Netherlands, September2003. IEEE Computer Society Press.

[36] I. Prasetya, T. Vos, A. Azurat, and S. Swierstra. !UNITY: A HOL theoryof general UNITY. In D. Basin and B. Wolff, editors, Emerging TrendsProceedings of 16th International Conference, Theorem Proving in HigherOrder Logics (TPHOL), pages 159–176, 2003. Also available as tech. reportNo. 187 of Inst. fur Inf., Albert-Ludwig-Univ. Freiburg. Available on-lineat http://www.informatik.uni-freiburg.de/tr.

[37] I. Prasetya, T. Vos, S. Swierstra, and B. Widjaja. A theory for compos-ing distributed components based on temporary interface. In 3rd Inter-national Workshop on Composition Languages, 2003. Available on-line atwww.cs.iastate.edu/ lumpe/WCL2003.

12

[38] I. Prasetya, T. Vos, S. Swierstra, and B. Widjaja. A theory for composingdistributed components based on temporary interface. In H. D. Van andZ. Liu, editors, Proceedings of the Workshop on Formal Aspects of Compo-nent Software (FACS), 2003. Also as UNU/IIST Report no. 284. Availableon-line at www.iist.unu.edu/newrh/III/1/page.html.

[39] J. van Wijngaarden and E. Visser. Program transformation mechanics.a classification of mechanisms for program transformation with a surveyof existing transformation systems. Technical Report UU-CS-2003-048,Institute of Information and Computing Sciences, Utrecht University., May2003.

2002

[1] A. Azurat and I. Prasetya. A preliminary report on xMECH. TechnicalReport UU-CS-2002-008, Inst. of Information and Comp. Science, UtrechtUniv., 2002. Download: www.cs.uu.nl/staff/wishnu.html.

[2] A. Azurat and I. Prasetya. A survey on embedding programminglogics in a theorem prover. Technical Report UU-CS-2002-007, Inst.of Information and Comp. Science, Utrecht Univ., 2002. Download:www.cs.uu.nl/staff/wishnu.html.

[3] A. I. Baars and S. D. Swierstra. Typing dynamic typing. In S. Peyton Jones,editor, Proceedings of the seventh ACM SIGPLAN international conferenceon Functional programming, pages 157–166. ACM Press, 2002.

[4] M. G. J. van den Brand, J. Scheerder, J. Vinju, and E. Visser. Disam-biguation filters for scannerless generalized LR parsers. In N. Horspool,editor, Compiler Construction (CC’02), volume 2304 of Lecture Notes inComputer Science, pages 143–158, Grenoble, France, April 2002. Springer-Verlag.

[5] M. Bravenboer and E. Visser. Rewriting strategies for instruction selec-tion. In S. Tison, editor, Rewriting Techniques and Applications (RTA’02),volume 2378 of Lecture Notes in Computer Science, pages 237–251, Copen-hagen, Denmark, July 2002. Springer-Verlag.

[6] D. Clarke and S. Drossopolou. Ownership, encapsulation and the disjoint-ness of type and effect. In ACM Conference on Object-Oriented Program-ming Systems, Languages and Applications (OOPSLA’02), Seattle, USA,November 2002.

[7] D. Clarke, J. Jeuring, and A. Loh. The generic haskell user’s guide (beryl re-lease). Technical Report UU-CS-2002-047, Utrecht University, July 2002.

[8] D. Clarke and A. Loh. Generic haskell, specifically. In IFIP WG2.1 WorkingConference on Generic Programming, pages 21–47. Dagstuhl, Germany,July 2002.

[9] A. van Deursen and E. Visser. The reengineering wiki. In Proceed-ings 6th European Conference on Software Maintenance and Reengineering(CSMR)., pages 217–220. IEEE Computer Society, 2002.

13

[10] E. Dolstra and E. Visser. Building interpreters with rewriting strategies.In M. van den Brand and R. Lammel, editors, Workshop on Language De-scriptions, Tools and Applications (LDTA’02), volume 65/3 of ElectronicNotes in Theoretical Computer Science, Grenoble, France, April 2002. El-sevier Science Publishers.

[11] B. Fischer and E. Visser, editors. Proceedings of the 2002 ACM SIGPLANWorkshop on Rule-Based Programming (RULE’02), Pittsburgh, Pennsyl-vania, USA, October 5, 2002. Association for Computing Machinery.

[12] S. Fitzpatrick and L. Meertens. Experiments on dense graphs with astochastic, peer-to-peer colorer. In C. Gomes and T. Walsh, editors, Prob-abilistic Approaches in Search, Workshop at Eighteenth National Conf. onArtificial Intelligence (AAAI 2002), pages 24–28. AAAI Press, 2002.

[13] S. Fitzpatrick and L. Meertens. Scalable, anytime constraint optimizationthrough iterated, peer-to-peer interaction in sparsely-connected networks.In H. Ehrig, B. Kramer, and A. Ertas, editors, Proc. Sixth Biennial WorldConf. on Integrated Design & Process Technology (IDPT 2002). Society forDesign and Process Science, 2002.

[14] J. Hage, T. Harju, and E. Welzl. Euler graphs, triangle-free graphs andbipartite graphs in switching classes. In A. Corradini, H. Ehrig, H.-J.Kreowski, and G. Rozenberg, editors, Graph Transformation, First Int.Conf, ICGT 2002, volume 2505 of Lecture Notes in Computer Science,pages 48–60, Berlin, 2002. Springer Verlag.

[15] B. Heeren and J. Hage. Parametric type inferencing for helium. TechnicalReport UU-CS-2002-035, Institute of Information and Computing Science,University Utrecht, Netherlands, August 2002. Technical Report.

[16] B. Heeren, J. Hage, and D. Swierstra. Generalizing hindley-milner typeinference algorithms. Technical Report UU-CS-2002-031, Institute of In-formation and Computing Science, University Utrecht, Netherlands, July2002. Technical Report.

[17] B. Heeren, J. Hage, and S. Swierstra. Generalizing hindley-milner typeinference algorithms. UU-CS 2002-31, Department of Computer Science,Utrecht University, 2002.

[18] B. Heeren, J. Jeuring, S. D. Swierstra, and P. A. Alcocer. Improving type-error messages in functional languages. Technical Report UU-CS-2002-009, Institute of Information and Computing Science, University Utrecht,Netherlands, February 2002. Technical Report.

[19] R. Hinze. Functional pearl: A fresh look at binary search trees. Journal ofFunctional Programming, 2002. In press.

[20] R. Hinze. Functional pearl: Formatting: a class act. Journal of FunctionalProgramming, 2002. In press.

[21] R. Hinze. Polytypic values possess polykinded types. Science of Com-puter Programming, Special issue on Mathematics of Program Construc-tion, 2002. In press.

14

[22] R. Hinze, J. Jeuring, and A. Loh. Type-indexed data types. In Pro-ceedings of the 6th International Conference on Mathematics of ProgramConstruction, MPC’02, volume 2386 of LNCS, pages 148–174. Springer-Verlag, 2002. Also appeared as ICS, Utrecht University, technical reportUU-CS-2002-11.

[23] P. Jansson and J. Jeuring. Polytypic data conversion programs. Science ofComputer Programming, 43(1):35–75, 2002.

[24] L. Meertens and S. Fitzpatrick. Asynchronous execution and communica-tion latency in distributed constraint optimization. In M. Yokoo, editor,Proc. Third International Workshop on Distributed Constraint Reasoning,First International Joint Conf. on Autonomous Agents & Multiagent Sys-tems (AAMAS 2002), pages 80–85, 2002.

[25] K. Olmos and E. Visser. Strategies for source-to-source constant prop-agation. In B. Gramlich and S. Lucas, editors, Workshop on ReductionStrategies (WRS’02), volume 70 of Electronic Notes in Theoretical Com-puter Science, page 20, Copenhagen, Denmark, July 2002. Elsevier SciencePublishers.

[26] I. Prasetya, A. Azurat, and S. Swierstra. Embedding programming logicsin HOL theorem prover. Jurnal Ilmu Komputer dan Teknologi Informasi,2(1), 2002.

[27] I. Prasetya and S. Swierstra. Factorizing fault tolerance. Journal ofTheoretical Computer Science, Special Edition on Dependable Computing,290(2):1201–1222, october 2002.

[28] I. Prasetya, T. Vos, and S. Swierstra. Introduction to Correctness Approachin Programming, Lecture Notes. Universiteit Utrecht, Instituut Informaticaen Informatiekunde, 2002. Website is in dutch.

[29] M. Schrage, J. Jeuring, and S. Swierstra. Combinators for layered softwarearchitectures. UU-CS 2002-30, 2002.

[30] P. van Oostrum. Collegedictaat Systeemarchitectuur. Universiteit Utrecht,Instituut voor Informatica en Informatiekunde, dec 2002.

[31] E. Visser. Meta-programming with concrete object syntax. In D. Batory,C. Consel, and W. Taha, editors, Generative Programming and ComponentEngineering (GPCE’02), volume 2487 of Lecture Notes in Computer Sci-ence, pages 299–315, Pittsburgh, PA, USA, October 2002. Springer-Verlag.

[32] T. Vos, S. Swierstra, and I. Prasetya. Yet another program refinementrelation. In International Workshop on Refinement of Critical Systems:Methods, Tools and Experience, 2002.

2001

[1] A. Baars, A. Loh, and S. Swierstra. Parsing permutation phrases. InR. Hinze, editor, Proceedings of the 2001 ACM SIGPLAN Haskell Work-shop, pages 171–182. Elsevier, 2001.

15

[2] A. I. Baars, A. Loh, and S. D. Swierstra. Parsing permutation phrases. InProceedings of the 2001 ACM SIGPLAN Workshop, volume 59 of EletronicNotes in Theoretical Computer Science. ACM Press, 2001. Also appearedin the preliminary proceedings, Technical Report of Universiteit Utrecht,UU-CS-2001-23.

[3] O. S. Bagge, M. Haveraaen, and E. Visser. CodeBoost: A frameworkfor the transformation of C++ programs. Technical Report UU-CS-2001-32, Institute of Information and Computing Sciences, Utrecht University,2001.

[4] L. Bijlsma. Model-based specification. Information Processing Letters,77:77–84, 2001.

[5] M. G. J. van den Brand, J. Heering, H. de Jong, M. de Jonge, T. Kuipers,P. Klint, L. Moonen, P. Olivier, J. Scheerder, J. Vinju, E. Visser, andJ. Visser. The Asf+Sdf Meta-Environment: a component-based languagelaboratory. In R. Wilhelm, editor, Compiler Construction (CC’01), volume2027 of Lecture Notes in Computer Science, pages 365–368, Genova, Italy,April 2001. Springer-Verlag.

[6] M. Bravenboer and E. Visser. Guiding visitors: Separating navigation fromcomputation. Technical Report UU-CS-2001-42, Institute of Informationand Computing Sciences, Utrecht University, 2001.

[7] D. Clarke. An object calculus with ownership and containment. In Founda-tions of Object-oriented Programming (FOOL8), London, January 2001.

[8] D. Clarke. Object Ownership and Containment. PhD thesis, University ofNew South Wales, July 2001.

[9] D. Clarke. On deleting aggregate objects. In SPACE’01, London, January2001. Informal Proceedings.

[10] D. Clarke, R. Hinze, J. Jeuring, A. Loh, and J. de Wit. The generic haskelluser’s guide (amber release). Technical Report UU-CS-2001-026, UtrechtUniversity, November 2001.

[11] D. Clarke, J. Noble, and J. Potter. Simple ownership types for objectcontainment. In European Conference on Object-Oriented Programming(ECOOP’01), Budapest, Hungary, 2001.

[12] V. Costas and S. Swierstra. Generador de parsers basado en combinadores.In J. M. C. and C. Isabel Besembel, editors, XXVII Conferencia Lati-noamericana de INFORMATICA (CLEI 2001), page 120, 2001.

[13] A. Dijkstra and D. Swierstra. Implementation of Programming Languages,Lecture Notes. Utrecht University, Institute of Information and ComputingSciences, 2001.

[14] A. Dijkstra and D. Swierstra. Lazy Functional Parser Combinators inJava. In Proceedings of 1st Workshop on Multiparadigm Programming withObject-Oriented Languages (MPOOL), pages 11–42. John von NeumannInstitute for Computing, 2001.

16

[15] E. Dolstra. First class rules and generic traversals for program transforma-tion languages. Master’s thesis, Institute of Information and ComputingSciences, Utrecht University, Utrecht, The Netherlands, August 2001. INF-SCR-01-01.

[16] E. Dolstra. Functional stratego. In E. Visser, editor, Second Stratego UsersDay, Utrecht, The Netherlands, February 2001.

[17] E. Dolstra and E. Visser. First-class rules and generic traversal. TechnicalReport UU-CS-2001-38, Institute of Information and Computing Sciences,Utrecht University, Utrecht, The Netherlands, 2001.

[18] S. Fitzpatrick and L. Meertens. An experimental assessment of a stochastic,anytime, decentralized soft colourer for sparse graphs. In K. Steinhoefel,editor, Stochastic Algorithms: Foundations and Applications, Proc. SAGA2001, LNCS 2264, pages 49–64, 2001.

[19] S. Fitzpatrick and L. Meertens. Peer-to-peer coordination of autonomoussensors in high-latency networks using distributed scheduling and data fu-sion. Kestrel Institute Technical Report KES.U.01.09, Kestrel Institute,Palo Alto, 2001.

[20] S. Fitzpatrick and L. Meertens. Soft, real-time, distributed graph coloringusing decentralized, synchronous, stochastic, iterative-repair, anytime al-gorithms — a framework. Kestrel Institute Technical Report KES.U.01.05,Kestrel Institute, Palo Alto, 2001.

[21] J. Hage. Structural Aspects Of Switching Classes. PhD the-sis, Leiden Institute of Advanced Computer Science, 2001.http://www.cs.uu.nl/people/jur/2s.html.

[22] R. Hinze, editor. Proceedings of the 2001 ACM SIGPLAN Haskell Work-shop (HW’2001), 2nd September 2001, Firenze, Italy., Electronic Notes inTheoretical Computer Science, Vol 59. Utrecht University, 2001. UU-CS-2001-23.

[23] R. Hinze. A simple implementation technique for priority search queues. InX. Leroy, editor, Proceedings of the International Conference on FunctionalProgramming, Firenze, Italy, September 3-5, 2001, 2001.

[24] R. Hinze and J. Jeuring. Functional pearl: Weaving a web. 11(6):681–689,2001.

[25] P. Johann and E. Visser. Fusing logic and control with local transfor-mations: An example optimization. In B. Gramlich and S. Lucas, ed-itors, Workshop on Reduction Strategies in Rewriting and Programming(WRS’01), volume 57 of Electronic Notes in Theoretical Computer Science,Utrecht, The Netherlands, May 2001. Elsevier Science Publishers.

[26] M. de Jonge, E. Visser, and J. Visser. Collaborative software development.Technical Report SEN-R0113, CWI, Amsterdam, The Netherlands, 2001.

17

[27] M. de Jonge, E. Visser, and J. Visser. XT: A bundle of program transfor-mation tools. In M. G. J. van den Brand and D. Perigot, editors, Workshopon Language Descriptions, Tools and Applications (LDTA’01), volume 44of Electronic Notes in Theoretical Computer Science. Elsevier Science Pub-lishers, April 2001.

[28] D. Leijen and E. Meijer. Parsec: Direct style monadic parser combina-tors for the real world. Technical Report UU-CS-2001-27, Department ofComputer Science, Universiteit Utrecht, 2001.

[29] E. Meijer, N. Perry, and A. van IJzendoorn. Scripting .net using mondrian.In Object-Oriented Programming (ECOOP 2001), volume 2072 of LNCS,pages 150–, June 2001.

[30] I. Prasetya, A. Azurat, and S. Swierstra. Sebuah framework untukmekanisasi multi logika. Jurnal Ilmu Komputer dan Teknologi Informasi,1(2), 2001.

[31] I. Prasetya, S. Swierstra, and B. Widjaja. Teori komposisi komponen.Jurnal Ilmu Komputer dan Teknologi Informasi, 1(1), 2001.

[32] D. Swierstra. Combinator parsers: From toys to tools. In G. Hutton, edi-tor, Electronic Notes in Theoretical Computer Science, volume 41. ElsevierScience Publishers, 2001.

[33] A. van IJzendoorn. Extreme programming. TINFON, 10(2):48–50, August2001.

[34] E. Visser, editor. Proceedings of the Second Stratego Users Day (SUD’01),Utrecht, The Netherlands, February 2001. Institute for Information andComputing Sciences, Utrecht University.

[35] E. Visser. Scoped dynamic rewrite rules. In M. van den Brand andR. Verma, editors, Rule Based Programming (RULE’01), volume 59/4 ofElectronic Notes in Theoretical Computer Science. Elsevier Science Pub-lishers, September 2001.

[36] E. Visser. Stratego: A language for program transformation based onrewriting strategies. System description of Stratego 0.5. In A. Middeldorp,editor, Rewriting Techniques and Applications (RTA’01), volume 2051 ofLecture Notes in Computer Science, pages 357–361. Springer-Verlag, May2001.

[37] E. Visser. A survey of rewriting strategies in program transformation sys-tems. In B. Gramlich and S. Lucas, editors, Workshop on Reduction Strate-gies in Rewriting and Programming (WRS’01), volume 57 of ElectronicNotes in Theoretical Computer Science, Utrecht, The Netherlands, May2001. Elsevier Science Publishers.

2000

[1] O. S. Bagge, M. Haveraaen, and E. Visser. A C++ transformation frame-work (extended abstract). In Proceedings of the Nordic Workshop on Pro-gramming Theory (NWPT’00), Bergen, Norway, October 2000.

18

[2] A. Ehrenfeucht, J. Hage, T. Harju, and G. Rozenberg. Complexity is-sues in switching of graphs. In H. Ehrig, G. Engels, H.-J. Kreowski, andG. Rozenberg, editors, Theory And Application Of Graph Transformations- TAGT ’98, volume 1764 of Lecture Notes in Computer Science, pages59–70, Berlin, 2000. Springer Verlag.

[3] A. Ehrenfeucht, J. Hage, T. Harju, and G. Rozenberg. Pancyclicity inswitching classes. Inf. Proc. Letters, 73(5–6):153 – 156, 2000.

[4] J. Hage and T. Harju. A characterization of acyclic switching classes usingforbidden subgraphs. Technical Report 5, Leiden University, Departmentof Computer Science, 2000. Old version in Technical report.

[5] J. Hage and T. Harju. The size of switching classes with skew gains. DiscreteMath., 215:81 – 92, 2000.

[6] P. Jansson and J. Jeuring. A framework for polytypic programming onterms, with an application to rewriting. In Workshop on Generic Program-ming, 2000. Appeared in Utrecht University technical report UU-CS-2000-19.

[7] J. Jeuring, editor. Workshop on Generic Programming. Utrecht University,2000. Technical report UU-CS-2000-19.

[8] J. Jeuring, C. Lengauer, and M. Sheeran, editors. Special issue of Sci-ence of Computer Programming on Mathematics of Program Construction,volume 37. Elsevier Science, 2000.

[9] P. Johann and E. Visser. Warm fusion in Stratego: A case study in thegeneration of program transformation systems. Annals of Mathematics andArtificial Intelligence, 29(1–4):1–34, 2000.

[10] K. B. Oege de Moor and S. D. Swierstra. First class attribute gram-mars. Informatica: An International Journal of Computing and Infor-matics, 24(2):329–341, June 2000. Special Issue: Attribute grammars andTheir Applications.

[11] I. Prasetya and S. Swierstra. Formal design of self-stabilizing pro-grams: Theory and examples. Technical Report UU-CS-2000-07, Inst.of Information and Comp. Science, Utrecht Univ., 2000. Download:www.cs.uu.nl/staff/wishnu.html.

[12] I. Prasetya, S. Swierstra, and B. Widjaja. Component-wise formal ap-proach to design distributed systems. Technical Report UU-CS-2000-01,Inst. of Information and Comp. Science, Utrecht Univ., 2000. Download:www.cs.uu.nl/staff/wishnu.html.

[13] J. Saraiva, D. Swierstra, and M. Kuiper. Functional Incremental AttributeEvaluation. In David Watt, editor, 9th International Conference on Com-piler Construction, CC/ETAPS2000, volume 1781 of LNCS, pages 279–294.Springer-Verlag, Mar. 2000.

19

[14] J. A. Saraiva and S. D. Swierstra. Generating spreadheet-like tools fromstrong attribute grammars. In F. Pfenning and Y. Smaragdakis, editors,Generative Programming and Component Engeneering, Second Interna-tional Conference, GPCE 2003, number 2830 in LNCS, pages 307–223.Springer-Verlag, 2000.

[15] P. van Oostrum. Gedistribueerde systemen en netwerken. In P. van Oost-rum and D. Thierens, editors, Nieuwe ontwikkelingen in hardware en soft-ware. Universiteit Utrecht, NW&I, 2000.

[16] E. Visser. Language independent traversals for program transformation. InJ. Jeuring, editor, Workshop on Generic Programming (WGP’00), Ponte deLima, Portugal, July 2000. Technical Report UU-CS-2000-19, Departmentof Information and Computing Sciences, Universiteit Utrecht.

[17] T. Vos and S. Swierstra. Program refinement in unity. UU-CS 2000-41,2000.

[18] T. Vos and S. Swierstra. Proving distributed hylomorphisms. UU-CS 2000-40, 2000.

[19] T. Vos and S. D. Swierstra. Defining a non-concrete recursive type in holwhich includes sets. UU-CS 2000-09, 2000.

[20] T. Vos and S. D. Swierstra. Sequential program composition in unity. UU-CS 2000-10, 2000.

1999

[1] R. Backhouse, P. Jansson, J. Jeuring, and L. Meertens. Generic program-ming — an introduction. In Advanced Functional Programming, AFP’98,volume 1608 of LNCS, pages 28–115. Springer-Verlag, 1999.

[2] A. Bleeker and L. Meertens. Knowledge in security protocols: an oper-ational semantics for BAN logic. In C. Areces and M. de Rijke, editors,Workshop Proc. Methods for Modalities 1. ILLC, University of Amsterdam,1999.

[3] D. Clarke, J. Noble, and J. Potter. Overcoming representation expo-sure. In Intercontinental Workshop on Aliasing in Object-Oriented Systems(IWAOOS), At European Conference on Object-Oriented Programming(ECOOP’99), Lisbon, Portugal, June 1999.

[4] D. Clarke, J. Noble, and J. Potter. Who’s afraid of ownership types?Technical report, Microsoft Research Institute, 1999.

[5] A. Dijkstra, M. Schrage, and D. Swierstra. Skit, an openarchitecture for courseware authoring. UU-CS 1999-26, 1999.http://fairway.ecn.purdue.edu/ fie/fie99/pages/index.htm.

[6] S. Finne, D. Leijen, E. Meijer, and S. P. Jones. Calling hell from heaven andheaven from hell. In the International Conference on Functional Program-ming (ICFP), Paris, France, Sept. 1999. Also appeared in ACM SIGPLANNotices 34, 9, (Sep. 1999).

20

[7] J. Hage. The membership problem for switching classes with skew gains.Fundamenta Informaticae, 39(4):375–387, 1999.

[8] P. Jansson and J. Jeuring. Polytypic compact printing and parsing. InS. D. Swierstra, editor, Proceedings of the 8th European Symposium onProgramming, ESOP’99, volume 1576 of LNCS, pages 273–287. Springer-Verlag, 1999.

[9] J. Jeuring and S. D. Swierstra. Advanced programming concepts in a courseon grammars and parsing. In M. Felleisen, M. Hanus, and S. Thompson,editors, Proceedings Workshop on Functional and Declarative Programmingin Education, FDPE’99, pages 7–12, 1999. Rice COMP TR99-346.


[11] D. Leijen and E. Meijer. Domain specific embedded compilers. In SecondUSENIX Conference on Domain Specific Languages (DSL’99), pages 109–122, Austin, Texas, Oct. 1999. USENIX Association. Also appeared inACM SIGPLAN Notices 35, 1, (Jan. 2000).

[12] D. Leijen, E. Meijer, and J. Hook. Haskell as an automation controller.In the 3rd International Summerschool on Advanced Functional Program-ming, volume 1608 of LNCS, pages 268–288, Braga, Portugal, Sept. 1999.Springer-Verlag.

[13] J. Noble, D. Clarke, and J. Potter. Object ownership for dynamic aliasprotection. In TOOLS Pacific, Melbourne, Australia, November 1999.

[14] M. M. Schrage, A. Dijksta, and S. D. Swierstra. Skit, an open architecturefor courseware authoring. In FIE 99, Frontiers in Education Conference.IEEE, 1999.

[15] D. Swierstra, P. Henriques, and J. Oliveira. Advanced Functional pro-gramming, Third International School, AFP’98. Number 1608 in LNCS.Springer, 1999.

[16] S. D. Swierstra, editor. ESOP99: European Symposium on Programming,volume 1576 of LNCS, 1999.

[17] S. D. Swierstra and P. R. Azero Alcocer. Fast, error correcting parsercombinators: a short tutorial. In J. Pavelka, G. Tel, and M. Bartosek,editors, SOFSEM’99 Theory and Practice of Informatics, 26th Seminaron Current Trends in Theory and Practice of Informatics, volume 1725 ofLNCS, pages 111–129, November 1999.

[18] S. D. Swierstra, P. R. Azero Alocer, and J. Saraiava. Designing and im-plementing combinator languages. In D. Swierstra, P. Henriques, andJ. Oliveira, editors, Advanced Functional Programming, Third InternationalSchool, AFP’98, volume 1608 of LNCS, pages 150–206. Springer-Verlag,1999.

21

[19] P. van Oostrum. Using emacs and aucTEX for preparing LATEX documents.MAPS, 23:108–112, 1999.

[20] E. Visser. A bootstrapped compiler for strategies (extended abstract). InB. Gramlich, H. Kirchner, and F. Pfenning, editors, Strategies in AutomatedDeduction (STRATEGIES’99), pages 73–83, Trento, Italy, July 5 1999.

[21] E. Visser. Strategic pattern matching. In P. Narendran and M. Rusi-nowitch, editors, Rewriting Techniques and Applications (RTA’99), volume1631 of Lecture Notes in Computer Science, pages 30–44, Trento, Italy, July1999. Springer-Verlag.

1998

[1] P. Azero and S. D. Swierstra. Optimal pretty-printing combinators.Available from: http://www.cs.ruu.nl/groups/ST/Software/PP/, Apr.1998.

[2] A. Bijlsma. An application of program derivation techniques to 18th-century mathematics. In J. Jeuring, editor, Mathematics of Program Con-struction, number 1422 in Lecture Notes in Computer Science, pages 44–51,Berlin, 1998. Springer.

[3] L. Bijlsma and R. Nederpelt. Dijkstra-scholten predicate calculus: conceptsand misconceptions. Acta Informatica, 35:1007–1036, 1998.

[4] R. Bird and L. Meertens. Nested datatypes. In J. Jeuring, editor, Mathe-matics of Program Construction, LNCS 1422, pages 52–67, 1998.

[5] D. Clarke, J. Potter, and J. Noble. Ownership types for flexible aliasprotection. In ACM Conference on Object-Oriented Programming Systems,Languages and Applications (OOPSLA’98), Vancouver, Canada, October1998.

[6] D. Clarke, J. Potter, and J. Noble. The soundness of ownership types forflexible alias protection. Technical report, Microsoft Research Institute,1998.

[7] D. Clarke, R. Shelswell, J. Potter, and J. Noble. Object ownership to order.Technical report, Microsoft Research Institute, 1998.

[8] A. M. Cohen and L. Meertens. The Acela project: aims and plans. InN. Kajler, editor, Computer-Human Interaction in Symbolic Computation,Texts and Monographs in Symbolic Computation. Springer-Verlag, Wien,New-York, 1998.

[9] S. Finne, D. Leijen, E. Meijer, and S. P. Jones. H/Direct: A Binary ForeignLanguage Interface to Haskell. In the International Conference on Func-tional Programming (ICFP), Baltimore,USA, 1998. Also appeared in ACMSIGPLAN Notices 34, 1, (Jan. 1999).

[10] J. Fokker. Functioneel programmeren. Technical Report edu-431, Instituteof Information and Computing Sciences, Utrecht University, 1998.

22

[11] J. Hage and T. Harju. Acyclicity of switching classes. European J. Combin.,19:321–327, 1998.

[12] P. Jansson and J. Jeuring. Functional pearl: Polytypic unification. Journalof Functional Programming, 8(5):527–536, September 1998.

[13] P. Jansson and J. Jeuring. PolyLib – a polytypic function library. InWorkshop on Generic Programming, Marstrand, June 1998.

[14] J. Jeuring, editor. Mathematics of Program Construction, volume 1422 ofLNCS. Springer-Verlag, 1998.

[15] L. Meertens. Functor pulling. In R. Backhouse and T. Sheard, editors,Proc. Workshop on Generic Programming, 1998.

[16] E. Meijer, D. Leijen, and J. Hook. Client-side web scripting withHaskellScript. In Practical Aspects of Declarative Languages (PADL), vol-ume 1551, pages 196–210, Berlin, 1998. Springer-Verlag.

[17] J. Noble, D. Clarke, and J. Potter. Dynamic alias protection in prototype-based languages. In Thinking with Prototypes Workshop at OOPSLA’98,Vancouver, Canada, October 1998.

[18] S. Peyton Jones, E. Meijer, and D. Leijen. Scripting COM components fromHaskell. In Fifth International Conference on Software Reuse (ICSR’98),Victoria, B.C., Canada, June 1998. IEEE Computer Society Press.

[19] J. Potter, D. Clarke, and J. Noble. A mode system for flexible alias pro-tection. In Formal Methods Pacific ’98, Canberra, Australia, June 1998.

[20] J. Potter, J. Noble, and D. Clarke. The ins and outs of objects. In Aus-tralian Software Engineering Conference, Adelaide, Australia, November1998. IEEE Press.

[21] S. D. Swierstra and P. Azero. Attribute grammars in the functional style.In Proceedings of the SI2000. Chapman-Hall, 1998.

[22] A. J. M. van Gasteren and A. Bijlsma. An extension of the programderivation format. In D. Gries and W.-P. de Roever, editors, ProgrammingConcepts and Methods, pages 167–185, London, 1998. IFIP, Chapman andHall.

[23] P. van Oostrum. Handleiding Unix. Universiteit Utrecht, vakgroep Infor-matica, juli 1998.

[24] E. Visser. Polymorphic syntax definition. Theoretical Computer Science,199:57–86, 1998.

[25] E. Visser and Z.-e.-A. Benaissa. A core language for rewriting. In C. Kirch-ner and H. Kirchner, editors, Second International Workshop on RewritingLogic and its Applications (WRLA’98), volume 15 of Electronic Notes inTheoretical Computer Science, Pont-a-Mousson, France, September 1998.Elsevier Science Publishers.

23

[26] E. Visser, Z.-e.-A. Benaissa, and A. Tolmach. Building program optimizerswith rewriting strategies. In Proceedings of the third ACM SIGPLAN Inter-national Conference on Functional Programming (ICFP’98), pages 13–26.ACM Press, September 1998.

1997

[1] R. Bird and L. Meertens, editors. Algorithmic Languages and Calculi.Chapman & Hall, London, 1997.

[2] A. Bleeker and L. Meertens. A semantics for BAN logic. In Proc. DIMACSWorkshop on Design and Formal Verification of Security Protocols, NewBrunswick, NJ, 1997.

[3] A. Ehrenfeucht, J. Hage, T. Harju, and G. Rozenberg. Complexity prob-lems in switching classes of graphs. Technical Report 15, Leiden University,Department of Computer Science, 1997.

[4] P. Jansson and J. Jeuring. PolyP — a polytypic programming languageextension. In Conference Record of POPL ’97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 470–482. ACM Press, 1997.

[5] B. Luttik and E. Visser. Specification of rewriting strategies. In M. P. A.Sellink, editor, 2nd International Workshop on the Theory and Practice ofAlgebraic Specifications (ASF+SDF’97), Electronic Workshops in Comput-ing, Berlin, November 1997. Springer-Verlag.

[6] I. Prasetya. Mechanically verified self-stabilizing hierarchical algorithms.Lecture Notes in Computer Science, 1217:399 – 415, 1997.

[7] J. Saraiva, M. Kuiper, and D. Swierstra. Effective Function Cache Man-agement for Incremental Attribute Evaluation. In C. Clark, T. Davie, andK. Hammond, editors, 9th International Workshop on Implementation ofFunctional Languages, pages 517–528, St Andrews, Scotland, September1997.

[8] J. Saraiva, M. Kuiper, and D. Swierstra. Specializing Trees for EfficientFunctional Decoration. In M. Leuschel, editor, ILPS97 Workshop on Spe-cialization of Declarative Programs and its Applications, pages 63–72, Oc-tober 1997. (Also available as Technical Report CW 255, Department ofComputer Science, Katholieke Universiteit Leuven , Belgium).

[9] J. Saraiva, D. Swierstra, and M. Kuiper. Strictification of Com-putations on Trees. Technical report UU-CS-1997-30, Depart-ment of Computer Science, Utrecht University, August 1997.ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1997/1997-30.ps.gz.

[10] E. Visser. A case study in optimizing parsing schemata by disambigua-tion filters. In International Workshop on Parsing Technology (IWPT’97),pages 210–224, Boston, USA, September 1997. Massachusetts Institute ofTechnology.

24

[11] E. Visser. Character classes. Technical Report P9708, Programming Re-search Group, University of Amsterdam, August 1997.

[12] E. Visser. A family of syntax definition formalisms. Technical ReportP9706, Programming Research Group, University of Amsterdam, July1997.

[13] E. Visser. From context-free grammars with priorities to character classgrammars. In Liber Amicorum Paul Klint. CWI, Amsterdam, November1997.

[14] E. Visser. Scannerless generalized-LR parsing. Technical Report P9707,Programming Research Group, University of Amsterdam, July 1997.

[15] E. Visser. Syntax Definition for Language Prototyping. PhD thesis, Uni-versity of Amsterdam, September 1997.

[16] T. E. J. Vos and S. D. Swierstra. Make your enemies transparent. InProceedings of the 23rd International Workshop on Grpah-Theoretic Con-cepts in Computer Science, volume 1335 of LNCS, pages 342–353. Springer-Verlag, 1997.

1996

[1] A. Bijlsma and C. S. Scholten. Point-free substitution. Science of ComputerProgramming, 27:205–214, 1996.

[2] M. G. J. van den Brand and E. Visser. Generation of formatters for context-free languages. ACM Transactions on Software Engineering and Method-ology, 5(1):1–41, January 1996.

[3] J. Hage and T. Harju. The size of 2-classes in group labeled 2-structures.Technical Report 17, Leiden University, Department of Computer Science,1996. Generalized in [?].

[4] B. Jay, D. Clarke, and J. Edwards. Exploiting shape in parallel program-ming. In IEEE Second International Conference for Algorithms and Archi-tecture for Parallel Processing, Singapore, June 1996.

[5] J. Jeuring and P. Jansson. Polytypic programming. In J. Launchbury,E. Meijer, and T. Sheard, editors, Advanced Functional Programming,AFP’96, volume 1129 of LNCS, pages 68–114. Springer-Verlag, 1996.

[6] H. Kuchen and S. D. Swierstra, editors. Proceedings of the the 8th Inter-national PLILP Symposium Programming Languages: Implementations,Logics and Programs, volume 1140 of LNCS, 1996.

[7] L. Meertens. Calculate polytypically! In H. Kuchen and S. D. Swierstra,editors, Programming Languages: Implementations Logics, and Programs,Proc. Eighth International Symposium PLILP ’96, LNCS 1140, pages 1–16.Springer-Verlag, 1996.

[8] I. Prasetya. Formalizing UNITY with HOL. Technical Report UU-CS-1996-01, Inst. of Information and Comp. Science, Utrecht Univ., 1996. Download:www.cs.uu.nl/staff/wishnu.html.

25

[9] J. Saraiva, M. Kuiper, and S. D. Swierstra. Effective function cache man-agement for incremental attribute evaluation. UU-CS 1996-50, 1996.

[10] J. Saraiva, S. D. Swierstra, M. Kuiper, and M. Pennings. Strictification oflazy functions. UU-CS 1996-51, 1996.

[11] S. D. Swierstra and L. Duponcheel. Deterministic, error-correcting com-binator parsers. In J. Launchbury, E. Meijer, and T. Sheard, editors,Advanced Functional Programming, volume 1129 of LNCS-Tutorial, pages184–207. Springer-Verlag, 1996.

[12] P. van Oostrum. Page layout in LATEX. MAPS, 16:108–125, 1996.

[13] E. Visser. Multi-level specifications. Technical Report P9604, ProgrammingResearch Group, University of Amsterdam, April, 1996. Appeared in A. vanDeursen and J. Heering and P. Klint, Language Prototyping. An AlgebraicSpecification Approach. World Scientific, 1996.

[14] E. Visser. Multi-level specifications. In A. van Deursen, J. Heering, andP. Klint, editors, Language Prototyping. An Algebraic Specification Ap-proach, volume 5 of AMAST Series in Computing, pages 105–196. WorldScientific, Singapore, September 1996.

[15] E. Visser. Solving type equations in multi-level specifications (preliminaryversion). Technical Report P9606, Programming Research Group, Univer-sity of Amsterdam, Amsterdam, May 1996.

[16] T. Vos, S. Swierstra, and I. Prasetya. Formal methods and me-chanical verification applied to the development of a convergent dis-tributed sorting program. Technical Report UU-CS-1996-37, Inst. ofInformation and Comp. Science, Utrecht Univ., 1996. Download:www.cs.uu.nl/staff/wishnu.html.

1995

[1] A. Bijlsma, R. W. Bulterman, W. H. J. Feijen, A. J. M. van Gasteren,R. R. Hoogerwoord, C. S. Scholten, and F. W. van der Sommen. Phasesynchronization for a string of machines. In E. Aarts, H. ten Eikelder,C. Hemerik, and M. Rem, editors, Simplex sigillum veri, pages 129–138.Eindhoven University of Technology, 1995.

[2] A. Bijlsma, R. W. Bulterman, W. H. J. Feijen, A. J. M. van Gasteren, C. S.Scholten, F. W. van der Sommen, and A. I. J. Wijnands. Calculating thegalois adjoint. Information Processing Letters, 53:137–139, 1995.

[3] M. G. J. van den Brand, A. van Deursen, T. B. Dinesh, J. F. T. Kamper-man, and E. Visser, editors. Generating Tools from Algebraic Specifications(ASF+SDF’95). Technical Report P9504, Programming Research Group,University of Amsterdam, May 1995.

[4] M. G. J. van den Brand and E. Visser. The ASF+SDF Meta-environment:Documentation tools for free! In P. D. Mosses, M. Nielsen, and M. I.Schwartzbach, editors, Theory and Practice of Software Development

26

(TAPSOFT’95), volume 915 of Lecture Notes in Computer Science, pages803–804, Aarhus, Denmark, May 1995. Springer-Verlag. Tool demonstra-tion.

[5] J. Fokker. Explaining algebraic theory with functional programs. InFunctional Programming Languages in Education, FPLE’95, volume 1022of LNCS, pages 139–158, Nijmegen, The Netherlands, December 1995.Springer-Verlag.

[6] J. Fokker. Functional parsers. In Advanced Functional Programming,AFP’95, volume 925 of LNCS, pages 1–23, Bastad, Sweden, May 1995.Springer-Verlag.

[7] J. Fokker. Functional specification of the JPEG algorithm, and an imple-mentation for free. In Programming paradigms in graphics, pages 102–120,Maastricht, The Netherlands, September 1995. Springer.

[8] M. Hermenegildo and S. D. Swierstra, editors. Proceedings of the the 7thInternational PLILP Symposium Programming Languages: Implementa-tions, Logics and Programs, volume 982 of LNCS, 1995.

[9] J. Jeuring. Polytypic pattern matching. In Conference Record of FPCA’95, SIGPLAN-SIGARCH-WG2.8 Conference on Functional ProgrammingLanguages and Computer Architecture, pages 238–248. ACM Press, 1995.

[10] J. Jeuring and E. Meijer, editors. Advanced Functional Programming,AFP’95, volume 925 of LNCS. Springer-Verlag, 1995.

[11] J. Jeuring and S. D. Swierstra. Constructing functional programs for gram-mar analysis problems. In Conference Record of FPCA ’95, SIGPLAN-SIGARCH-WG2.8 Conference on Functional Programming Languages andComputer Architecture, pages 259–269, 1995.


[13] E. Meijer and J. Jeuring. Merging monads and folds for functional pro-gramming. In Advanced Functional Programming, AFP’95, volume 925 ofLNCS, pages 228–266. Springer-Verlag, 1995.

[14] P. van Oostrum. Bibliotheekgebruik voor informaticastudenten. UniversiteitUtrecht, vakgroep Informatica, october 1995.

[15] P. van Oostrum. Handleiding LATEX. Universiteit Utrecht, vakgroep Infor-matica, april 1995.

[16] E. Visser. A case study in optimizing parsing schemata by disambiguationfilters. In S. Fischer and M. Trautwein, editors, Proceedings Accolade95,pages 153–167, Amsterdam, September 1995. The Dutch Graduate Schoolin Logic.

27

[17] E. Visser. A family of syntax definition formalisms. In M. G. J. van denBrand et al., editors, ASF+SDF’95. A Workshop on Generating Tools fromAlgebraic Specifications, pages 89–126. Technical Report P9504, Program-ming Research Group, University of Amsterdam, May 1995.

[18] E. Visser. Polymorphic syntax definition (extended abstract). In A. Nijholt,G. Scollo, and R. Steetskamp, editors, Algebraic Methods in Language Pro-cessing (AMILP’95), volume 10 of Twente Workshops in Language Tech-nology, pages 43–54, Enschede, The Netherlands, December 1995. TwenteUniversity of Technology.

1994

[1] M. G. J. van den Brand and E. Visser. From Box to TEX: An algebraic ap-proach to the generation of documentation tools. Technical Report P9420,Programming Research Group, University of Amsterdam, July 1994.

[2] D. Clarke. Uniform global optimisations for parallelising compilers, De-cember 1994. 4th Year Honours Thesis. Australian National University.

[3] J. Fokker. Functioneel programmeren. In F. Wester, editor, Concepten vanprogrammeertalen, volume 3, pages 9–102. Open Universiteit, Heerlen, TheNetherlands, 1994.

[4] J. Fokker and P. van Oostrum. Plaatjes in een tekst. MAPS, 13:153–166,1994.

[5] J. Hage. Arl and pr2, reversible languages. Technical Report 94-25, LeidenUniversity, Leiden, 1994.

[6] J. Jeuring. The derivation of on-line algorithms, with an application tofinding palindromes. Algorithmica, 11:146–184, 1994.

[7] J. Jeuring. Polytypic programming — abstract. In U. Engberg, K. Larsen,and P. Mosses, editors, Proceedings of the 6th Nordic Workshop on Pro-gramming Theory, BRICS Notes Series number NS-94-6, Dept. of Com-puter Science, University of Aarhus, Denmark, page 237, 1994.

[8] J. Jeuring and S. D. Swierstra. Bottom-up grammar analysis — a functionalformulation —. In D. Sannella, editor, Proceedings Programming Languagesand Systems, ESOP’94, volume 788 of LNCS, pages 317–332. Springer-Verlag, 1994.


[10] P. Klint and E. Visser. Using filters for the disambiguation of context-freegrammars. In G. Pighizzini and P. San Pietro, editors, Proc. ASMICSWorkshop on Parsing Theory, pages 1–20, Milano, Italy, October 1994.Tech. Rep. 126–1994, Dipartimento di Scienze dell’Informazione, Universitadi Milano.

28

[11] E. Kranakis, D. D. Krizanc, and L. Meertens. Link length of rectilinearHamiltonian tours in grids. Ars Combinatoria, 38:177–192, 1994.

[12] P. van Oostrum. Headers and footers in LATEX. MAPS, 13:127–135, 1994.

[13] E. Visser. Writing course notes with ASF+SDF to LATEX. In T. B. Di-nesh and S. M. Uskudarli, editors, Using the ASF+SDF environment forteaching computer science. Collection presented at the NSF workshop onteaching formal methods., August 1994.

1993

[1] J. Jeuring. Theories for Algorithm Calculation. PhD thesis, Utrecht Uni-versity, 1993. Parts of the thesis appeared in the Lecture Notes of theSTOP 1992 Summerschool on Constructive Algorithmics.

[2] P. J. A. Lentfert and S. D. Swierstra. Distributed maximum maintenanceon hierarchically divided graphs. Formal Aspects of Computing, 5(1):21–60,1993.

[3] P. J. A. Lentfert and S. D. Swierstra. Towards the formal design of self-stabilising distributed algorithms. In P. Enjalbert, A. Finkel, and K. Wag-ner, editors, STACS 93, Proceedings of the 10th Annual Symposium onTheretical Aspects of Computer Science, volume 665 of LNCS, pages 440–451, February 1993.

[4] L. Meertens. The design of elegant languages. In G. Alberts, editor, Onthe history of ALGOL 68, pages 53–64. CWI, Amsterdam, 1993.

[5] I. Prasetya. Formalization of variables access constraints to support com-positionality of liveness properties. Lecture Notes in Computer Science,780:324–337, 1993.

[6] I. Prasetya. On the style of mechanical proving. Lecture Notes in ComputerScience, 780:475–488, 1993.

[7] I. Prasetya. Variable access constraints and compositionality of livenessproperties. In H. Wijshoff, editor, Proceedings of Computing Science in theNetherlands 93, pages 12–23. SION, Stichting Matematisch Centrum, 1993.Best paper award.

[8] S. D. Swierstra and O. d. Moor. Virtual data structures. In M. B., P. H.,and S. S., editors, Formal Program Development, number 755 in LectureNotes in Computer Science, pages 355–371. Springer-Verlag, Berlin, 1993.

[9] P. van Oostrum. Gebruik en management van TEX in een Unix omgeving.MAPS, 11:88–102, 1993.

[10] E. Visser. Combinatory algebraic specification & compilation of list match-ing. Master’s thesis, Department of Computer Science, University of Am-sterdam, Amsterdam, June 1993.

29

1992

[1] G. H. Florijn, E. Lippe, A. Dijkstra, N. van Oosterom, and S. D. Swierstra.Camera: Cooperation in open distributed environments. In Proceedings ofthe European/Usenix Spring Workshop,Jersey, 1992.

[2] J. Fokker. The systematic construction of a one-combinator basis forlambda-terms. Formal Aspects of Computing, 4:776–780, 1992.

[3] J. Jeuring. The derivation of a hierarchy of algorithms for pattern matchingon arrays. In G. Hains and L. Mullin, editors, Proceedings ATABLE-92,Second international workshop on array structures, pages 199–213, 1992.DIRO publication number 841, Universite de Montreal.

[4] J. Jeuring. Incremental data compression —abstract—. In J. Storer andM. Cohn, editors, Proceedings Data Compression Conference, March 24–27, 1992, Snowbird, Utah, page 411, 1992.

[5] J. Jeuring. Incremental data compression —extended abstract—. InP. Fisher, editor, Proceedings of the Navy Environmental Systems Work-shop, 1992.

[6] P. J. A. Lentfert and S. D. Swierstra. Towards the formal design ofself-stabilizing distributed algorithms. Technical Report RUU-CS-92-25,Utrecht University, August 1992. Also in: J.L.G. Dietz (Ed). ProceedingsCSN92. Utrecht, November 4–5, 1992.

[7] L. Meertens. Paramorphisms. Formal Aspects of Computing, 4:413–424,1992.

[8] L. Meertens and S. Pemberton. The ergonomics of computer interfaces —designing a system for human use. Report CS-R9258, CWI, Amsterdam,1992.

[9] L. Meertens, S. Pemberton, and G. van Rossum. The ABC structure editor— structure-based editing for the ABC programming environment. ReportCS-R9256, CWI, Amsterdam, 1992.

[10] M. Pennings, D. Swierstra, and H. Vogt. Using cached functions and con-structors for incremental attribute evaluation. RUU-CS 92-11, Departmentof Computer Science, Padualaan 14, 1992.

[11] M. Pennings, S. D. Swierstra, and H. H. Vogt. Using cached functionsand constructors for incremental attribute evaluation. In M. Bruynoogheand M. Wirsing, editors, Programming Language Implementation and LogicProgramming, volume 631 of LNCS, pages 130–144. Springer, 1992.

[12] E. Visser. Syntax and static semantics of Eiffel. A case study in algebraicspecification techniques. Unpublished technical report, December 1992.

30

1991

[1] J. Fokker, H. Zantema, and S. Swierstra. Programmeren en correctheid.Academic Service, Schoonhoven, The Netherlands, 1991.

[2] M. M. Fokkinga, J. Jeuring, L. Meertens, and E. Meijer. A translationfrom attribute grammars to catamorphisms. The Squiggolist, 2(1):20–26,1991.

[3] M. M. Fokkinga and L. Meertens. Map-functor factorized. The Squiggolist,2(1):17–19, 1991.

[4] J. Jeuring. The derivation of hierarchies of algorithms on matrices. InB. Moller, editor, Constructing Programs from Specifications, pages 9–32.North-Holland, 1991.

[5] J. Jeuring. Incremental algorithms on lists. In J. v. Leeuwen, editor,Proceedings SION Computing Science in the Netherlands, pages 315–335,1991. Also appeared in EURICS Workshop on Calculational Theories ofProgram Structure, Hollum-Ameland, 1991.

[6] J. Jeuring, editor. Liber Amicorum Lambert Meertens & CWI 1966-1991.Stichting Mathematisch Centrum, 1991.

[7] L. Meertens. A neutral suggestion. The Squiggolist, 2(1):16, 1991.

[8] L. Meertens and J. van der Woude. A tribute to attributes. The Squiggolist,2(1):10–15, 1991.

[9] S. D. Swierstra and H. H. Vogt. Attribute Grammars, Applications andSystems, volume 545 of LNCS, lncs Higher Order Attribute Grammars,pages 256–296. Springer, 1991.

[10] P. van Oostrum. Program text generation with TEX/LATEX. MAPS, 6:99–106, 1991.

[11] H. H. Vogt, S. Swierstra, and M. Kuiper. Efficient incremental evaluationof higher order attribute grammars. In J. Maluszinsky and M. Wirsing,editors, Programming language Implementation and Logic Programming,volume 528 of LNCS, pages 231–242, 1991.

1990

[1] L. Geurts, L. Meertens, and S. Pemberton. ABC Programmer’s Handbook.Prentice Hall, 1990.

[2] J. Jeuring. Algorithms from theorems. In M. Broy and C. Jones, editors,Programming Concepts and Methods, pages 247–266. North-Holland, 1990.

[3] J. Jeuring. The largest ascending substree — an exercise in nub theory.The Squiggolist, 1:36–44, 1990.

[4] E. Kranakis, D. D. Krizanc, and L. Meertens. Link length of rectilinearwatchman tours in grids. In Proc. 2nd Canadian Conf. in ComputationalGeometry, 1990.

31

[5] M. F. Kuiper and S. D. Swierstra. Parallel attribute evaluation: stuctureof evaluators and detection of parallelism. In P. Deransart and M. Jour-dan, editors, Attribute grammars and their Aplication, pages 61–75. INRIA,Springer-Verlag, 1990.

[6] P. J. A. Lentfert, S. D. Swierstra, and A. H. Uittenbogaard. Distributedincremental maximum finding in hierarchically divided graphs. RUU-CS 90-30, Department of Computer Science, P.O.Box 80.089, 3508 TBUTRECHT, the Netherlands, 1990.

[7] S. D. Swierstra and H. H. Vogt. Higher order attribute grammars: amerge between functional and object oriented programming. RUU-CS 90-12, Dept. of Computer Science, 1990.

[8] A. H. Uittenbogaard, P. J. A. Lentfert, and S. D. Swierstra. Smart cabling:an overview. In Proceedings of the 4th workshop on ACM SIGOPS Europeanworkshop, pages 1–5. ACM Press, 1990.

[9] H. H. Vogt, S. Swierstra, and M. Kuiper. On the efficient incrementalevaluation of higher order attribute grammars. RUU-CS 90-36, Departmentof Computer Science, P.O.Box 80.089, 3508 TB Utrecht, the Netherlands,1990.

1989

[1] J. Jeuring. Deriving algorithms on binary labelled trees. In P. Apers,D. Bosman, and J. v. Leeuwen, editors, Proceedings SION Computing Sci-ence in the Netherlands, pages 229–249, 1989. Also appeared in Proceed-ings International Summer School on Constructive Algorithmics, Hollum-Ameland, 1989.

[2] J. Jeuring and L. Meertens. The least-effort cabinet formation. The Squig-golist, 1(2), 1989.

[3] E. Kranakis and L. Meertens. Optimal packing of similar triangles. EATCSBulletin, 38:181–185, 1989.

[4] P. J. A. Lentfert, A. H. Uittenbogaard, and G. Swierstra, S. D.and Tel. Dis-tributed hierarchical routing. In P. Apers, D.Bosman, and J. van Leeuwen,editors, Computing Science in the Netherlands, pages 321–344, Amsterdam,1989. SION, Stichting Mathematisch Centrum.

[5] P. J. A. Lentfert, A. H. Uittenbogaard, S. D. Swierstra, and G. Tel. Dis-tributed hierarchical routing. RUU-CS 89-5, Department of Computer Sci-ence, PO.Box 80.089, 3508 TB Utrecht, the Netherlands, 1989.

[6] L. Meertens. Constructing a calculus of programs. In J. van de Snepscheut,editor, Mathematics of Program Construction, LNCS 375, pages 66–90,1989.

[7] L. Meertens. Reducing hopeful majority. The Squiggolist, 1(1):5, 1989.

[8] H. H. Vogt, S. D. Swierstra, and M. F. Kuiper. Higher order attributegrammars. In Sigplan 1989 Conference on programming language designand Implementation. ACM, 1989.

32

1988

[1] M. Carrasquer, D. L. Draper, L. Meertens, and S. Pemberton. EURO-MATH Functional Specification. CWI, Amsterdam, 1988.

[2] J. Jeuring. Finding palindromes. In Proceedings SION Computing Sciencein the Netherlands, pages 123–140, 1988.

[3] J. Jeuring. On classes of run-time functions. In Proceedings SION Com-puting Science in the Netherlands, pages 335–351, 1988.

[4] M. F. Kuiper and S. D. Swierstra. Increasing parallelism in attribute gram-mar evaluators: Transformations and lazy evaluations. In Computing Sci-ence in the Netherlands, pages 109–121. SION, SION, 1988.

1987

[1] R. S. Bird and L. Meertens. Two exercises found in a book on algorithmics.In L. Meertens, editor, Program Specification and Transformation, pages451–457. North-Holland Publishing Company, Amsterdam, 1987.

[2] M. F. Kuiper and S. D. Swierstra. Using attribute grammars to deriveefficient functional programs. In Computing Science in the NetherlandsCSN’87, Nov. 1987.

[3] L. Meertens. Case studies van CWI-onderzoek. In W. Aspers andH. Nieland, editors, Wetenschap in Bedrijf, pages 43–69. CWI, Amster-dam, 1987.

[4] L. Meertens. Een nieuwe manier van programmeren. In ZWO Jaarboek1986, pages 204–208. Netherlands Organization for the Advancement ofPure Research, The Hague, 1987.

[5] L. Meertens, editor. Program Specification and Transformation. North-Holland Publishing Company, Amsterdam, 1987.

1986

[1] M. Hazewinkel, J. Lenstra, and L. Meertens, editors. Mathematics andComputer Science II — Fundamental Contributions in the Netherlandssince 1945, CWI Monographs Volume 4. North-Holland Publishing Com-pany, Amsterdam, 1986.

[2] M. F. Kuiper and S. D. Swierstra. Using attribute grammars to deriveefficient functional programs. RUU-CS 86-16, Department of ComputerScience, 1986.

[3] L. Meertens. Algorithmics — towards programming as a mathematicalactivity. In J. de Bakker, M. Hazewinkel, and J. Lenstra, editors, Mathe-matics and Computer Science, CWI Monographs Volume 1, pages 289–334.North-Holland Publishing Company, Amsterdam, 1986.

[4] L. Meertens. From B to ABC: the salient changes. The B Newsletter, 5:2–6,1986.

33

[5] P. van Oostrum. Computers en Informatieverwerking. Number INF/DOC-86-6. Rijksuniversiteit Utrecht, Vakgroep Informatica, 1986.

1985

[1] L. Meertens. Eh? B be ‘ABC’, see? The B Newsletter, 4, 1985.

[2] L. Meertens. A proposal for matrix/vector functions in B. The B Newslet-ter, 3, 1985.

[3] L. Meertens. ∼ 1 <> 1, a nice distinction? The B Newsletter, 4, 1985.

[4] L. Meertens. What is in the name of B? The B Newsletter, 3, 1985.

[5] L. Meertens and S. Pemberton. Description of B. SIGPLAN Notices,20(2):58–76, February 1985.

[6] A. d. Raaf, A. Dijkstra, and S. Swierstra. A lan with real-time, facilitiesbased on osi-concepts,. RUU-CS 85, Department of Computer Science,1985.

1984

[1] L. Meertens and S. Pemberton. An implementation of the B programminglanguage. In Proc. USENIX UniForum, pages 65–74. USENIX, 1984.

[2] A. Schoute and S. Swierstra. Writing concurrent programs in a sequen-tial language like pascal. Inf-Memorandum 1984-20, Twente University ofTechnology, 1984.

1983

[1] T. J. Krijnen and L. Meertens. Making B-trees work for B. MathematicalCentre Report IW 219, Mathematisch Centrum, Amsterdam, 1983.

[2] L. Meertens. ANNO RR — Annotaties en Commentaren bij het “Re-vised Report on the Algorithmic Language ALGOL 68”. Utrecht Univer-sity, Department of Computer Science, 1983. Facsimile reproduction ofmanuscript.

[3] L. Meertens. Incremental polymorphic type checking in B. In Conf. Recordof the 10th ACM Symposium on the Principles of Programming Languages,pages 265–275. ACM, New York, 1983.

[4] L. Meertens and P. M. Vitanyi. Big Omega contra the wild functions.EATCS Bulletin, 16:14–19, 1983.

[5] P. v. Oostrum. Interaktie met persoonlijke informatiesystemen. TechnicalReport RUU-CS-83-03, University of Utrecht, Department of Computerscience, 1983.

34

1982

[1] C. Bron, E. Dijkstra, and S. Swierstra. A memory-management unit forthe optimal exploitation of a small address space. Information ProcessingLetters, 15(1):20–22, 1982.

[2] L. Meertens. Quick reference to B. ALGOL Bulletin, 48:7–17, 1982.

1981

[1] L. Meertens. Definition of an abstract ALGOL 68 machine. MathematicalCentre Report IW 188, Mathematisch Centrum, Amsterdam, 1981.

[2] L. Meertens. Draft Proposal for the B Programming Language. Mathema-tisch Centrum, Amsterdam, 1981.

[3] L. Meertens. Issues in the design of a beginners’ programming language.In J. de Bakker and J. van Vliet, editors, Algorithmic Languages, pages167–184. North-Holland Publishing Company, Amsterdam, 1981.

[4] L. Meertens. On the design of an abstract machine for a portable ALGOL68 compiler. In J. van Vliet and H. Wupper, editors, Proc. InternationalConf. on ALGOL 68, Mathematical Centre Tract 134, pages 97–117. Math-ematisch Centrum, Amsterdam, 1981.

[5] L. Meertens and H. van Vliet. ALGOL 68+, a superlanguage of ALGOL68 for processing the standard-prelude. Mathematical Centre Report IW168, Mathematisch Centrum, Amsterdam, 1981.

[6] L. Meertens and H. van Vliet. Making ALGOL 68+ texts conform to anoperator-priority grammar. Mathematical Centre Report IW 180, Mathe-matisch Centrum, Amsterdam, 1981.

[7] L. Meertens and H. van Vliet. On the MC ALGOL 68 compiler. Mathemat-ical Centre Report IW 189, Mathematisch Centrum, Amsterdam, 1981.

[8] L. Meertens and H. van Vliet. On top-down parsing of ALGOL 68+.Mathematical Centre Report IW 182, Mathematisch Centrum, Amster-dam, 1981.

[9] L. Meertens and H. van Vliet. An operator-priority grammar for ALGOL68+. Mathematical Centre Report IW 173, Mathematisch Centrum, Am-sterdam, 1981.

[10] L. Meertens and H. van Vliet. An underlying context-free grammar of AL-GOL 68+. Mathematical Centre Report IW 171, Mathematisch Centrum,Amsterdam, 1981.

[11] S. Swierstra. Lawine: an Experiment in Language and Machine Design.PhD thesis, Twente University of Technology, Jan. 1981.

35

1980

[1] K. R. Apt and L. Meertens. Completeness with finite systems of intermedi-ate assertions for recursive program schemes. SIAM Journal on Computing,9:665–671, 1980.

[2] L. Meertens. Code-generatie. In J. van Vliet, editor, Colloquium CapitaImplementatie van Programmeertalen, Mathematical Centre Syllabus 42,pages 27–46. Mathematisch Centrum, Amsterdam, 1980.

[3] S. Swierstra. Some notes on ada. Ada Symposium, 1980.

1979

[1] K. R. Apt, J. A. Bergstra, and L. Meertens. Recursive assertions are notenough—or are they? Theoretical Computer Science, 8:73–87, 1979.

[2] C. J. Cheney, C. H. Lindsey, L. Meertens, and H. Wupper. Changing linelengths in random files. ALGOL Bulletin, 44:15, 1979.

[3] L. Meertens. Abstracto 84: the next generation. In Proc. 1979 AnnualConf., pages 33–39, Detroit, 1979. ACM.

[4] L. Meertens. Bitonic sort on ultracomputers. Ultracomputer Note #1,Computer Science Department, Courant Institute of Mathematical Sci-ences, New York University, 1979.

[5] L. Meertens. Program text and program structure. In P. Hibbard andS. Schuman, editors, Constructing Quality Software, pages 271–281. North-Holland Publishing Company, Amsterdam, 1979.

[6] L. Meertens. Recurrent ultracomputers are not log N -fast. UltracomputerNote #2, Computer Science Department, Courant Institute of Mathemat-ical Sciences, New York University, 1979.

[7] S. D. Swierstra. Another approach to type checking. Technical report,Twente University of Technology, 1979.

[8] S. D. Swierstra. Machine architectures for block structured languages.Technical Report 262, Technical University Twente, 1979.

1978

[1] L. Geurts and L. Meertens. Keyword grammars. In J. Andre and J.-P.Banatre, editors, Implementation and Design of Algorithmic Languages,pages 1–12. IRIA, Rocquencourt, 1978.

[2] L. Geurts and L. Meertens. Remarks on Abstracto. ALGOL Bulletin,42:56–63, 1978.

[3] L. Meertens. Abstracte datatypen. In Colloquium Capita Datastructuren,Mathematical Centre Syllabus 37, pages 27–41. Mathematisch Centrum,Amsterdam, 1978.

[4] L. Meertens. Procedurele datastructuren. In Colloquium Capita Datas-tructuren, Mathematical Centre Syllabus 37, pages 171–186. MathematischCentrum, Amsterdam, 1978.

36

1977

[1] T. V. Janssen, G. H. Kok, and L. Meertens. On restrictions on transforma-tional grammars reducing the generative power. Linguistics and Philosophy,1:111–118, 1977.

[2] L. Meertens. From abstract variable to concrete representation. In S. Schu-man, editor, New Directions in Algorithmic Languages 1976, pages 107–133, 1977.

[3] P. v. Oostrum. A parser for algol 68. Master’s thesis, University of Utrecht,1977.

[4] S. D. Swierstra. Abstract data types, definition modules and extensions todefinition modules. In M(achine) O(riented) L(anguages)-bulletin, 1977.

1976

[1] A. Atkinson, A. Heemskerk, and S. Swierstra. Construction of a unitaryscattering amplitude. Nuclear Physics, 1976.

[2] L. Geurts and L. Meertens. Designing a beginners’ programming language.In S. Schuman, editor, New Directions in Algorithmic Languages 1975,pages 1–18. IRIA, Rocquencourt, 1976.

[3] L. Meertens. Computerkunst. In Kaleidoskoop van de Wiskunde, pages18–26. Mathematical Institute, Utrecht University, 1976.

[4] L. Meertens. De heel eenvoudige taal HET. In Colloquium Structuur vanProgrammeertalen, Mathematical Centre Syllabus 25, pages 59–78. Math-ematisch Centrum, Amsterdam, 1976.

[5] L. Meertens. Job control languages. In Colloquium Bedrijfssystemen, Math-ematical Centre Syllabus 32, pages 113–128. Mathematisch Centrum, Am-sterdam, 1976.

[6] L. Meertens. Mode and meaning. In S. Schuman, editor, New Directionsin Algorithmic Languages 1975, pages 125–138, 1976.

[7] L. Meertens. Naar een foutenwerende programmeertaal. In ColloquiumStructuur van Programmeertalen, Mathematical Centre Syllabus 25, pages177–195. Mathematisch Centrum, Amsterdam, 1976.

[8] L. Meertens. A note on integral division. ALGOL Bulletin, 39:30–32, 1976.

[9] L. Meertens. A space-saving technique for assigning ALGOL 68 multiplevalues. Information Processing Letters, 5:97–99, 1976.

[10] L. Meertens and H. van Vliet. Parsing ALGOL 68 with syntax-directederror recovery. In G. Hedrick, editor, Proc. the 1975 International Conf. onALGOL 68, pages 118–155. Oklahoma State University, Stillwater, 1976.

[11] L. Meertens and H. van Vliet. Repairing the parenthesis skeleton of AL-GOL 68 programs: proof of correctness. In G. Hedrick, editor, Proc. the1975 International Conf. on ALGOL 68, pages 99–117. Oklahoma StateUniversity, Stillwater, 1976.

37

1975

[1] J. W. de Bakker and L. Meertens. On the completeness of the inductiveassertion method. Journal of Computer and System Sciences, 11:323–357,1975.

[2] A. van Wijngaarden, B. Mailloux, J. Peck, C. Koster, M. Sintzoff, C. Lind-sey, L. Meertens, and R. Fisker. Revised Report on the Algorithmic Lan-guage ALGOL 68. Acta Informatica, 5:1–236, 1975.

1974

[1] R. Bosch, D. Grune, and L. Meertens. ALEPH, A Language EncouragingProgram Hierarchy. In Proc. the International Computing Symp. 1973,pages 73–79. North-Holland Publishing Company, Amsterdam, 1974.

[2] D. Grune, R. Bosch, and L. Meertens. Aleph manual. Mathematical CentreReport IW 17, Mathematisch Centrum, Amsterdam, 1974.

[3] D. Grune, L. Meertens, H. van Vliet, and R. van Vliet. Remarks on theTransput Section of the Revised Report on ALGOL 68. MathematicalCentre Report IN 7, Mathematisch Centrum, Amsterdam, 1974.

[4] L. Meertens and H. van Vliet. Repairing the state switcher skeleton ofALGOL 68 programs. Mathematical Centre Report IW 15, MathematischCentrum, Amsterdam, 1974.

1973

[1] D. Grune, L. Meertens, and H. van Vliet. Grammar-handling tools appliedto ALGOL 68. Mathematical Centre Report IW 5, Mathematisch Centrum,Amsterdam, 1973.

[2] L. Meertens. On static scope checking in ALGOL 68. ALGOL Bulletin,35:45–58, 1973.

[3] L. Meertens and H. van Vliet. Repairing the parenthesis skeleton of ALGOL68 programs. Mathematical Centre Report IW 2, Mathematisch Centrum,Amsterdam, 1973.

[4] L. Meertens and H. van Vliet. A syntax-directed error-recovery method forparsing ALGOL 68 programs. Mathematical Centre Report IN 6, Mathe-matisch Centrum, Amsterdam, 1973.

1972

[1] J. W. de Bakker and L. Meertens. Simple recursive program schemes andinductive assertions. Mathematical Centre Report MR 142, MathematischCentrum, Amsterdam, 1972.

[2] L. Geurts and L. Meertens. Kristalstrukturen. In H. Sizoo, editor, Struk-tuur, een thema, een methode, pages 32–37. De Lakenhal, Leiden, 1972.

38

[3] G. Nogarede, M. Rem, L. Meertens, L. Geurts, and R. P. van de Riet. TheMC ELAN assembler. Mathematical Centre Report MR 132, MathematischCentrum, Amsterdam, 1972.

1971

[1] L. Meertens. Computers and creativity. In Verslagboek van het Seminaron Computer Aided Architectural Design, pages 161–163. Bouwcentrum,Rotterdam, 1971.

[2] L. Meertens. Designing letter-like shapes. Page (Bulletin of the ComputerArts Society), 17:2–3, 1971.

1969

[1] L. Andriessen, L. Geurts, and L. Meertens. Componist en computer. DeGids, 132:304–311, 1969.

[2] N. H. Frijda and L. Meertens. A simulation model of human informationretrieval. Sciences du Comportement, 7:237–243, 1969.

[3] L. Geurts, L. Meertens, R. P. van de Riet, and A. van Wijngaarden. Phys-ionomie, psyche en chironomie. Mathematical Centre Report DR 38, Math-ematisch Centrum, Amsterdam, 1969.

[4] L. Meertens. The imitation of musical styles by a computer. In Informa-tion Processing 68, Proc. IFIP Congress 1968, Volume 1, pages xxv–xxvi.North-Holland Publishing Company, Amsterdam, 1969.

[5] L. Meertens. On the generation of ALGOL 68 programs involving infinitemodes. ALGOL Bulletin, 30:90–92, 1969.

1968

[1] L. Meertens. Componeren met de computer. Informatie, 10:418–421, 1968.

[2] L. Meertens. Quartet no. 1 in C major for 2 violins, viola and violoncello.Mathematical Centre Report MR 96, Mathematisch Centrum, Amsterdam,1968.

[3] D. van Dalen, H. P. Barendregt, P. van Oostrum, and T. A. Zoethout. Mod-eltheorie : college cursus 1967-1968. Mathematisch Instituut, Rijksuniv.Utrecht, 1968.

1966

[1] C. H. Koster, L. Geurts, and L. Meertens. Praktijkcursus ALGOL 60.Mathematical Centre Report MR 85, Mathematisch Centrum, Amsterdam,1966.

39

1962

[1] C. H. Koster and L. Meertens. Basic English, a generative grammar for apart of English. Technical report, Euratom Seminar “Machine en Talen”,University of Amsterdam, 1962.

[2] L. Meertens. Kunstmatige intelligentie, een programma voor het optimaaloplossen van een klasse van problemen. Mededelingen van het NederlandsRekenmachine Genootschap, 4:6–13, 1962.

PhD Theses

2004

[1] A. Loh. Exploring Generic Haskell. PhD thesis, Utrecht University, Sept.2004.

2003

[1] D. Leijen. The λ Abroad – A Functional Approach to Software Components.PhD thesis, Utrecht University, Nov. 2003.

2001

[1] D. Clarke. Object Ownership and Containment. PhD thesis, University ofNew South Wales, July 2001.

[2] J. Hage. Structural Aspects Of Switching Classes. PhD the-sis, Leiden Institute of Advanced Computer Science, 2001.http://www.cs.uu.nl/people/jur/2s.html.

1997

[1] E. Visser. Syntax Definition for Language Prototyping. PhD thesis, Uni-versity of Amsterdam, September 1997.

1993

[1] J. Jeuring. Theories for Algorithm Calculation. PhD thesis, Utrecht Uni-versity, 1993. Parts of the thesis appeared in the Lecture Notes of theSTOP 1992 Summerschool on Constructive Algorithmics.

1981

[1] S. Swierstra. Lawine: an Experiment in Language and Machine Design.PhD thesis, Twente University of Technology, Jan. 1981.

40

Book Chapters

2004

[1] B. Fischer and E. Visser. Retrofitting the AutoBayes program synthesissystem with concrete object syntax. In C. Lengauer et al., editors, Domain-Specific Program Generation, volume 3016 of Lecture Notes in ComputerScience, pages 239–253. Spinger-Verlag, 2004.

[2] E. Visser. Program transformation with Stratego/XT: Rules, strategies,tools, and systems in StrategoXT-0.9. In C. Lengauer et al., editors,Domain-Specific Program Generation, volume 3016 of Lecture Notes inComputer Science, pages 216–238. Spinger-Verlag, June 2004.

2003

[1] D. Clarke and A. Loh. Generic haskell, specifically. In J. Gibbons andJ. Jeuring, editors, Generic Programming, IFIP, pages 21–47. Kluwer Aca-demic Publishers, 2003.

[2] S. Fitzpatrick and L. Meertens. Distributed coordination through anar-chic optimization. In V. Lesser, C. L. Ortiz, Jr., and M. Tambe, editors,Distributed Sensor Networks: A Multiagent Perspective, pages 257–295.Kluwer Academic Publishers, 2003.

2002

[1] D. Clarke and A. Loh. Generic haskell, specifically. In IFIP WG2.1 WorkingConference on Generic Programming, pages 21–47. Dagstuhl, Germany,July 2002.

2000

[1] P. van Oostrum. Gedistribueerde systemen en netwerken. In P. van Oost-rum and D. Thierens, editors, Nieuwe ontwikkelingen in hardware en soft-ware. Universiteit Utrecht, NW&I, 2000.

1999


1998

[1] S. D. Swierstra and P. Azero. Attribute grammars in the functional style.In Proceedings of the SI2000. Chapman-Hall, 1998.

41

1997

[1] E. Visser. From context-free grammars with priorities to character classgrammars. In Liber Amicorum Paul Klint. CWI, Amsterdam, November1997.

1996

[1] E. Visser. Multi-level specifications. In A. van Deursen, J. Heering, andP. Klint, editors, Language Prototyping. An Algebraic Specification Ap-proach, volume 5 of AMAST Series in Computing, pages 105–196. WorldScientific, Singapore, September 1996.

1995

[1] A. Bijlsma, R. W. Bulterman, W. H. J. Feijen, A. J. M. van Gasteren,R. R. Hoogerwoord, C. S. Scholten, and F. W. van der Sommen. Phasesynchronization for a string of machines. In E. Aarts, H. ten Eikelder,C. Hemerik, and M. Rem, editors, Simplex sigillum veri, pages 129–138.Eindhoven University of Technology, 1995.

1994

[1] J. Fokker. Functioneel programmeren. In F. Wester, editor, Concepten vanprogrammeertalen, volume 3, pages 9–102. Open Universiteit, Heerlen, TheNetherlands, 1994.

1993

[1] S. D. Swierstra and O. d. Moor. Virtual data structures. In M. B., P. H.,and S. S., editors, Formal Program Development, number 755 in LectureNotes in Computer Science, pages 355–371. Springer-Verlag, Berlin, 1993.

1987

[1] L. Meertens. Case studies van CWI-onderzoek. In W. Aspers andH. Nieland, editors, Wetenschap in Bedrijf, pages 43–69. CWI, Amster-dam, 1987.

1980

[1] L. Meertens. Code-generatie. In J. van Vliet, editor, Colloquium CapitaImplementatie van Programmeertalen, Mathematical Centre Syllabus 42,pages 27–46. Mathematisch Centrum, Amsterdam, 1980.

42

1978

[1] L. Meertens. Abstracte datatypen. In Colloquium Capita Datastructuren,Mathematical Centre Syllabus 37, pages 27–41. Mathematisch Centrum,Amsterdam, 1978.

[2] L. Meertens. Procedurele datastructuren. In Colloquium Capita Datas-tructuren, Mathematical Centre Syllabus 37, pages 171–186. MathematischCentrum, Amsterdam, 1978.

1976

[1] L. Meertens. Computerkunst. In Kaleidoskoop van de Wiskunde, pages18–26. Mathematical Institute, Utrecht University, 1976.

[2] L. Meertens. De heel eenvoudige taal HET. In Colloquium Structuur vanProgrammeertalen, Mathematical Centre Syllabus 25, pages 59–78. Math-ematisch Centrum, Amsterdam, 1976.

[3] L. Meertens. Job control languages. In Colloquium Bedrijfssystemen, Math-ematical Centre Syllabus 32, pages 113–128. Mathematisch Centrum, Am-sterdam, 1976.

[4] L. Meertens. Naar een foutenwerende programmeertaal. In ColloquiumStructuur van Programmeertalen, Mathematical Centre Syllabus 25, pages177–195. Mathematisch Centrum, Amsterdam, 1976.

1972

[1] L. Geurts and L. Meertens. Kristalstrukturen. In H. Sizoo, editor, Struk-tuur, een thema, een methode, pages 32–37. De Lakenhal, Leiden, 1972.

In Proceedings

2005

[1] R. Guerra, J. Jeuring, and D. Swierstra. Generic validation in an XPath-Haskell data binding. In Proceedings of PLAN-X 2005, 2005.

[2] B. Heeren and J. Hage. Type class directives. In Seventh InternationalSymposium on Practical Aspects of Declarative Languages, pages 253 – 267,Berlin, 2005. Springer Verlag.

[3] K. Olmos and E. Visser. Composing source-to-source data-flow transfor-mations with rewriting strategies and dependent dynamic rewrite rules. InR. Bodik, editor, 14th International Conference on Compiler Construction(CC’05). Springer-Verlag, April 2005. (Accepted for publication).

43

2004

[1] F. Atanassow, D. Clarke, and J. Jeuring. UUXML: A type-preserving XMLSchema–Haskell data binding. In B. Jayaraman, editor, Practical Aspects ofDeclarative Languages, 6th International Symposium, PADL 2004, Dallas,TX, USA, June 2004, Proceedings, number 3057 in LNCS, pages 71–85,Berlin Heidelberg, June 2004. Springer–Verlag.

[2] F. Atanassow and J. Jeuring. Inferring type isomorphisms generically. InD. Kozen, editor, Proceedings of the 7th International Conference on Math-ematics of Program Construction, MPC’04, volume 3125 of LNCS, pages32–53. Springer-Verlag, 2004.

[3] F. Atanassow and J. Jeuring. Inferring type isomorphisms generically. InD. Kozen, editor, Mathematics of Program Construction, 7th InternationalConference, MPC 2004, Stirling, Scotland, UK, July 2004, Proceedings,number 3125 in LNCS, pages 32–53, Berlin Heidelberg, July 2004. Springer–Verlag.

[4] A. I. Baars and S. D. Swierstra. Type-safe, self inspecting code. In Pro-ceedings of the ACM SIGPLAN workshop on Haskell, pages 69–79. ACMPress, 2004.

[5] M. Bravenboer and E. Visser. Concrete syntax for objects. Domain-specific language embedding and assimilation without restrictions. In D. C.Schmidt, editor, Proceedings of the 19th ACM SIGPLAN Conference onObject-Oriented Programing, Systems, Languages, and Applications (OOP-SLA’04), pages 365–383, Vancouver, Canada, October 2004. ACM Press.

[6] E. Dolstra, M. de Jonge, and E. Visser. Nix: A safe and policy-free systemfor software deployment. In L. Damon, editor, 18th Large Installation Sys-tem Administration Conference (LISA ’04), pages 79–92, Atlanta, Georgia,USA, November 2004. USENIX.

[7] E. Dolstra, E. Visser, and M. de Jonge. Imposing a memory managementdiscipline on software deployment. In J. Estublier and D. Rosenblum, ed-itors, 26th International Conference on Software Engineering (ICSE’04),pages 583–592, Edinburgh, Scotland, May 2004. IEEE Computer Society.

[8] A. Ehrenfeucht, J. Hage, T. Harju, and G. Rozenberg. Embedding inswitching classes with skew gains. In H. Ehrig, G. Engels, F. Parisi-Presicce,and G. Rozenberg, editors, Graph Transformations, Second InternationalConference, ICGT 2004, volume LNCS 3256, pages 257 – 270. SpringerVerlag, September/October 2004. Same as technical report UU-CS-2004-023.

[9] B. Fischer and E. Visser. Adding concrete syntax to a prolog-based pro-gram synthesis system (extended abstract). In M. Bruynooghe, editor, 13thInternational Symposium Logic Based Program Synthesis and Transforma-tion: , LOPSTR 2003, volume 3018 of Lecture Notes in Computer Science,pages 56–58, Heidelberg, November 2004. Springer-Verlag.

44

[10] H. Passier and J. Jeuring. Ontology based feedback generation in design-oriented e-learning systems. In P. Isaias, P. Kommers, and M. McPherson,editors, Proceedings of the IADIS International conference, e-Society, vol-ume II, pages 992–996, 2004.

[11] T. E. J. Vos and S. D. Swierstra. Facilitating the verification of diffus-ing computations and their applications. In M. Solar, D. Fernndez-Baca,and E. Cuadros-Vargas, editors, 30ma Conferencia Latinoamericana deInformtica (CLEI2004), pages 42–53. Sociedad Peruana de Computacin,Sept. 2004. ISBN 9972-9876-2-0.

2003

[1] F. Atanassow, D. Clarke, and J. Jeuring. Scripting XML with GenericHaskell. In Proceedings of the 7th Brazilian Symposium on ProgrammingLanguages, SBLP 2003, 2003. An extended version of this paper appearsas ICS, Utrecht University, technical report UU-CS-2003-023.

[2] O. S. Bagge, K. T. Kalleberg, M. Haveraaen, and E. Visser. Design of theCodeBoost transformation system for domain-specific optimisation of C++programs. In D. Binkley and P. Tonella, editors, Third IEEE InternationalWorkshop on Source Code Analysis and Manipulation (SCAM’03), pages65–74, Amsterdam, September 2003. IEEE Computer Society Press.

[3] D. Clarke, S. Drossopoulou, and J. Noble. International workshop on alias-ing, confinement, and ownership in object-oriented programming: Work-shop report. In European Conference on Object-Oriented Programming(ECOOP’03): Workshop Reader, LNCS, Darmstadt, Germany, July 2003.to appear.

[4] D. Clarke, M. Richmond, and J. Noble. Saving the world from badbeans: Deployment-time confinement checking. In ACM Conference onObject-Oriented Programming Systems, Languages and Applications (OOP-SLA’03), Anaheim, California, USA, October 2003.

[5] D. Clarke and T. Wrigstad. External uniqueness. In 10th Workshop onFoundations of Object-Oriented Languages (FOOL), New Orleans, LA, Jan-uary 2003.

[6] D. Clarke and T. Wrigstad. External uniqueness is unique enough. InL. Cardelli, editor, European Conference on Object-Oriented Programming(ECOOP’03), volume 2743 of LNCS, pages 176–200, Darmstadt, Germany,July 2003.

[7] E. Dolstra. Integrating software construction and software deployment.In B. Westfechtel, editor, 11th International Workshop on Software Con-figuration Management (SCM-11), volume 2649 of Lecture Notes in Com-puter Science, pages 102–117, Portland, Oregon, USA, May 2003. Springer-Verlag.

[8] E. Dolstra, G. Florijn, M. de Jonge, and E. Visser. Capturing timelinevariability with transparent configuration environments. In J. Bosch and

45

P. Knauber, editors, IEEE Workshop on Software Variability Management(SVM’03), Portland, Oregon, USA, May 2003. IEEE.


[10] B. Fischer and E. Visser. Adding concrete syntax to a Prolog-based pro-gram synthesis system (extended abstract). In M. Bruynooghe, editor, Pre-proceedings of the International Symposium on Logic Based Program Syn-thesis and Transformation (LOPSTR’03), number Report CW 365, pages39–48, Uppsala, Sweden, August 2003. Department of Computer Science,K. U. Leuven.

[11] B. Heeren, J. Hage, and S. D. Swierstra. Constraint based type inferencingin Helium. In M.-C. Silaghi and M. Zanker, editors, Workshop Proceedingsof Immediate Applications of Constraint Programming, pages 59 – 80, Cork,September 2003.

[12] B. Heeren, J. Hage, and S. D. Swierstra. Scripting the type inferenceprocess. In Eighth ACM Sigplan International Conference on FunctionalProgramming, pages 3 – 13, New York, 2003. ACM Press.

[13] B. Heeren, D. Leijen, and A. van IJzendoorn. Helium, for learning Haskell.In ACM Sigplan 2003 Haskell Workshop, pages 62 – 71, New York, 2003.ACM Press.

[14] R. Hinze and J. Jeuring. Generic Haskell: applications. In GenericProgramming, Advanced Lectures, volume 2793 of LNCS, pages 57–97.Springer-Verlag, 2003.

[15] R. Hinze and J. Jeuring. Generic Haskell: practice and theory. InGeneric Programming, Advanced Lectures, volume 2793 of LNCS, pages1–56. Springer-Verlag, 2003.

[16] R. Hughes and S. Swierstra. Polish parsers, step by step. In Eighth ACMSigplan International Conference on Functional Programming, pages 239–248, New York, August 2003. ACM Press.

[17] R. Lammel, E. Visser, and J. Visser. Strategic programming meets adaptiveprogramming. In Proceedings of Aspect-Oriented Software Development(AOSD’03), pages 168–177, Boston, USA, March 2003. ACM Press.

[18] A. Loh, D. Clarke, and J. Jeuring. Dependency-style generic haskell. InInternational Conference on Functional Programming (ICFP’03), Uppsala,Sweden, August 2003.

[19] J. Noble, R. Biddle, E. Tempero, A. Potanin, and D. Clarke. Towards amodel of encapsulation. In International Workshop on Aliasing, Confine-ment, and Ownership (IWACO), Darmstadt, Germany, July 2003.

46

[20] K. Olmos and E. Visser. Turning dynamic typing into static typing byprogram specialization. In D. Binkley and P. Tonella, editors, ThirdIEEE International Workshop on Source Code Analysis and Manipula-tion (SCAM’03), pages 141–150, Amsterdam, The Netherlands, September2003. IEEE Computer Society Press.

[21] I. Prasetya, T. Vos, A. Azurat, and S. Swierstra. !UNITY: A HOL theoryof general UNITY. In D. Basin and B. Wolff, editors, Emerging TrendsProceedings of 16th International Conference, Theorem Proving in HigherOrder Logics (TPHOL), pages 159–176, 2003. Also available as tech. reportNo. 187 of Inst. fur Inf., Albert-Ludwig-Univ. Freiburg. Available on-lineat http://www.informatik.uni-freiburg.de/tr.

[22] I. Prasetya, T. Vos, S. Swierstra, and B. Widjaja. A theory for compos-ing distributed components based on temporary interface. In 3rd Inter-national Workshop on Composition Languages, 2003. Available on-line atwww.cs.iastate.edu/ lumpe/WCL2003.

[23] I. Prasetya, T. Vos, S. Swierstra, and B. Widjaja. A theory for composingdistributed components based on temporary interface. In H. D. Van andZ. Liu, editors, Proceedings of the Workshop on Formal Aspects of Compo-nent Software (FACS), 2003. Also as UNU/IIST Report no. 284. Availableon-line at www.iist.unu.edu/newrh/III/1/page.html.

2002

[1] A. I. Baars and S. D. Swierstra. Typing dynamic typing. In S. Peyton Jones,editor, Proceedings of the seventh ACM SIGPLAN international conferenceon Functional programming, pages 157–166. ACM Press, 2002.

[2] M. G. J. van den Brand, J. Scheerder, J. Vinju, and E. Visser. Disam-biguation filters for scannerless generalized LR parsers. In N. Horspool,editor, Compiler Construction (CC’02), volume 2304 of Lecture Notes inComputer Science, pages 143–158, Grenoble, France, April 2002. Springer-Verlag.

[3] M. Bravenboer and E. Visser. Rewriting strategies for instruction selec-tion. In S. Tison, editor, Rewriting Techniques and Applications (RTA’02),volume 2378 of Lecture Notes in Computer Science, pages 237–251, Copen-hagen, Denmark, July 2002. Springer-Verlag.

[4] D. Clarke and S. Drossopolou. Ownership, encapsulation and the disjoint-ness of type and effect. In ACM Conference on Object-Oriented Program-ming Systems, Languages and Applications (OOPSLA’02), Seattle, USA,November 2002.

[5] A. van Deursen and E. Visser. The reengineering wiki. In Proceed-ings 6th European Conference on Software Maintenance and Reengineering(CSMR)., pages 217–220. IEEE Computer Society, 2002.

[6] E. Dolstra and E. Visser. Building interpreters with rewriting strategies.In M. van den Brand and R. Lammel, editors, Workshop on Language De-scriptions, Tools and Applications (LDTA’02), volume 65/3 of Electronic

47

Notes in Theoretical Computer Science, Grenoble, France, April 2002. El-sevier Science Publishers.

[7] S. Fitzpatrick and L. Meertens. Experiments on dense graphs with astochastic, peer-to-peer colorer. In C. Gomes and T. Walsh, editors, Prob-abilistic Approaches in Search, Workshop at Eighteenth National Conf. onArtificial Intelligence (AAAI 2002), pages 24–28. AAAI Press, 2002.

[8] S. Fitzpatrick and L. Meertens. Scalable, anytime constraint optimizationthrough iterated, peer-to-peer interaction in sparsely-connected networks.In H. Ehrig, B. Kramer, and A. Ertas, editors, Proc. Sixth Biennial WorldConf. on Integrated Design & Process Technology (IDPT 2002). Society forDesign and Process Science, 2002.

[9] J. Hage, T. Harju, and E. Welzl. Euler graphs, triangle-free graphs andbipartite graphs in switching classes. In A. Corradini, H. Ehrig, H.-J.Kreowski, and G. Rozenberg, editors, Graph Transformation, First Int.Conf, ICGT 2002, volume 2505 of Lecture Notes in Computer Science,pages 48–60, Berlin, 2002. Springer Verlag.

[10] R. Hinze, J. Jeuring, and A. Loh. Type-indexed data types. In Pro-ceedings of the 6th International Conference on Mathematics of ProgramConstruction, MPC’02, volume 2386 of LNCS, pages 148–174. Springer-Verlag, 2002. Also appeared as ICS, Utrecht University, technical reportUU-CS-2002-11.

[11] L. Meertens and S. Fitzpatrick. Asynchronous execution and communica-tion latency in distributed constraint optimization. In M. Yokoo, editor,Proc. Third International Workshop on Distributed Constraint Reasoning,First International Joint Conf. on Autonomous Agents & Multiagent Sys-tems (AAMAS 2002), pages 80–85, 2002.

[12] K. Olmos and E. Visser. Strategies for source-to-source constant prop-agation. In B. Gramlich and S. Lucas, editors, Workshop on ReductionStrategies (WRS’02), volume 70 of Electronic Notes in Theoretical Com-puter Science, page 20, Copenhagen, Denmark, July 2002. Elsevier SciencePublishers.

[13] E. Visser. Meta-programming with concrete object syntax. In D. Batory,C. Consel, and W. Taha, editors, Generative Programming and ComponentEngineering (GPCE’02), volume 2487 of Lecture Notes in Computer Sci-ence, pages 299–315, Pittsburgh, PA, USA, October 2002. Springer-Verlag.

[14] T. Vos, S. Swierstra, and I. Prasetya. Yet another program refinementrelation. In International Workshop on Refinement of Critical Systems:Methods, Tools and Experience, 2002.

2001

[1] A. Baars, A. Loh, and S. Swierstra. Parsing permutation phrases. InR. Hinze, editor, Proceedings of the 2001 ACM SIGPLAN Haskell Work-shop, pages 171–182. Elsevier, 2001.

48

[2] A. I. Baars, A. Loh, and S. D. Swierstra. Parsing permutation phrases. InProceedings of the 2001 ACM SIGPLAN Workshop, volume 59 of EletronicNotes in Theoretical Computer Science. ACM Press, 2001. Also appearedin the preliminary proceedings, Technical Report of Universiteit Utrecht,UU-CS-2001-23.

[3] M. G. J. van den Brand, J. Heering, H. de Jong, M. de Jonge, T. Kuipers,P. Klint, L. Moonen, P. Olivier, J. Scheerder, J. Vinju, E. Visser, andJ. Visser. The Asf+Sdf Meta-Environment: a component-based languagelaboratory. In R. Wilhelm, editor, Compiler Construction (CC’01), volume2027 of Lecture Notes in Computer Science, pages 365–368, Genova, Italy,April 2001. Springer-Verlag.

[4] D. Clarke. An object calculus with ownership and containment. In Founda-tions of Object-oriented Programming (FOOL8), London, January 2001.

[5] D. Clarke. On deleting aggregate objects. In SPACE’01, London, January2001. Informal Proceedings.

[6] D. Clarke, J. Noble, and J. Potter. Simple ownership types for objectcontainment. In European Conference on Object-Oriented Programming(ECOOP’01), Budapest, Hungary, 2001.

[7] V. Costas and S. Swierstra. Generador de parsers basado en combinadores.In J. M. C. and C. Isabel Besembel, editors, XXVII Conferencia Lati-noamericana de INFORMATICA (CLEI 2001), page 120, 2001.

[8] A. Dijkstra and D. Swierstra. Lazy Functional Parser Combinators inJava. In Proceedings of 1st Workshop on Multiparadigm Programming withObject-Oriented Languages (MPOOL), pages 11–42. John von NeumannInstitute for Computing, 2001.

[9] E. Dolstra. Functional stratego. In E. Visser, editor, Second Stratego UsersDay, Utrecht, The Netherlands, February 2001.

[10] S. Fitzpatrick and L. Meertens. An experimental assessment of a stochastic,anytime, decentralized soft colourer for sparse graphs. In K. Steinhoefel,editor, Stochastic Algorithms: Foundations and Applications, Proc. SAGA2001, LNCS 2264, pages 49–64, 2001.

[11] R. Hinze. A simple implementation technique for priority search queues. InX. Leroy, editor, Proceedings of the International Conference on FunctionalProgramming, Firenze, Italy, September 3-5, 2001, 2001.

[12] P. Johann and E. Visser. Fusing logic and control with local transfor-mations: An example optimization. In B. Gramlich and S. Lucas, ed-itors, Workshop on Reduction Strategies in Rewriting and Programming(WRS’01), volume 57 of Electronic Notes in Theoretical Computer Science,Utrecht, The Netherlands, May 2001. Elsevier Science Publishers.

[13] M. de Jonge, E. Visser, and J. Visser. XT: A bundle of program transfor-mation tools. In M. G. J. van den Brand and D. Perigot, editors, Workshopon Language Descriptions, Tools and Applications (LDTA’01), volume 44of Electronic Notes in Theoretical Computer Science. Elsevier Science Pub-lishers, April 2001.

49

[14] E. Meijer, N. Perry, and A. van IJzendoorn. Scripting .net using mondrian.In Object-Oriented Programming (ECOOP 2001), volume 2072 of LNCS,pages 150–, June 2001.

[15] D. Swierstra. Combinator parsers: From toys to tools. In G. Hutton, edi-tor, Electronic Notes in Theoretical Computer Science, volume 41. ElsevierScience Publishers, 2001.

[16] E. Visser. Scoped dynamic rewrite rules. In M. van den Brand andR. Verma, editors, Rule Based Programming (RULE’01), volume 59/4 ofElectronic Notes in Theoretical Computer Science. Elsevier Science Pub-lishers, September 2001.

[17] E. Visser. Stratego: A language for program transformation based onrewriting strategies. System description of Stratego 0.5. In A. Middeldorp,editor, Rewriting Techniques and Applications (RTA’01), volume 2051 ofLecture Notes in Computer Science, pages 357–361. Springer-Verlag, May2001.

[18] E. Visser. A survey of rewriting strategies in program transformation sys-tems. In B. Gramlich and S. Lucas, editors, Workshop on Reduction Strate-gies in Rewriting and Programming (WRS’01), volume 57 of ElectronicNotes in Theoretical Computer Science, Utrecht, The Netherlands, May2001. Elsevier Science Publishers.

2000

[1] A. Ehrenfeucht, J. Hage, T. Harju, and G. Rozenberg. Complexity is-sues in switching of graphs. In H. Ehrig, G. Engels, H.-J. Kreowski, andG. Rozenberg, editors, Theory And Application Of Graph Transformations- TAGT ’98, volume 1764 of Lecture Notes in Computer Science, pages59–70, Berlin, 2000. Springer Verlag.

[2] P. Jansson and J. Jeuring. A framework for polytypic programming onterms, with an application to rewriting. In Workshop on Generic Program-ming, 2000. Appeared in Utrecht University technical report UU-CS-2000-19.

[3] J. Saraiva, D. Swierstra, and M. Kuiper. Functional Incremental AttributeEvaluation. In David Watt, editor, 9th International Conference on Com-piler Construction, CC/ETAPS2000, volume 1781 of LNCS, pages 279–294.Springer-Verlag, Mar. 2000.

[4] J. A. Saraiva and S. D. Swierstra. Generating spreadheet-like tools fromstrong attribute grammars. In F. Pfenning and Y. Smaragdakis, editors,Generative Programming and Component Engeneering, Second Interna-tional Conference, GPCE 2003, number 2830 in LNCS, pages 307–223.Springer-Verlag, 2000.

[5] E. Visser. Language independent traversals for program transformation. InJ. Jeuring, editor, Workshop on Generic Programming (WGP’00), Ponte deLima, Portugal, July 2000. Technical Report UU-CS-2000-19, Departmentof Information and Computing Sciences, Universiteit Utrecht.

50

1999


[2] A. Bleeker and L. Meertens. Knowledge in security protocols: an oper-ational semantics for BAN logic. In C. Areces and M. de Rijke, editors,Workshop Proc. Methods for Modalities 1. ILLC, University of Amsterdam,1999.

[3] D. Clarke, J. Noble, and J. Potter. Overcoming representation expo-sure. In Intercontinental Workshop on Aliasing in Object-Oriented Systems(IWAOOS), At European Conference on Object-Oriented Programming(ECOOP’99), Lisbon, Portugal, June 1999.

[4] S. Finne, D. Leijen, E. Meijer, and S. P. Jones. Calling hell from heaven andheaven from hell. In the International Conference on Functional Program-ming (ICFP), Paris, France, Sept. 1999. Also appeared in ACM SIGPLANNotices 34, 9, (Sep. 1999).

[5] P. Jansson and J. Jeuring. Polytypic compact printing and parsing. InS. D. Swierstra, editor, Proceedings of the 8th European Symposium onProgramming, ESOP’99, volume 1576 of LNCS, pages 273–287. Springer-Verlag, 1999.



[8] D. Leijen and E. Meijer. Domain specific embedded compilers. In SecondUSENIX Conference on Domain Specific Languages (DSL’99), pages 109–122, Austin, Texas, Oct. 1999. USENIX Association. Also appeared inACM SIGPLAN Notices 35, 1, (Jan. 2000).

[9] D. Leijen, E. Meijer, and J. Hook. Haskell as an automation controller.In the 3rd International Summerschool on Advanced Functional Program-ming, volume 1608 of LNCS, pages 268–288, Braga, Portugal, Sept. 1999.Springer-Verlag.

[10] J. Noble, D. Clarke, and J. Potter. Object ownership for dynamic aliasprotection. In TOOLS Pacific, Melbourne, Australia, November 1999.

[11] M. M. Schrage, A. Dijksta, and S. D. Swierstra. Skit, an open architecturefor courseware authoring. In FIE 99, Frontiers in Education Conference.IEEE, 1999.

51

[12] S. D. Swierstra and P. R. Azero Alcocer. Fast, error correcting parsercombinators: a short tutorial. In J. Pavelka, G. Tel, and M. Bartosek,editors, SOFSEM’99 Theory and Practice of Informatics, 26th Seminaron Current Trends in Theory and Practice of Informatics, volume 1725 ofLNCS, pages 111–129, November 1999.

[13] S. D. Swierstra, P. R. Azero Alocer, and J. Saraiava. Designing and im-plementing combinator languages. In D. Swierstra, P. Henriques, andJ. Oliveira, editors, Advanced Functional Programming, Third InternationalSchool, AFP’98, volume 1608 of LNCS, pages 150–206. Springer-Verlag,1999.

[14] E. Visser. A bootstrapped compiler for strategies (extended abstract). InB. Gramlich, H. Kirchner, and F. Pfenning, editors, Strategies in AutomatedDeduction (STRATEGIES’99), pages 73–83, Trento, Italy, July 5 1999.

[15] E. Visser. Strategic pattern matching. In P. Narendran and M. Rusi-nowitch, editors, Rewriting Techniques and Applications (RTA’99), volume1631 of Lecture Notes in Computer Science, pages 30–44, Trento, Italy, July1999. Springer-Verlag.

1998

[1] A. Bijlsma. An application of program derivation techniques to 18th-century mathematics. In J. Jeuring, editor, Mathematics of Program Con-struction, number 1422 in Lecture Notes in Computer Science, pages 44–51,Berlin, 1998. Springer.

[2] R. Bird and L. Meertens. Nested datatypes. In J. Jeuring, editor, Mathe-matics of Program Construction, LNCS 1422, pages 52–67, 1998.

[3] D. Clarke, J. Potter, and J. Noble. Ownership types for flexible aliasprotection. In ACM Conference on Object-Oriented Programming Systems,Languages and Applications (OOPSLA’98), Vancouver, Canada, October1998.

[4] A. M. Cohen and L. Meertens. The Acela project: aims and plans. InN. Kajler, editor, Computer-Human Interaction in Symbolic Computation,Texts and Monographs in Symbolic Computation. Springer-Verlag, Wien,New-York, 1998.

[5] S. Finne, D. Leijen, E. Meijer, and S. P. Jones. H/Direct: A Binary ForeignLanguage Interface to Haskell. In the International Conference on Func-tional Programming (ICFP), Baltimore,USA, 1998. Also appeared in ACMSIGPLAN Notices 34, 1, (Jan. 1999).

[6] P. Jansson and J. Jeuring. PolyLib – a polytypic function library. InWorkshop on Generic Programming, Marstrand, June 1998.

[7] L. Meertens. Functor pulling. In R. Backhouse and T. Sheard, editors,Proc. Workshop on Generic Programming, 1998.

52

[8] E. Meijer, D. Leijen, and J. Hook. Client-side web scripting withHaskellScript. In Practical Aspects of Declarative Languages (PADL), vol-ume 1551, pages 196–210, Berlin, 1998. Springer-Verlag.

[9] J. Noble, D. Clarke, and J. Potter. Dynamic alias protection in prototype-based languages. In Thinking with Prototypes Workshop at OOPSLA’98,Vancouver, Canada, October 1998.

[10] S. Peyton Jones, E. Meijer, and D. Leijen. Scripting COM components fromHaskell. In Fifth International Conference on Software Reuse (ICSR’98),Victoria, B.C., Canada, June 1998. IEEE Computer Society Press.

[11] J. Potter, D. Clarke, and J. Noble. A mode system for flexible alias pro-tection. In Formal Methods Pacific ’98, Canberra, Australia, June 1998.

[12] J. Potter, J. Noble, and D. Clarke. The ins and outs of objects. In Aus-tralian Software Engineering Conference, Adelaide, Australia, November1998. IEEE Press.

[13] A. J. M. van Gasteren and A. Bijlsma. An extension of the programderivation format. In D. Gries and W.-P. de Roever, editors, ProgrammingConcepts and Methods, pages 167–185, London, 1998. IFIP, Chapman andHall.

[14] E. Visser and Z.-e.-A. Benaissa. A core language for rewriting. In C. Kirch-ner and H. Kirchner, editors, Second International Workshop on RewritingLogic and its Applications (WRLA’98), volume 15 of Electronic Notes inTheoretical Computer Science, Pont-a-Mousson, France, September 1998.Elsevier Science Publishers.

[15] E. Visser, Z.-e.-A. Benaissa, and A. Tolmach. Building program optimizerswith rewriting strategies. In Proceedings of the third ACM SIGPLAN Inter-national Conference on Functional Programming (ICFP’98), pages 13–26.ACM Press, September 1998.

1997

[1] A. Bleeker and L. Meertens. A semantics for BAN logic. In Proc. DIMACSWorkshop on Design and Formal Verification of Security Protocols, NewBrunswick, NJ, 1997.

[2] P. Jansson and J. Jeuring. PolyP — a polytypic programming languageextension. In Conference Record of POPL ’97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 470–482. ACM Press, 1997.

[3] B. Luttik and E. Visser. Specification of rewriting strategies. In M. P. A.Sellink, editor, 2nd International Workshop on the Theory and Practice ofAlgebraic Specifications (ASF+SDF’97), Electronic Workshops in Comput-ing, Berlin, November 1997. Springer-Verlag.

53

[4] J. Saraiva, M. Kuiper, and D. Swierstra. Effective Function Cache Man-agement for Incremental Attribute Evaluation. In C. Clark, T. Davie, andK. Hammond, editors, 9th International Workshop on Implementation ofFunctional Languages, pages 517–528, St Andrews, Scotland, September1997.

[5] J. Saraiva, M. Kuiper, and D. Swierstra. Specializing Trees for EfficientFunctional Decoration. In M. Leuschel, editor, ILPS97 Workshop on Spe-cialization of Declarative Programs and its Applications, pages 63–72, Oc-tober 1997. (Also available as Technical Report CW 255, Department ofComputer Science, Katholieke Universiteit Leuven , Belgium).

[6] E. Visser. A case study in optimizing parsing schemata by disambigua-tion filters. In International Workshop on Parsing Technology (IWPT’97),pages 210–224, Boston, USA, September 1997. Massachusetts Institute ofTechnology.

[7] T. E. J. Vos and S. D. Swierstra. Make your enemies transparent. InProceedings of the 23rd International Workshop on Grpah-Theoretic Con-cepts in Computer Science, volume 1335 of LNCS, pages 342–353. Springer-Verlag, 1997.

1996

[1] B. Jay, D. Clarke, and J. Edwards. Exploiting shape in parallel program-ming. In IEEE Second International Conference for Algorithms and Archi-tecture for Parallel Processing, Singapore, June 1996.

[2] J. Jeuring and P. Jansson. Polytypic programming. In J. Launchbury,E. Meijer, and T. Sheard, editors, Advanced Functional Programming,AFP’96, volume 1129 of LNCS, pages 68–114. Springer-Verlag, 1996.

[3] L. Meertens. Calculate polytypically! In H. Kuchen and S. D. Swierstra,editors, Programming Languages: Implementations Logics, and Programs,Proc. Eighth International Symposium PLILP ’96, LNCS 1140, pages 1–16.Springer-Verlag, 1996.

[4] S. D. Swierstra and L. Duponcheel. Deterministic, error-correcting com-binator parsers. In J. Launchbury, E. Meijer, and T. Sheard, editors,Advanced Functional Programming, volume 1129 of LNCS-Tutorial, pages184–207. Springer-Verlag, 1996.

1995

[1] M. G. J. van den Brand and E. Visser. The ASF+SDF Meta-environment:Documentation tools for free! In P. D. Mosses, M. Nielsen, and M. I.Schwartzbach, editors, Theory and Practice of Software Development(TAPSOFT’95), volume 915 of Lecture Notes in Computer Science, pages803–804, Aarhus, Denmark, May 1995. Springer-Verlag. Tool demonstra-tion.

54

[2] J. Fokker. Explaining algebraic theory with functional programs. InFunctional Programming Languages in Education, FPLE’95, volume 1022of LNCS, pages 139–158, Nijmegen, The Netherlands, December 1995.Springer-Verlag.

[3] J. Fokker. Functional parsers. In Advanced Functional Programming,AFP’95, volume 925 of LNCS, pages 1–23, Bastad, Sweden, May 1995.Springer-Verlag.

[4] J. Fokker. Functional specification of the JPEG algorithm, and an imple-mentation for free. In Programming paradigms in graphics, pages 102–120,Maastricht, The Netherlands, September 1995. Springer.

[5] J. Jeuring. Polytypic pattern matching. In Conference Record of FPCA’95, SIGPLAN-SIGARCH-WG2.8 Conference on Functional ProgrammingLanguages and Computer Architecture, pages 238–248. ACM Press, 1995.



[8] E. Meijer and J. Jeuring. Merging monads and folds for functional pro-gramming. In Advanced Functional Programming, AFP’95, volume 925 ofLNCS, pages 228–266. Springer-Verlag, 1995.

[9] E. Visser. A case study in optimizing parsing schemata by disambiguationfilters. In S. Fischer and M. Trautwein, editors, Proceedings Accolade95,pages 153–167, Amsterdam, September 1995. The Dutch Graduate Schoolin Logic.

[10] E. Visser. A family of syntax definition formalisms. In M. G. J. van denBrand et al., editors, ASF+SDF’95. A Workshop on Generating Tools fromAlgebraic Specifications, pages 89–126. Technical Report P9504, Program-ming Research Group, University of Amsterdam, May 1995.

[11] E. Visser. Polymorphic syntax definition (extended abstract). In A. Nijholt,G. Scollo, and R. Steetskamp, editors, Algebraic Methods in Language Pro-cessing (AMILP’95), volume 10 of Twente Workshops in Language Tech-nology, pages 43–54, Enschede, The Netherlands, December 1995. TwenteUniversity of Technology.

1994

[1] J. Jeuring. Polytypic programming — abstract. In U. Engberg, K. Larsen,and P. Mosses, editors, Proceedings of the 6th Nordic Workshop on Pro-gramming Theory, BRICS Notes Series number NS-94-6, Dept. of Com-puter Science, University of Aarhus, Denmark, page 237, 1994.

55



[4] P. Klint and E. Visser. Using filters for the disambiguation of context-freegrammars. In G. Pighizzini and P. San Pietro, editors, Proc. ASMICSWorkshop on Parsing Theory, pages 1–20, Milano, Italy, October 1994.Tech. Rep. 126–1994, Dipartimento di Scienze dell’Informazione, Universitadi Milano.

[5] E. Visser. Writing course notes with ASF+SDF to LATEX. In T. B. Di-nesh and S. M. Uskudarli, editors, Using the ASF+SDF environment forteaching computer science. Collection presented at the NSF workshop onteaching formal methods., August 1994.

1993

[1] P. J. A. Lentfert and S. D. Swierstra. Towards the formal design of self-stabilising distributed algorithms. In P. Enjalbert, A. Finkel, and K. Wag-ner, editors, STACS 93, Proceedings of the 10th Annual Symposium onTheretical Aspects of Computer Science, volume 665 of LNCS, pages 440–451, February 1993.

[2] L. Meertens. The design of elegant languages. In G. Alberts, editor, Onthe history of ALGOL 68, pages 53–64. CWI, Amsterdam, 1993.

[3] I. Prasetya. Variable access constraints and compositionality of livenessproperties. In H. Wijshoff, editor, Proceedings of Computing Science in theNetherlands 93, pages 12–23. SION, Stichting Matematisch Centrum, 1993.Best paper award.

1992

[1] G. H. Florijn, E. Lippe, A. Dijkstra, N. van Oosterom, and S. D. Swierstra.Camera: Cooperation in open distributed environments. In Proceedings ofthe European/Usenix Spring Workshop,Jersey, 1992.

[2] J. Jeuring. The derivation of a hierarchy of algorithms for pattern matchingon arrays. In G. Hains and L. Mullin, editors, Proceedings ATABLE-92,Second international workshop on array structures, pages 199–213, 1992.DIRO publication number 841, Universite de Montreal.

[3] J. Jeuring. Incremental data compression —abstract—. In J. Storer andM. Cohn, editors, Proceedings Data Compression Conference, March 24–27, 1992, Snowbird, Utah, page 411, 1992.

56

[4] J. Jeuring. Incremental data compression —extended abstract—. InP. Fisher, editor, Proceedings of the Navy Environmental Systems Work-shop, 1992.

[5] M. Pennings, S. D. Swierstra, and H. H. Vogt. Using cached functionsand constructors for incremental attribute evaluation. In M. Bruynoogheand M. Wirsing, editors, Programming Language Implementation and LogicProgramming, volume 631 of LNCS, pages 130–144. Springer, 1992.

1991

[1] J. Jeuring. The derivation of hierarchies of algorithms on matrices. InB. Moller, editor, Constructing Programs from Specifications, pages 9–32.North-Holland, 1991.

[2] J. Jeuring. Incremental algorithms on lists. In J. v. Leeuwen, editor,Proceedings SION Computing Science in the Netherlands, pages 315–335,1991. Also appeared in EURICS Workshop on Calculational Theories ofProgram Structure, Hollum-Ameland, 1991.

[3] H. H. Vogt, S. Swierstra, and M. Kuiper. Efficient incremental evaluationof higher order attribute grammars. In J. Maluszinsky and M. Wirsing,editors, Programming language Implementation and Logic Programming,volume 528 of LNCS, pages 231–242, 1991.

1990

[1] J. Jeuring. Algorithms from theorems. In M. Broy and C. Jones, editors,Programming Concepts and Methods, pages 247–266. North-Holland, 1990.

[2] E. Kranakis, D. D. Krizanc, and L. Meertens. Link length of rectilinearwatchman tours in grids. In Proc. 2nd Canadian Conf. in ComputationalGeometry, 1990.

[3] M. F. Kuiper and S. D. Swierstra. Parallel attribute evaluation: stuctureof evaluators and detection of parallelism. In P. Deransart and M. Jour-dan, editors, Attribute grammars and their Aplication, pages 61–75. INRIA,Springer-Verlag, 1990.

[4] A. H. Uittenbogaard, P. J. A. Lentfert, and S. D. Swierstra. Smart cabling:an overview. In Proceedings of the 4th workshop on ACM SIGOPS Europeanworkshop, pages 1–5. ACM Press, 1990.

1989

[1] J. Jeuring. Deriving algorithms on binary labelled trees. In P. Apers,D. Bosman, and J. v. Leeuwen, editors, Proceedings SION Computing Sci-ence in the Netherlands, pages 229–249, 1989. Also appeared in Proceed-ings International Summer School on Constructive Algorithmics, Hollum-Ameland, 1989.

57

[2] P. J. A. Lentfert, A. H. Uittenbogaard, and G. Swierstra, S. D.and Tel. Dis-tributed hierarchical routing. In P. Apers, D.Bosman, and J. van Leeuwen,editors, Computing Science in the Netherlands, pages 321–344, Amsterdam,1989. SION, Stichting Mathematisch Centrum.

[3] L. Meertens. Constructing a calculus of programs. In J. van de Snepscheut,editor, Mathematics of Program Construction, LNCS 375, pages 66–90,1989.

[4] H. H. Vogt, S. D. Swierstra, and M. F. Kuiper. Higher order attributegrammars. In Sigplan 1989 Conference on programming language designand Implementation. ACM, 1989.

1988

[1] J. Jeuring. Finding palindromes. In Proceedings SION Computing Sciencein the Netherlands, pages 123–140, 1988.

[2] J. Jeuring. On classes of run-time functions. In Proceedings SION Com-puting Science in the Netherlands, pages 335–351, 1988.

[3] M. F. Kuiper and S. D. Swierstra. Increasing parallelism in attribute gram-mar evaluators: Transformations and lazy evaluations. In Computing Sci-ence in the Netherlands, pages 109–121. SION, SION, 1988.

1987

[1] R. S. Bird and L. Meertens. Two exercises found in a book on algorithmics.In L. Meertens, editor, Program Specification and Transformation, pages451–457. North-Holland Publishing Company, Amsterdam, 1987.

[2] M. F. Kuiper and S. D. Swierstra. Using attribute grammars to deriveefficient functional programs. In Computing Science in the NetherlandsCSN’87, Nov. 1987.

[3] L. Meertens. Een nieuwe manier van programmeren. In ZWO Jaarboek1986, pages 204–208. Netherlands Organization for the Advancement ofPure Research, The Hague, 1987.

1986

[1] L. Meertens. Algorithmics — towards programming as a mathematicalactivity. In J. de Bakker, M. Hazewinkel, and J. Lenstra, editors, Mathe-matics and Computer Science, CWI Monographs Volume 1, pages 289–334.North-Holland Publishing Company, Amsterdam, 1986.

1984

[1] L. Meertens and S. Pemberton. An implementation of the B programminglanguage. In Proc. USENIX UniForum, pages 65–74. USENIX, 1984.

58

1983

[1] L. Meertens. Incremental polymorphic type checking in B. In Conf. Recordof the 10th ACM Symposium on the Principles of Programming Languages,pages 265–275. ACM, New York, 1983.

1981

[1] L. Meertens. Issues in the design of a beginners’ programming language.In J. de Bakker and J. van Vliet, editors, Algorithmic Languages, pages167–184. North-Holland Publishing Company, Amsterdam, 1981.

[2] L. Meertens. On the design of an abstract machine for a portable ALGOL68 compiler. In J. van Vliet and H. Wupper, editors, Proc. InternationalConf. on ALGOL 68, Mathematical Centre Tract 134, pages 97–117. Math-ematisch Centrum, Amsterdam, 1981.

1979

[1] L. Meertens. Abstracto 84: the next generation. In Proc. 1979 AnnualConf., pages 33–39, Detroit, 1979. ACM.

[2] L. Meertens. Program text and program structure. In P. Hibbard andS. Schuman, editors, Constructing Quality Software, pages 271–281. North-Holland Publishing Company, Amsterdam, 1979.

1978

[1] L. Geurts and L. Meertens. Keyword grammars. In J. Andre and J.-P.Banatre, editors, Implementation and Design of Algorithmic Languages,pages 1–12. IRIA, Rocquencourt, 1978.

1977

[1] L. Meertens. From abstract variable to concrete representation. In S. Schu-man, editor, New Directions in Algorithmic Languages 1976, pages 107–133, 1977.

[2] S. D. Swierstra. Abstract data types, definition modules and extensions todefinition modules. In M(achine) O(riented) L(anguages)-bulletin, 1977.

1976

[1] L. Geurts and L. Meertens. Designing a beginners’ programming language.In S. Schuman, editor, New Directions in Algorithmic Languages 1975,pages 1–18. IRIA, Rocquencourt, 1976.

[2] L. Meertens. Mode and meaning. In S. Schuman, editor, New Directionsin Algorithmic Languages 1975, pages 125–138, 1976.

59

[3] L. Meertens and H. van Vliet. Parsing ALGOL 68 with syntax-directederror recovery. In G. Hedrick, editor, Proc. the 1975 International Conf. onALGOL 68, pages 118–155. Oklahoma State University, Stillwater, 1976.

[4] L. Meertens and H. van Vliet. Repairing the parenthesis skeleton of AL-GOL 68 programs: proof of correctness. In G. Hedrick, editor, Proc. the1975 International Conf. on ALGOL 68, pages 99–117. Oklahoma StateUniversity, Stillwater, 1976.

1974

[1] R. Bosch, D. Grune, and L. Meertens. ALEPH, A Language EncouragingProgram Hierarchy. In Proc. the International Computing Symp. 1973,pages 73–79. North-Holland Publishing Company, Amsterdam, 1974.

1971

[1] L. Meertens. Computers and creativity. In Verslagboek van het Seminaron Computer Aided Architectural Design, pages 161–163. Bouwcentrum,Rotterdam, 1971.

1969

[1] L. Meertens. The imitation of musical styles by a computer. In Informa-tion Processing 68, Proc. IFIP Congress 1968, Volume 1, pages xxv–xxvi.North-Holland Publishing Company, Amsterdam, 1969.

Master’s Theses

2001

[1] E. Dolstra. First class rules and generic traversals for program transforma-tion languages. Master’s thesis, Institute of Information and ComputingSciences, Utrecht University, Utrecht, The Netherlands, August 2001. INF-SCR-01-01.

1993

[1] E. Visser. Combinatory algebraic specification & compilation of list match-ing. Master’s thesis, Department of Computer Science, University of Am-sterdam, Amsterdam, June 1993.

1977

[1] P. v. Oostrum. A parser for algol 68. Master’s thesis, University of Utrecht,1977.

60

PositionPapers

[1] O. S. Bagge, M. Haveraaen, and E. Visser. A C++ transformation frame-work (extended abstract). In Proceedings of the Nordic Workshop on Pro-gramming Theory (NWPT’00), Bergen, Norway, October 2000.

[2] M. Bravenboer and E. Visser. Reusable and adaptable strategies for gen-erative programming. In M. Haveraaen et al., editors, GPCE SoftwareTransformation Systems Workshop (STSW’04), Vancouver, Canada, Oc-tober 2004. Position paper.

[3] E. Dolstra, G. Florijn, M. de Jonge, and E. Visser. Capturing timelinevariability with transparent configuration environments. In J. Bosch andP. Knauber, editors, IEEE Workshop on Software Variability Management(SVM’03), Portland, Oregon, USA, May 2003. IEEE.


Non-refereed Journal Articles

[1] E. Dolstra, G. Florijn, M. de Jonge, and E. Visser. Transparantie in vari-abiliteit: Heldere keuzes in een eenduidige configuratieomgeving. Infor-matie, 46(1):18–21, Feb. 2004.

Technical Reports

2004

[1] A. Dijkstra and S. D. Swierstra. Explicit implicit parameters. UU-CS2004-059, 2004. submitted for publication.

[2] A. Dijkstra and S. D. Swierstra. Typing haskell with an attribute grammar.UU-CS 2004-0037, 2004. Lecture Notes of the summer school on AdvancedFunctional Programming 2005 (AFP05).

[3] B. Heeren and J. Hage. A first attempt at type class directives. TechnicalReport UU-CS-2002-031, Institute of Information and Computing Science,University Utrecht, Netherlands, September 2004. Technical Report.

[4] L. Meertens and S. Fitzpatrick. The distributed construction of a globalcoordinate system in a network of static computational nodes from inter-node distances. Kestrel Institute Technical Report KES.U.04.04, KestrelInstitute, Palo Alto, 2004.

[5] S. D. Swierstra. Linear, online, functional pretty printing (corrected andextended version. UU-CS 2004-025a, 2004. under consideration for JFP.

61

2003

[1] F. Atanassow, D. Clarke, and J. Jeuring. Scripting XML with GenericHaskell. Technical Report UU-CS-2003-023, Utrecht University, 2003.

[2] J. Fokker. Imperatief programmeren. Technical Report edu-450, Instituteof Information and Computing Sciences, Utrecht University, 2003.

[3] P. Johann and E. Visser. Strategies for fusing logic and control via lo-cal, application-specific transformations. Technical Report UU-CS-2003-050, Institute of Information and Computing Sciences, Utrecht University,February 2003.

[4] J. van Wijngaarden and E. Visser. Program transformation mechanics.a classification of mechanisms for program transformation with a surveyof existing transformation systems. Technical Report UU-CS-2003-048,Institute of Information and Computing Sciences, Utrecht University., May2003.

2002

[1] A. Azurat and I. Prasetya. A preliminary report on xMECH. TechnicalReport UU-CS-2002-008, Inst. of Information and Comp. Science, UtrechtUniv., 2002. Download: www.cs.uu.nl/staff/wishnu.html.

[2] A. Azurat and I. Prasetya. A survey on embedding programminglogics in a theorem prover. Technical Report UU-CS-2002-007, Inst.of Information and Comp. Science, Utrecht Univ., 2002. Download:www.cs.uu.nl/staff/wishnu.html.

[3] D. Clarke, J. Jeuring, and A. Loh. The generic haskell user’s guide (beryl re-lease). Technical Report UU-CS-2002-047, Utrecht University, July 2002.

[4] B. Heeren and J. Hage. Parametric type inferencing for helium. TechnicalReport UU-CS-2002-035, Institute of Information and Computing Science,University Utrecht, Netherlands, August 2002. Technical Report.

[5] B. Heeren, J. Hage, and D. Swierstra. Generalizing hindley-milner typeinference algorithms. Technical Report UU-CS-2002-031, Institute of In-formation and Computing Science, University Utrecht, Netherlands, July2002. Technical Report.

[6] B. Heeren, J. Hage, and S. Swierstra. Generalizing hindley-milner typeinference algorithms. UU-CS 2002-31, Department of Computer Science,Utrecht University, 2002.

[7] B. Heeren, J. Jeuring, S. D. Swierstra, and P. A. Alcocer. Improving type-error messages in functional languages. Technical Report UU-CS-2002-009, Institute of Information and Computing Science, University Utrecht,Netherlands, February 2002. Technical Report.

[8] M. Schrage, J. Jeuring, and S. Swierstra. Combinators for layered softwarearchitectures. UU-CS 2002-30, 2002.

62

2001

[1] O. S. Bagge, M. Haveraaen, and E. Visser. CodeBoost: A frameworkfor the transformation of C++ programs. Technical Report UU-CS-2001-32, Institute of Information and Computing Sciences, Utrecht University,2001.

[2] M. Bravenboer and E. Visser. Guiding visitors: Separating navigation fromcomputation. Technical Report UU-CS-2001-42, Institute of Informationand Computing Sciences, Utrecht University, 2001.

[3] D. Clarke, R. Hinze, J. Jeuring, A. Loh, and J. de Wit. The generic haskelluser’s guide (amber release). Technical Report UU-CS-2001-026, UtrechtUniversity, November 2001.

[4] E. Dolstra and E. Visser. First-class rules and generic traversal. TechnicalReport UU-CS-2001-38, Institute of Information and Computing Sciences,Utrecht University, Utrecht, The Netherlands, 2001.

[5] S. Fitzpatrick and L. Meertens. Peer-to-peer coordination of autonomoussensors in high-latency networks using distributed scheduling and data fu-sion. Kestrel Institute Technical Report KES.U.01.09, Kestrel Institute,Palo Alto, 2001.

[6] S. Fitzpatrick and L. Meertens. Soft, real-time, distributed graph coloringusing decentralized, synchronous, stochastic, iterative-repair, anytime al-gorithms — a framework. Kestrel Institute Technical Report KES.U.01.05,Kestrel Institute, Palo Alto, 2001.

[7] M. de Jonge, E. Visser, and J. Visser. Collaborative software development.Technical Report SEN-R0113, CWI, Amsterdam, The Netherlands, 2001.

[8] D. Leijen and E. Meijer. Parsec: Direct style monadic parser combina-tors for the real world. Technical Report UU-CS-2001-27, Department ofComputer Science, Universiteit Utrecht, 2001.

2000

[1] J. Hage and T. Harju. A characterization of acyclic switching classes usingforbidden subgraphs. Technical Report 5, Leiden University, Departmentof Computer Science, 2000. Old version in Technical report.

[2] I. Prasetya and S. Swierstra. Formal design of self-stabilizing pro-grams: Theory and examples. Technical Report UU-CS-2000-07, Inst.of Information and Comp. Science, Utrecht Univ., 2000. Download:www.cs.uu.nl/staff/wishnu.html.

[3] I. Prasetya, S. Swierstra, and B. Widjaja. Component-wise formal ap-proach to design distributed systems. Technical Report UU-CS-2000-01,Inst. of Information and Comp. Science, Utrecht Univ., 2000. Download:www.cs.uu.nl/staff/wishnu.html.

[4] T. Vos and S. Swierstra. Program refinement in unity. UU-CS 2000-41,2000.

63

[5] T. Vos and S. Swierstra. Proving distributed hylomorphisms. UU-CS 2000-40, 2000.

[6] T. Vos and S. D. Swierstra. Defining a non-concrete recursive type in holwhich includes sets. UU-CS 2000-09, 2000.

[7] T. Vos and S. D. Swierstra. Sequential program composition in unity. UU-CS 2000-10, 2000.

1999

[1] D. Clarke, J. Noble, and J. Potter. Who’s afraid of ownership types?Technical report, Microsoft Research Institute, 1999.

[2] A. Dijkstra, M. Schrage, and D. Swierstra. Skit, an openarchitecture for courseware authoring. UU-CS 1999-26, 1999.http://fairway.ecn.purdue.edu/ fie/fie99/pages/index.htm.

1998

[1] D. Clarke, J. Potter, and J. Noble. The soundness of ownership types forflexible alias protection. Technical report, Microsoft Research Institute,1998.

[2] D. Clarke, R. Shelswell, J. Potter, and J. Noble. Object ownership to order.Technical report, Microsoft Research Institute, 1998.

[3] J. Fokker. Functioneel programmeren. Technical Report edu-431, Instituteof Information and Computing Sciences, Utrecht University, 1998.

1997

[1] A. Ehrenfeucht, J. Hage, T. Harju, and G. Rozenberg. Complexity prob-lems in switching classes of graphs. Technical Report 15, Leiden University,Department of Computer Science, 1997.

[2] J. Saraiva, D. Swierstra, and M. Kuiper. Strictification of Com-putations on Trees. Technical report UU-CS-1997-30, Depart-ment of Computer Science, Utrecht University, August 1997.ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1997/1997-30.ps.gz.

[3] E. Visser. Character classes. Technical Report P9708, Programming Re-search Group, University of Amsterdam, August 1997.

[4] E. Visser. A family of syntax definition formalisms. Technical ReportP9706, Programming Research Group, University of Amsterdam, July1997.

[5] E. Visser. Scannerless generalized-LR parsing. Technical Report P9707,Programming Research Group, University of Amsterdam, July 1997.

64

1996

[1] J. Hage and T. Harju. The size of 2-classes in group labeled 2-structures.Technical Report 17, Leiden University, Department of Computer Science,1996. Generalized in [?].

[2] I. Prasetya. Formalizing UNITY with HOL. Technical Report UU-CS-1996-01, Inst. of Information and Comp. Science, Utrecht Univ., 1996. Download:www.cs.uu.nl/staff/wishnu.html.

[3] J. Saraiva, M. Kuiper, and S. D. Swierstra. Effective function cache man-agement for incremental attribute evaluation. UU-CS 1996-50, 1996.

[4] J. Saraiva, S. D. Swierstra, M. Kuiper, and M. Pennings. Strictification oflazy functions. UU-CS 1996-51, 1996.

[5] E. Visser. Multi-level specifications. Technical Report P9604, ProgrammingResearch Group, University of Amsterdam, April, 1996. Appeared in A. vanDeursen and J. Heering and P. Klint, Language Prototyping. An AlgebraicSpecification Approach. World Scientific, 1996.

[6] E. Visser. Solving type equations in multi-level specifications (preliminaryversion). Technical Report P9606, Programming Research Group, Univer-sity of Amsterdam, Amsterdam, May 1996.

[7] T. Vos, S. Swierstra, and I. Prasetya. Formal methods and me-chanical verification applied to the development of a convergent dis-tributed sorting program. Technical Report UU-CS-1996-37, Inst. ofInformation and Comp. Science, Utrecht Univ., 1996. Download:www.cs.uu.nl/staff/wishnu.html.

1994

[1] M. G. J. van den Brand and E. Visser. From Box to TEX: An algebraic ap-proach to the generation of documentation tools. Technical Report P9420,Programming Research Group, University of Amsterdam, July 1994.

[2] J. Hage. Arl and pr2, reversible languages. Technical Report 94-25, LeidenUniversity, Leiden, 1994.

1992

[1] P. J. A. Lentfert and S. D. Swierstra. Towards the formal design ofself-stabilizing distributed algorithms. Technical Report RUU-CS-92-25,Utrecht University, August 1992. Also in: J.L.G. Dietz (Ed). ProceedingsCSN92. Utrecht, November 4–5, 1992.

[2] L. Meertens and S. Pemberton. The ergonomics of computer interfaces —designing a system for human use. Report CS-R9258, CWI, Amsterdam,1992.

[3] L. Meertens, S. Pemberton, and G. van Rossum. The ABC structure editor— structure-based editing for the ABC programming environment. ReportCS-R9256, CWI, Amsterdam, 1992.

65

[4] M. Pennings, D. Swierstra, and H. Vogt. Using cached functions and con-structors for incremental attribute evaluation. RUU-CS 92-11, Departmentof Computer Science, Padualaan 14, 1992.

1990

[1] P. J. A. Lentfert, S. D. Swierstra, and A. H. Uittenbogaard. Distributedincremental maximum finding in hierarchically divided graphs. RUU-CS 90-30, Department of Computer Science, P.O.Box 80.089, 3508 TBUTRECHT, the Netherlands, 1990.

[2] S. D. Swierstra and H. H. Vogt. Higher order attribute grammars: amerge between functional and object oriented programming. RUU-CS 90-12, Dept. of Computer Science, 1990.

[3] H. H. Vogt, S. Swierstra, and M. Kuiper. On the efficient incrementalevaluation of higher order attribute grammars. RUU-CS 90-36, Departmentof Computer Science, P.O.Box 80.089, 3508 TB Utrecht, the Netherlands,1990.

1989

[1] P. J. A. Lentfert, A. H. Uittenbogaard, S. D. Swierstra, and G. Tel. Dis-tributed hierarchical routing. RUU-CS 89-5, Department of Computer Sci-ence, PO.Box 80.089, 3508 TB Utrecht, the Netherlands, 1989.

1986

[1] M. F. Kuiper and S. D. Swierstra. Using attribute grammars to deriveefficient functional programs. RUU-CS 86-16, Department of ComputerScience, 1986.

1985

[1] A. d. Raaf, A. Dijkstra, and S. Swierstra. A lan with real-time, facilitiesbased on osi-concepts,. RUU-CS 85, Department of Computer Science,1985.

1984

[1] A. Schoute and S. Swierstra. Writing concurrent programs in a sequen-tial language like pascal. Inf-Memorandum 1984-20, Twente University ofTechnology, 1984.

1983

[1] T. J. Krijnen and L. Meertens. Making B-trees work for B. MathematicalCentre Report IW 219, Mathematisch Centrum, Amsterdam, 1983.

[2] P. v. Oostrum. Interaktie met persoonlijke informatiesystemen. TechnicalReport RUU-CS-83-03, University of Utrecht, Department of Computerscience, 1983.

66

1981

[1] L. Meertens. Definition of an abstract ALGOL 68 machine. MathematicalCentre Report IW 188, Mathematisch Centrum, Amsterdam, 1981.

[2] L. Meertens and H. van Vliet. ALGOL 68+, a superlanguage of ALGOL68 for processing the standard-prelude. Mathematical Centre Report IW168, Mathematisch Centrum, Amsterdam, 1981.

[3] L. Meertens and H. van Vliet. Making ALGOL 68+ texts conform to anoperator-priority grammar. Mathematical Centre Report IW 180, Mathe-matisch Centrum, Amsterdam, 1981.

[4] L. Meertens and H. van Vliet. On the MC ALGOL 68 compiler. Mathemat-ical Centre Report IW 189, Mathematisch Centrum, Amsterdam, 1981.

[5] L. Meertens and H. van Vliet. On top-down parsing of ALGOL 68+.Mathematical Centre Report IW 182, Mathematisch Centrum, Amster-dam, 1981.

[6] L. Meertens and H. van Vliet. An operator-priority grammar for ALGOL68+. Mathematical Centre Report IW 173, Mathematisch Centrum, Am-sterdam, 1981.

[7] L. Meertens and H. van Vliet. An underlying context-free grammar of AL-GOL 68+. Mathematical Centre Report IW 171, Mathematisch Centrum,Amsterdam, 1981.

1979

[1] L. Meertens. Bitonic sort on ultracomputers. Ultracomputer Note #1,Computer Science Department, Courant Institute of Mathematical Sci-ences, New York University, 1979.

[2] L. Meertens. Recurrent ultracomputers are not log N -fast. UltracomputerNote #2, Computer Science Department, Courant Institute of Mathemat-ical Sciences, New York University, 1979.

[3] S. D. Swierstra. Another approach to type checking. Technical report,Twente University of Technology, 1979.

[4] S. D. Swierstra. Machine architectures for block structured languages.Technical Report 262, Technical University Twente, 1979.

1974

[1] D. Grune, R. Bosch, and L. Meertens. Aleph manual. Mathematical CentreReport IW 17, Mathematisch Centrum, Amsterdam, 1974.

[2] D. Grune, L. Meertens, H. van Vliet, and R. van Vliet. Remarks on theTransput Section of the Revised Report on ALGOL 68. MathematicalCentre Report IN 7, Mathematisch Centrum, Amsterdam, 1974.

[3] L. Meertens and H. van Vliet. Repairing the state switcher skeleton ofALGOL 68 programs. Mathematical Centre Report IW 15, MathematischCentrum, Amsterdam, 1974.

67

1973

[1] D. Grune, L. Meertens, and H. van Vliet. Grammar-handling tools appliedto ALGOL 68. Mathematical Centre Report IW 5, Mathematisch Centrum,Amsterdam, 1973.

[2] L. Meertens and H. van Vliet. Repairing the parenthesis skeleton of ALGOL68 programs. Mathematical Centre Report IW 2, Mathematisch Centrum,Amsterdam, 1973.

[3] L. Meertens and H. van Vliet. A syntax-directed error-recovery method forparsing ALGOL 68 programs. Mathematical Centre Report IN 6, Mathe-matisch Centrum, Amsterdam, 1973.

1972

[1] J. W. de Bakker and L. Meertens. Simple recursive program schemes andinductive assertions. Mathematical Centre Report MR 142, MathematischCentrum, Amsterdam, 1972.

[2] G. Nogarede, M. Rem, L. Meertens, L. Geurts, and R. P. van de Riet. TheMC ELAN assembler. Mathematical Centre Report MR 132, MathematischCentrum, Amsterdam, 1972.

1969

[1] L. Geurts, L. Meertens, R. P. van de Riet, and A. van Wijngaarden. Phys-ionomie, psyche en chironomie. Mathematical Centre Report DR 38, Math-ematisch Centrum, Amsterdam, 1969.

1968

[1] L. Meertens. Quartet no. 1 in C major for 2 violins, viola and violoncello.Mathematical Centre Report MR 96, Mathematisch Centrum, Amsterdam,1968.

1966

[1] C. H. Koster, L. Geurts, and L. Meertens. Praktijkcursus ALGOL 60.Mathematical Centre Report MR 85, Mathematisch Centrum, Amsterdam,1966.

1962

[1] C. H. Koster and L. Meertens. Basic English, a generative grammar for apart of English. Technical report, Euratom Seminar “Machine en Talen”,University of Amsterdam, 1962.

68

Documentation

1998

[1] P. van Oostrum. Handleiding Unix. Universiteit Utrecht, vakgroep Infor-matica, juli 1998.

1995

[1] P. van Oostrum. Bibliotheekgebruik voor informaticastudenten. UniversiteitUtrecht, vakgroep Informatica, october 1995.

[2] P. van Oostrum. Handleiding LATEX. Universiteit Utrecht, vakgroep Infor-matica, april 1995.

Unpublished Documents

1992

[1] E. Visser. Syntax and static semantics of Eiffel. A case study in algebraicspecification techniques. Unpublished technical report, December 1992.

69