OXFORD UNIVERSITY COMPUTING LABORATORY

Programming Tools Group

Publications

Refereed Publications | Technical Reports and Dissertations | Drafts and Memos | Talks


Refereed Publications

Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen. Incremental Execution of Transformation Specifications. Accepted for POPL '04. (Submitted version, revisions pending: postscript, PDF)

S. Drape, O. de Moor, G. Sittampalam. Transforming the .NET Intermediate Language Using Path Logic Programming. PPDP '02. (postscript, gzipped postscript, PDF, DVI)

K. Backhouse and R. Backhouse. Logical Relations and Galois Connections. To appear: Mathematics of Program Construction (MPC) 2002. (abstract, postscript, bibtex).

K. Backhouse. A Functional Semantics of Attribute Grammars. To appear: TACAS 2002. (abstract, PDF, postscript, bibtex).

E. Van Wyk, O. de Moor, K. Backhouse and P. Kwiatkowski. Forwarding in Attribute Grammars for Modular Language Design. To appear: Compiler Construction 2002. (abstract, PDF, postscript, bibtex).

D. Lacey, N. D. Jones, E. Van Wyk and C. C. Frederiksen. Proving Correctness of Compiler Optimizations by Temporal Logic Accepted for POPL 2002. (postscript , PDF ).

D. Lacey and O. de Moor. Imperative Program Transformation by Rewriting, In: R. Wilhelm, Compiler Construction '01, Springer Lecture Notes in Computer Science, 2001. (gzipped postscript)

G. Sittampalam and O. de Moor. Higher-order pattern matching for automatically applying fusion transformations. Second Symposium on Programs as Data Objects (PADO-II), LNCS 2053. (abstract, DVI, postscript, gzipped postscript)

C. Elliott, S. Finne and O. de Moor. Compiling Embedded Languages. In: W. Taha (ed), Procs of SAIG 2000 (Semantics, Applications and Implementation of Program Generation), Springer Lecture Notes in Computer Science. (abstract, PDF). A more detailed version of this paper has appeared as a technical report.

O. de Moor, K. Backhouse and S.D. Swierstra. First-class Attribute Grammars. Invited paper for WAGA'00, Ponte de Lima, Portugal, July 7, 2000. (abstract, workshop version (PDF), journal version (PS)). Also in: Informatica 24 (2000), pages 329-341. (The workshop and journal versions differ only in their formatting: the journal version is double-column.) There is some Haskell code to go with this paper.

O. de Moor and J. Gibbons. Pointwise relational programming. (invited paper) T. Rus (editor), Procs. of AMAST 2000, Springer Lecture Notes in Computer Science, Volume 1816, pages 371--390. (abstract, gzipped postscript, postscript, gzipped pdf)

E. Van Wyk. Meta Languages in Algebraic Compilers. Proceedings of AMAST 2000, Iowa City, Iowa, May 23-27 2000. To appear in LNCS. (postscript)

P. Hoogendijk and O. de Moor. Container types categorically. Journal of Functional Programming, Vol. 10(2), pages 191--225, 2000. 2000. (gzipped postscript)

E. Van Wyk. Domain Specific Meta Languages. In: Procs. ACM Symposium on Applied Computing 2000. (postscript, html)

B. A. Sufrin and O. de Moor. Modeless structure editing. In: A. W. Roscoe and J.C.P. Woodcock (editors), Proceedings of the Oxford-Microsoft symposium in Celebration of the work of Tony Hoare, September 13-15, 1999. (gzipped postscript)

O. de Moor and G. Sittampalam. Higher-order matching for program transformation. 2000. Accepted for publication, Theoretical Computer Science (abstract, gzipped postscript) Extended Abstract. In: Procs. FLOPS '99, Springer Lecture Notes in Computer Science, Vol. 1722, pages 209--224 (gzipped postscript)

O. de Moor. Dynamic Programming as a Software Component. Invited paper. In: Proceedings of CSCC, July 4-8, Athens, 1999. (PDF file)

J. Gibbons and O. de Moor. Bridging the algorithm gap: a linear-time functional program for paragraph formatting. 1999. (gzipped postscript) [to appear in SCP]

O. de Moor, S. Peyton-Jones and E. Van Wyk. Aspect-oriented compilers. In: Procs. First International Symposium on Generative and Component-Based Software Engineering. To appear in LNCS. (abstract, postscript)

O. de Moor and G. Sittampalam. Generic Program Transformation. In: Procs. 3rd International Summer School on Advanced Functional Programming, Springer Verlag 1998. (gzipped postscript, postscript, DVI, BibTeX)

Technical Reports and Dissertations

Y. Hünke, Semantics and Type Checking of Dependently-Typed Lazy Functional Programs. D.Phil. Thesis, 2004 (ps.gz)

I. Sanabria-Piretti, Data Refinement by Rewriting. D.Phil. thesis, submitted in December 2001, corrected version February 2002: (pdf, postscript, postscript doublesided, postscript compressed layout)

Ganesh Sittampalam, Higher-order matching for program transformation. D.Phil. thesis, submitted June 2001, corrected November 2001: (gzipped postscript, DVI, postscript, PDF)

Eric Van Wyk, Oege de Moor, Ganesh Sittampalam, Ivan Sanabria-Piretti, Kevin Backhouse and Paul Kwiatkowski. "Intentional programming: a host of language features", (a draft version postscript, PDF). It will become Oxford University Computing Laboratory Technical Report PRG-RR-01-15.

Yorck Hünke Programming with dependent types Undergraduate dissertation, May 2000. (gzipped postscript)

C. Elliott, S. Finne and O. de Moor. Compiling Embedded Languages. PDF file Technical report MSR-TR-00-52, Microsoft Research, 2000. An abridged version of this paper has appeared in the proceedings of SAIG 2000.

C. Elliott, O. de Moor and S. Finne. Efficient image manipulation through run-time compilation. Technical report MSR-TR-99-82, Microsoft Research, 1999. (gzipped word document)

K. Backhouse. Domain Specific Language Extensions. Qualifying Dissertation. (PDF file)

I. Sanabria-Piretti. Data Refinement in Intentional Programming. Qualifying Dissertation, July 1999. (PDF file)

Drafts and Memos

O. de Moor. Chip-chop theory Technical note. (postscript)

Y. Hünke, O. de Moor. Aiding Dependent Type Checking with Rewrite Rules Submitted to Journal of Functional Programming, Special Issue on Dependent Type Theory Meets Programming Practice. (gzipped postscript)

O. de Moor, D. Lacey and E. Van Wyk. Universal regular path queries, 2001. Submitted to HOSC (special issue dedicated to Bob Paige) (gzipped postscript)

Eric Van Wyk. Specification languages in algebraic compilers Submitted to Theoretical Computer Science, special issue for AMAST 2000 papers. (postscript).

O. de Moor and J. P. Secher. Common subexpression elimination of conditional expressions, 2001. Submitted to TOPLAS (short communication), (gzipped postscript)

K. Backhouse and B. Sufrin. Intentions on WordPad. July 1999. (PDF file)

O. de Moor, G. Sittampalam and B. Sufrin. A Matcher Generator. 1999. (memo ascii file)

(21 Dec 1999) O. de Moor. Pointwise relational program derivation. 1999. (now superseded by the AMAST paper above) (gzipped postscript)

K. Backhouse, I. Sanabria-Piretti and G. Sittampalam. Using the R5 reduction engine. April '99. (Zipped Word Document)

O. de Moor. First-class attribute grammars. 1999. (now superseded by the WAGA paper above) (gzipped postscript)

E. Van Wyk publications on TICS

Talks

Oege de Moor. Incremental Program Analysis . Departmental seminar, Chalmers University, Gothenburg, Sweden. (powerpoint)

Oege de Moor. Path Logic Programming . Christmas seminar, Midlands Graduate School in the Foundations of Computer Science. (pdf)

Oege de Moor. Intentional programming. Slides from an invited talk recently given for the British Computer Society. (zipped word document) (gzipped pdf)

Kevin Backhouse. Fixing Program Analysis Problems. The abstract of a talk given at the PRG student conference in December 2000.

Iván Sanabria-Piretti. Transforming Abstract Data Types by Rewriting. The abstract of a talk given at the PRG student conference in December 2000.

Ganesh Sittampalam. Annotating programs for efficiency. The abstract of a talk given at the PRG student conference in December 2000.

Eric Van Wyk. Program analysis and transformation via model checking. Slides from an invited talk given in November 2000 at DIKU. (PDF)

K. Backhouse. Capturing the Intent of the Microsoft Foundation Classes. Departmental Presentation. (self-extracting PowerPoint presentation)

Ganesh Sittampalam. MAG: A tool for transforming Haskell programs. The abstract of a talk given at the Sun PRG student conference in December 1998.

Oege de Moor. First-class attribute grammars. Slides from invited lecture at WAGA 2000. gzipped powerpoint.

Oege de Moor. A Language of Images. Slides from a departmental seminar, March 2000. gzipped powerpoint.

Oege de Moor. Programs for paradigms. Slides from a talk at the Shonan Village workshop on program transformation. gzipped powerpoint.

Oege de Moor. Pointwise relational programming. Slides from an invited talk at AMAST 2000. gzipped powerpoint.

Oege de Moor. Common subexpression elimination of conditionals. Departmental seminar, 2000. gzipped powerpoint.

Oege de Moor. A functional spreadsheet. Internal seminar, 2000. gzipped powerpoint.

Oege de Moor. Generic program transformation. Lectures at the 3rd summerschool on Advanced Functional Programming, 1998. gzipped powerpoint.


[Oxford Spires]



Oxford University Computing Laboratory Courses Research People About us News