Viera, M. & Swierstra, S.D. (2012). Attribute Grammar Macros. In F. de Carvalho Junior & L. Barbosa (Eds.), Programming Languages (Lecture Notes in Computer Science, 7554) (pp. 150-164). Springer Berlin / Heidelberg.
|
Dijkstra, A., Stutterheim, J., Vermeulen, A. & Swierstra, S.D. (2012). Building JavaScript Applications with Haskell. In IFL 2012.
|
Viera, M.O. & Swierstra, S.D. (2012). Compositional Compiler Construction: Oberon0. Utrecht: Department of Information and Computing Science, Utrecht University.
|
Viera, M., Swierstra, S.D. & Dijkstra, A. (2012). Grammar Fragments Fly First-Class. In proc of the 12th Workshop on Language Descriptions Tools and Applications (pp. 47-60).
|
Boerwinkel, D.J., Waarlo, A.J. & Swierstra, S.D. (2012). Reframing Classroom Discourses on Genetic Testing from an STS Perspective. Poster presented at the 9th ERIDOB Conference, Berlin, 18th-21st September: Berlin (2012, September 18 - 2012, September 21).
|
Boerwinkel, D.J., Waarlo, A.J. & Swierstra, S.D. (2012). Reframing Classroom Discourses on Genetic Testing from an STS Perspective. In Conference Programme Booklet of the 9th ERIDOB Conference (pp. 83-83). Berlin: ERIDOB.
|
Bransen, J., Middelkoop, A., Dijkstra, A. & Swierstra, S.D. (2012). The Kennedy-Warren algorithm revisited: ordering Attribute Grammars. In C. Russo & N.-F. Zhou (Eds.), Practical Aspects of Declarative Languages Vol. 7149. Lecture Notes in Computer Science (pp. 183-197). Springer Berlin / Heidelberg.
|
Viera, M., Swierstra, S.D. & Middelkoop, Arie (2012). UUAG Meets AspectAG. In proc of the 12th Workshop on Language Descriptions Tools and Applications.
|
Middelkoop, A., Dijkstra, A. & Swierstra, S.D. (2011). A lean specification for GADTs: system F with first-class equality proofs. Higher-Order and Symbolic Computation, 1-22.
|
Middelkoop, A., Dijkstra, A. & Swierstra, S.D. (2011). Dependently Typed Attribute Grammars. In IFL 2010 Vol. 6647. Lecture Notes in Computer Science. Springer Verlag AG.
|
Viera, M. & Swierstra, S.D. (2011). Grammar Fragments Fly First-Class. : Department of Information and Computing Sciences, Utrecht University.
|
Swierstra, S.D., Swierstra, D. & Stutterheim, J. (2011). Logisch en Functioneel Programmeren voor Wiskunde D. : Department of Information and Computing Sciences, Utrecht University.
|
Viera, M. & Swierstra, S.D. (2011). Semantic Macros- Attribute Grammar Combinators. : Department of Information and Computing Sciences, Utrecht University.
|
Duivenboden, H. & Swierstra, S.D. (2011). Spotlight on Chain-computerisation: significance for theory and practice. Journal of Chain-computerisation, 2.
|
Middelkoop, A., Dijkstra, A. & Swierstra, S.D. (2011). Stepwise evaluation of attribute grammars. In Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications (pp. 1-8). ACM.
|
Viera, M., Swierstra, S.D. & Middelkoop, A. (2011). UUAG Meets AspectAG- How to make Attribute Grammars First-Class. : Department of Information and Computing Sciences, Utrecht University.
|
Middelkoop, A., Dijkstra, A. & Swierstra, S.D. (2011). Visitor-based Attribute Grammars with Side Effect. Electronical Notes in Theoretical Computer Science, 264(5), 47-69.
|
Middelkoop, A., Dijkstra, A. & Swierstra, S.D. (2011). Visitor-based Attribute Grammars with Side Effect. In Workshop on Generative Technologies Vol. 264. Electron. Notes Theor. Comput. Sci. (pp. 47-69). Amsterdam: Elsevier Science Publishers B. V..
|
Middelkoop, A., Dijkstra, A. & Swierstra, S.D. (2010). Iterative type inference with attribute grammars. In Proceedings of the ninth international conference on Generative programming and component engineering (pp. 43-52). New York, NY, USA: ACM.
|
Baars, A.I., Swierstra, S.D. & Viera, M. (2010). Typed Transformations of Typed Grammars: The Left Corner Transform. Electronical Notes in Theoretical Computer Science, 253(7), 51-64.
|
Middelkoop, A., Dijkstra, A. & Swierstra, S.D. (2010). Visit Functions for the Semantics of Programming Languages. In Workshop On Generative Technologies 2010.
|
Middelkoop, A., Dijkstra, A. & Swierstra, S.D. (2009). A Leaner Specification for GADTs. In P. Achten, P. Koopman & M.T. Moraz\'an (Eds.), Trends in Functional Programming (pp. 65-80). Intellect.
|
Swierstra, S.D. & Fokker, J.D. (2009). Abstract Interpretation of Functional Programs using an Attribute Grammar System. Electron. Notes Theor. Comput. Sci., 238(5), 117-133.
|
Koopman, P., Plasmeijer, R. & Swierstra, S.D. (Eds.). (2009). Advanced Functional Programming; 6th International School, AFP 2008, Revised lectures (LNCS-Tutorial, 5832). Springer Verlag.
|
Viera, M., Swierstra, S.D. & Swierstra, W. (2009). Attribute grammars fly first-class: how to do aspect oriented programming in Haskell. In ICFP '09: Proceedings of the 14th ACM SIGPLAN international conference on Functional programming (pp. 245-256). New York, NY, USA: ACM.
|
Swierstra, S.D. (2009). Combinator Parsers: a short tutorial. In A. Bove, L. Barbosa, A. Pardo & J. Sousa Pinto (Eds.), Language Engineering and Rigorous Software Development Vol. 5520. Lecture Notes in Computer Science (pp. 252-300). Piriapolis: Springer.
|
Swierstra, S.D. (2009). Construct Your Own Favorite Programming Language. onbekend: UU BETA ICS Departement Informatica.
|
Swierstra, S.D. & Chitil, O. (2009). Linear, bounded, functional pretty-printing. Journal of functional programming, 19(01), 1-16.
|
Dijkstra, A., Fokker, J.D. & Swierstra, S.D. (2009). The architecture of the Utrecht Haskell compiler. In Haskell '09: Proceedings of the 2nd ACM SIGPLAN symposium on Haskell (pp. 93-104). New York, NY, USA: ACM.
|
Baars, A.I., Swierstra, S.D. & Viera, M. (2009). Typed transformations of typed abstract syntax. In TLDI '09: Proceedings of the 4th international workshop on Types in language design and implementation (pp. 15-26).
|
Baars, A.I., Swierstra, S.D. & Viera, M. (2009). Typed transformations of typed grammars: The left corner transform. In Jurge Vinju & Torbjörn Eckman (Eds.), 9th Workshop on Language Desriptions Tools and Applications (pp. 8-33).
|
Fokker, J.D. & Swierstra, S.D. (2008). Abstract interpretation of functional programs using an attribute grammar system. In A. Johnstone (Ed.), Language descriptions, tools and applications. Budapest: ETAPS.
|
Schrage, M.M. & Swierstra, S.D. (2008). Beyond ASCII - Parsing Programs with Graphical Presentations. "Journal of Universal Computer Science", 14(21), 3414-3430.
|
Schrage, M.M. & Swierstra, S.D. (2008). Beyond ASCII -- parsing programs with graphical presentations. In XII Brazilian Symposium on Programming Languages.
|
Swierstra, S.D. (2008). Combinator Parsing: A Short Tutorial. (UU-CS 2008-044). onbekend: UU WINFI Informatica.
|
Schrage, M.M. & Swierstra, S.D. (2008). Haskell as an Architecture Description Language. (UU-CS 2008-045). onbekend: UU WINFI Informatica.
|
Viera, M., Swierstra, S.D. & Lemspink, E. (2008). Haskell, Do You Read Me; Constructing and Composing Efficient Top-down Parsers at Runtime. In A. Gill (Ed.), Proceedings of the first ACM SIGPLAN symposium on Haskell (pp. 63-74). New York: Association of Computing Machinery.
|
Swierstra, S.D. & Chitil, O. (2008). Linear, bounded, functional pretty-printing. Journal of functional programming, 19(01), 1-16.
|
Baars, A.I. & Swierstra, S.D. (2008). Typed Transformations of Typed Abstract Syntax. (UU-CS UU-CS-2008-021). onbekend: UU WINFI Informatica en Informatiekunde.
|
Fokker, J.D. & Swierstra, S.D. (2007). Abstract Interpretation of Functional Programs using an Attribute Grammar System. (UU-CS 2007-049). onbekend: UU WINFI Informatica en Informatiekunde.
|
Dijkstra, A., Fokker, J.D. & Swierstra, S.D. (2007). The Structure of the Essential Haskell Compiler, or Coping with Compiler Complexity. In O Chitil (Ed.), Implementation and Application of Functional Languages. 19th International Symposium, IFL 2007 (pp. 107-122). Canterbury, Kent, UK: Computing Laboratory, University of Kent.
|
Dijkstra, A. & Swierstra, S.D. (2006). Exploiting Type Annotations. onbekend: UU WINFI Informatica en Informatiekunde.
|
Dijkstra, A. & Swierstra, S.D. (2006). Ruler: Programming Type Rules. In Functional and Logic Programming: 8th International Symposium, FLOPS 2006, Fuji-Susono, Japan, April 24-26, 2006 (pp. 30-46). Springer-Verlag.
|
Prasetya, I.S.W.B., Vos, T.E.J. & Swierstra, S.D. (2006). Web Cubes. In E Najm & J.F. Pradat-Peyre (Eds.), Proceedings of 26th IFIP WG 6.1 International Conference on Formal Methods for Networked and Distributed Systems (FORTE) Vol. 4229. Lecture Notes in Computer Science (pp. 77-92). Springer.
|
Prasetya, I.S.W.B., Vos, T.E.J., Azurat, A. & Swierstra, S.D. (2005). A UNITY-based Framework towards Component Based Systems. In T. Higashino (Ed.), Proceedings of 8th International Conference on Principles of Distributed Systems (OPODIS) (pp. 52-66). Berlin: Springer-Verlag.
|
Swierstra, S.D. (2005). Domain Specific Embedded Languages. Vakidioot, 3-7.
|
Prasetya, I.S.W.B. & Swierstra, S.D. (2005). Formal Design of Self-stabilizing Programs. Journal of Highspeed Network, special issue on self-stabilizing systems, 14, 59-84.
|
Dijkstra, A. & Swierstra, S.D. (2005). Making Implicit Parameters Explicit. (UU-CS 2005-032). onbekend: UU WINFI Informatica en Informatiekunde.
|
Guerra, M.A.R.S., Baars, A.I., Swierstra, S.D. & Saraiva, J.A.B.V. (2005). Preserving order in non-order preserving parsers. (UU-CS 2005-025). onbekend: UU WINFI Informatica en Informatiekunde.
|
Vos, T.E.J. & Swierstra, S.D. (2005). Reusable Specifications and Proofs Through Parameterization and Refinement. In Proceedings of the 2nd International Conference on Computer Science and its applications.
|
Dijkstra, A. & Swierstra, S.D. (2005). Ruler: Programming Type Rules. (CS-UU 2005-033). onbekend: UU WINFI Informatica en Informatiekunde.
|
Prasetya, I.S.W.B., Vos, T.E.J., Swierstra, S.D. & Widjaja, B. (2005). Web Cube: a Programming Model for Reliable Web Applications. (UU-CS 2005-002). onbekend: UU WINFI Informatica en Informatiekunde.
|
Dijkstra, A. & Swierstra, S.D. (2004). Explicit implicit parameters. (UU-CS 2004-59). Utrecht: Utrecht University: Information and Computing Sciences.
|
Vos, T.E.J. & Swierstra, S.D. (2004). Facilitating the Verification of Diffusing Computations and Their Applications. In M. Solar, D. Fernández-Baca & E. Cuadros-Vargas (Eds.), Proceedings of the 30ma Conferencia Latinoamericana de Informática (pp. 42-53).
|
Guerra, M.A.R.S., Jeuring, J.T. & Swierstra, S.D. (2005). Generic validation in an XPath-Haskell data binding. In Proceedings Plan-X, Programming Language Technologies for XML..
|
Swierstra, S.D. (12-17-2004). Goed genoeg is niet goed genoeg. Automatiseringsgids, pp. 19-19.
|
Prasetya, I.S.W.B., Vos, T.E.J. & Swierstra, S.D. (2004). Introduction to Correctness Approach in Programming, Lecture Notes. Universiteit Utrecht, Instituut Informatica en Informatiekun.
|
Swierstra, S.D. (2004). Linear, Online, Functional Pretty Printing (corrected and extended version). (UU-CS 2004-025). Utrecht: Utrecht University: Information and Computing Sciences.
|
Baars, A.I., Löh, A. & Swierstra, S.D. (2004). Parsing Permutation Phrases. Journal of functional programming, 14(6), 635-646.
|
Baars, A.I. & Swierstra, S.D. (2004). Type-safe, self inspecting code. In Proceedings of the ACM SIGPLAN workshop on Haskell. (pp. 69-79). Snowbird, Utah: ACM Press.
|
Dijkstra, A. & Swierstra, S.D. (2004). Typing Haskell with an Attribute Grammar. In Advanced Functional Programming Summerschool.
|
Dijkstra, A. & Swierstra, S.D. (2004). Typing Haskell with an Attribute Grammar (Part I). (UU-CS 2004-037). Utrecht: Utrecht University: Information and Computing Sciences.
|
Prasetya, I.S.W.B., Vos, T.E.J., Azurat, A. & Swierstra, S.D. (2003). !UNITY: A HOL Theory of General UNITY. In D. Basin & B. Wolff (Eds.), Emerging Trends Proceedings of 16th International Conference, Theorem Proving in Higher Order Logics (TPHOL) (pp. 159-176).
|
Prasetya, I.S.W.B., Vos, T.E.J., Swierstra, S.D. & Widjaja, B. (2003). A Theory for Composing Distributed Components Based on Temporary Interface. In Hung.Dang Van & Zhiming Liu (Eds.), Proceedings of the Workshop on Formal Aspects of Component Software (FACS).
|
Prasetya, I.S.W.B., Vos, T.E.J., Swierstra, S.D. & Widjaja, B. (2003). A Theory for Composing Distributed Components Based on Temporary Interface. In 3rd International Workshop on Composition Languages.
|
Prasetya, I.S.W.B., Vos, T.E.J., Azurat, A. & Swierstra, S.D. (2003). A UNITY-based Framework towards Component Based Systems. (UU-CS 2003-043). Utrecht: Utrecht University: Information and Computing Sciences.
|
Heeren, B.J., Hage, J. & Swierstra, S.D. (2003). Constraint based type inferencing in Helium. In M.-C. Silaghi & M. Zanker (Eds.), Workshop Proceedings of Immediate Applications of Constraint Programming (pp. 59-80). Cork.
|
Hughes, R.J.M. & Swierstra, S.D. (2003). Polish Parsers, Step by Step. In Eighth ACM Sigplan International Conference on Functional Programming (pp. 239-248). New York: ACM Press.
|
Heeren, B.J., Hage, J. & Swierstra, S.D. (2003). Scripting the type inference process. In Eighth ACM Sigplan International Conference on Functional Programming (pp. 3-13). New York: ACM Press.
|
Vos, T.E.J. & Swierstra, S.D. (2000). Sequential program composition in Unity. (UU-CS 2000-10). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Prasetya, I.S.W.B., Vos, T.E.J., Azurat, A. & Swierstra, S.D. (2002). !UNITY: A Theory of General UNITY. (UU-CS 2002-025). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Schrage, M., Jeuring, J.T. & Swierstra, S.D. (2002). Combinators for layered software architectures. (UU-CS 2002-030). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Prasetya, I.S.W.B., Azurat, A. & Swierstra, S.D. (2002). Embedding Programming Logics in HOL Theorem Prover. Jurnal Ilmu Komputer dan Teknologi Informasi, 2(1).
|
Prasetya, I.S.W.B. & Swierstra, S.D. (2002). Factorizing Fault Tolerance. Journal of Theoretical Computer Science, 290(2), 1201-1222.
|
Heeren, B.J., Hage, J. & Swierstra, S.D. (2002). Generalizing Hindley-Milner Type Inference Algorithms. (UU-CS 2002-031). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Heeren, B.J., Jeuring, J.T., Swierstra, S.D. & Alcocer, A. (2002). Improving type-error messages in functional languages. (UU-CS 2002-009). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Vos, T.E.J. & Swierstra, S.D. Inductive data types with negative occurences in HOL. Edinburgh, UK, Workshop on Thirty Five years of Automath.
|
Prasetya, I.S.W.B., Vos, T.E.J. & Swierstra, S.D. (2002). Introduction to Correctness Approach in Programming, Lecture Notes. Universiteit Utrecht, Instituut Informatica en Informatiekun.
|
Baars, A.I. & Swierstra, S.D. (2002). Typing dynamic typing. In S. Peyton Jones (Ed.), Proceedings of the seventh ACM SIGPLAN international conference on Functional programming (pp. 157-166). New York, USA: ACM Press.
|
Vos, T.E.J., Swierstra, S.D. & Prasetya, I.S.W.B. (2002). Yet Another Program Refinement Relation. In International Workshop on Refinement of Critical Systems: Methods, Tools and Experience.
|
Swierstra, S.D. (2001). Combinator Parsers: From Toys to Tools. In G. Hutton (Ed.), Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers.
|
Costas, V.A. & Swierstra, S.D. (2001). Generador de Parsers Basado en Combinadores. In J. Montilva & I. Besembel (Eds.), XXVII Conferncia Latinoamericana de INFORMATICA (CLEI 2001).
|
Dijkstra, A. & Swierstra, S.D. (2001). Lazy Functional Parser Combinators in Java. In Proceedings of 1st Workshop on Multiparadigm Programming with Object-Oriented Languages (MPOOL) (pp. 11-42). John von Neumann Institute for Computing.
|
Dijkstra, A. & Swierstra, S.D. (2001). Lazy Functional Parser Combinators in Java. (UU-CS 2001-18). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Dijkstra, A. & Swierstra, S.D. (2001). Lecture Notes: Implementation of Programming Languages. Utrecht: Utrecht University, Inst. of Inform. and Computing Science.
|
Baars, A.I., Löh, A. & Swierstra, S.D. (2001). Parsing Permutation Phrases. In R. Hinze (Ed.), Proceedings of the 2001 ACM SIGPLAN Haskell Workshop. Elsevier.
|
Vos, T.E.J. & Swierstra, S.D. (2001). Program refinement in UNITY. (UU-CS 2001-41). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Vos, T.E.J. & Swierstra, S.D. (2001). Proving distributed hylomorphisms. (UU-CS 2001-40). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Prasetya, I.S.W.B., Azurat, A. & Swierstra, S.D. (2001). Sebuah Framework untuk Mekanisasi Multi Logika. Jurnal Ilmu Komputer dan Teknologi Informasi, 1.
|
Prasetya, I.S.W.B., Swierstra, S.D. & Widjaja, B. (2001). Teori Komposisi Komponen. Jurnal Ilmu Komputer dan Teknologi Informasi, 1.
|
Prasetya, I.S.W.B., Swierstra, S.D. & Widaja, B. (2000). Component-wise formal approach to design distributed systems. (UU-CS 2000-01). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Vos, T.E.J. & Swierstra, S.D. (2000). Defining a non-concrete recursive type in HOL which includes sets. (UU-CS 2000-09). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Prasetya, I.S.W.B. & Swierstra, S.D. (2000). Factorizing fault tolerance. (UU-CS 2000-02). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Moor, O de, Backhouse, K & Swierstra, S.D. (2000). First Class Attribute Grammars. In Third Workshop on Attribute Grammars and their Applications.
|
Moor, O de, Backhouse, K & Swierstra, S.D. (2000). First Class Attribute Grammars. Informatica : journal of computing and informatics, 2(24), 329-341.
|
Prasetya, I.S.W.B. & Swierstra, S.D. (2000). Formal design of self-stabilizing programs: Theory and examples. (UU-CS 2000-07). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Saraiva, J.A.B.V., Swierstra, S.D. & Kuiper, M. (2000). Functional, Incremental Attribute Evaluation. In D Watt (Ed.), 9th International Conference on Compiler Construction - ETAPS'00 (pp. 279-294). Springer.
|
Saraiva, João A. & Swierstra, S.D. (2000). Generating Spreadheet-Like Tools from Strong Attribute Grammars. In Frank Pfenning & Yannis Smaragdakis (Eds.), Generative Programming and Component Engeneering, Second International Conference, GPCE 2003 (pp. 307-223). Springer-Verlag.
|
Vos, T.E.J. & Swierstra, S.D. (2000). Sequential program composition in Unity. (UU-CS 2000-10). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Swierstra, S.D., Henriques, P. & Oliveira, J. (Eds.). (1999). Advanced Functional programming ( Third International School, AFP'98) (LNCS, 1608). Berlin: Springer-Verlag.
|
Jeuring, J.T. & Swierstra, S.D. (1999). Advanced Programming Concepts in a Course on Grammars and Parsing. In M Felleisen, M. Hanus & S. Thompson (Eds.), Proceedings Workshop on Functional and Declarative Programming in Education (pp. 7-12). RICE COMP.
|
Saraiva, J.A.B.V. & Swierstra, S.D. (1999). Data Structure Free Compilation. In S. Jähnichen (Ed.), 8th International Conference on Compiler Construction Vol. 1575. Lecture Notes in Computer Science (pp. 1-16). Berlin: Springer Verlag.
|
Swierstra, S.D., Alcocer, A. & Saraiva, J.A.B.V. (1999). Designing and Implementing Combinator Languages. In S.D. Swiestra, P.R. Henriques & J.N. Oliveira (Eds.), Advanced Functional Programming, Third International School, AFP'98 (pp. 150-206). Berlin: Springer Verlag.
|
Swierstra, S.D. (Ed.). (1999). European Symposium on Programming (LNCS, 1576). Berlin: Springer.
|
Swierstra, S.D. & Azero Alcocer, P. (1999). Fast, Error Correcting Parser Combinators: A Short Tutorial. In J. Pavelka, G. Tel & M. Bartosek (Eds.), SOFSEM'99 Theory and Practice of Informatics, 26th Seminar on Current Trends in Theory and Practice of Informatics (LNCS, 1725) (pp. 111-129). Berlin: Springer.
|
Saraiva, J.A.B.V. & Swierstra, S.D. (1999). Generic Attribute Grammars. In 2nd International Workshop on Attribute Grammars and their Applications INRIA (pp. 185-204). Rocquencourt: INRIA.
|
Dijkstra, A., Schrage, M. & Swierstra, S.D. (1999). SKIT, An Open Architecture for Courseware Authoring. In Proceedings of the 1999 Frontiers in Education Conference (pp. 12c3-7-12c3-12). IEEE Computer Society Press.
|
Dijkstra, A., Schrage, M. & Swierstra, S.D. (1999). SKIT, An open architecture for courseware authoring. (UU-CS 1999-26). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Saraiva, J.A.B.V., Swierstra, S.D. & Kuiper, M. (1999). Strictification of Computations on Trees. In 3th Latin-American Conference on Functional Programming,CLaPF'99.
|
Swierstra, S.D. & Azero, P. (1998). Attribute grammars in the functional style. In N. Horspool (Ed.), Systems Implementation 2000 (pp. 180-193). Chapman & Hall.
|
Azero Alcocer, P. & Swierstra, S.D. (1998). Optimal pretty-printing combinators (Software).
|
Saraiva, J.A.B.V., Kuiper, M.F. & Swierstra, S.D. (1997). Effective function cache management for incremental attribute evaluation. In C. Clark, T. Davie & K. Hammond (Eds.), 9th International Workshop on Implementation of Functional Languages (pp. 517-528). St. Andrews, Schotland.
|
Vos, T.E.J. & Swierstra, S.D. (1997). Make your enemies transparent. In R.H. Mohring (Ed.), Proceedings of 23rd International Workshop on Graph-Theoretic Concepts in Computer Science Vol. 1335. Lecture Notes in Computer Science (pp. 342-353). Berlin-Heidelberg: Springer-Verlag.
|
Saraiva, J.A.B.V., Kuiper, M.F. & Swierstra, S.D. (1997). Specializing Trees for Efficient Functional Decoration. In M. Leuschel (Ed.), ILPS97 Workshop on Specialization of Declarative Programs and its Applications (pp. 63-72).
|
Saraiva, J.A.B.V., Swierstra, S.D. & Kuiper, M.F. (1997). Strictification of computations on trees. (UU-CS 1997-30). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Swierstra, S.D. & Duponcheel, L.C.S. (1996). Deterministic, error-correcting combinator parsers. In J. Launchbury, E. Meijer & T. Sheard (Eds.), Advanced Functional Programming. Berlin: Springer.
|
Saraiva, J.A.B.V., Kuiper, M.F. & Swierstra, S.D. (1996). Effective function cache management for incremental attribute evaluation. (UU-CS 1996-50). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Vos, T.E.J., Swierstra, S.D. & Prasetya, I.S.W.B. (1996). Formal methods and mechanical verification applied to the development of a convergent distributed sorting program. (UU-CS 1996-37). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Kuchen, H. & Swierstra, S.D. (1996). Proceedings of the 8th International PLILP Symposium "Programming Languages: Implementations, Logics and Programs" (LNCS, 1140). Berlin: Springer.
|
Saraiva, J.A.B.V., Swierstra, S.D., Kuiper, M.F. & Pennings, M. (1996). Strictification of lazy functions. (UU-CS 1996-51). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Jeuring, J.T. & Swierstra, S.D. (1994). Bottom-up grammar analysis - A functional formulation. (UU-CS 1994-01). Utrecht.
|
Lentfert, P. & Swierstra, S.D. (1992). Towards the formal design of self-stabilizing distributed algorithms. (RUU-CS 92-25). Utrecht.
|
Pennings, M., Vogt, H.H. & Swierstra, S.D. (1992). Using cached functions and constructors for incremental attribute evaluation. (RUU-CS 92-11). Utrecht.
|
Swierstra, S.D. & Moor, O. de (1992). Virtual data structures. (RUU-CS 92-16). Utrecht.
|
Swierstra, S.D. & Vogt, H.H. (1991). Higher order attribute grammars, Lecture notes of the International Summer School on Attribute Grammars, applications and systems. (RUU-CS 91-14). Utrecht.
|
Lentfert, P. & Swierstra, S.D. (1990). Distributed incremental maximum finding in hierarchically divided graphs. (RUU-CS 90-30). Utrecht.
|
Swierstra, S.D. & Vogt, H.H. (1990). Higher order attribute grammars: a merge between functional and object oriented programming. (RUU-CS 90-12). Utrecht.
|
Vogt, H.H., Kuiper, M.F. & Swierstra, S.D. (1990). On the efficient incremental evaluation of higher order attribute grammars. (RUU-CS 90-36). Utrecht.
|
Swierstra, S.D. (1989). Distributed hierarchical routing. (RUU-CS 89-05). Utrecht.
|
Vogt, H.H., Swierstra, S.D. & Kuiper, M.F. (1989). Higher order attribute grammars. (RUU-CS 89-04). Utrecht.
|
Kuiper, M.F. & Swierstra, S.D. (1986). Using attribute grammars to derive efficient functional programs. (RUU-CS 86-16). Utrecht.
|
Raaf, A.J., Dijkstra, A. & Swierstra, S.D. (1985). A LAN with real-time facilities based on OSI concepts. (RUU-CS 85-19). Utrecht.
|
webmaster@cs.uu.nl,
Thu, 20 Jun 2013 06:58:09 +0200
←
Departement Informatica, Universiteit Utrecht