• Contact
• Maps
• Departments

Navigation menu

School of Computing

• Home
• Research
• Teaching

Studying

• Becoming a postgraduate
• Becoming an undergraduate

Activities

• News
• National & International services
• Seminars
• Schools Liaison
• Outreach
• Kent IT Clinic
• Kent enterprise

Local users

• For current students and staff
• Systems Support

About us

• Contacts - How to find us
• People
  • Staff
  • Research Students
  • Undergraduate (local)
  • Taught Postgraduate (local)
  • Former Staff
  • Former Research Students
  • Student portal (univ)

Search

School of Computing

Publications by Dr Stefan Kahrs

Publication period   (8/1992 onwards)   -   ordered by publication type and date

Journal Papers

• Infinitary rewriting: meta-theory and convergence. Stefan Kahrs. Acta Informatica, 44(2):91-121, May 2007.
• Red-black trees with types. Stefan Kahrs. Journal of Functional Programming, 11(4):425-432, July 2001.
• The semantics of Extended ML: A gentle introduction. Stefan Kahrs, Don Sannella, and Andrzej Tarlecki. Theoretical Computer Science, 173(2):445-484, February 1997.
• Confluence of curried term-rewriting systems. Stefan Kahrs. Journal of Symbolic Computation, 19:601-623, August 1995.
• Interfaces and Extended ML. Don Sannella, Andrzej Tarlecki, and Stefan Kahrs. SIGPLAN Notices, 29(8):111-118, November 1994.

Conference Papers

• Infinitary rewriting: Foundations revisited. Stefan Kahrs. In Christopher Lynch, editor, Proceedings of the 21st International Conference on Rewriting Techniques and Applications, volume 6 of Leibniz International Proceedings in Informatics (LIPIcs), pages 161-176, Dagstuhl, Germany, July 2010. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
• Infinitary rewriting: Foundations revisited. Stefan Kahrs. In Christopher Lynch, editor, Proceedings of the 21st International Conference on Rewriting Techniques and Applications, volume 6 of Leibniz International Proceedings in Informatics (LIPIcs), pages 161-176, Dagstuhl, Germany, July 2010. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
• Modularity of convergence in infinitary rewriting. Stefan Kahrs. In Ralf Treinen, editor, Rewriting Techniques and Applications, volume 5595 of Lecture Notes in Computer Science, pages 179-193. Springer, June 2009.
• Modularity of convergence in infinitary rewriting. Stefan Kahrs. In Rewriting Techniques and Applications, page 15, June 2009. to appear.
• Genetic programming with primitive recursion. Stefan Kahrs. In Maarten Keijzer and et. al., editors, 8th annual conference on Genetic and evolutionary computation, volume 1, pages 941-942. ACM SIGEVO, ACM Press, July 2006.
• Well-going programs can be typed. Stefan Kahrs. In Martin Hofmann, editor, Typed Lambda Calculi and Applications, number 2701 in LNCS, pages 167-179. Springer, June 2003.
• Reflections on the design of a specification language. Stefan Kahrs and Donald Sannella. In Egidio Astesiano, editor, Fundamental Aspects of Software Engineering, volume 1382 of Lecture Notes in Computer Science, pages 154-170. Springer, April 1998.
• Limits of ML-definability. Stefan Kahrs. In Proceedings of PLILP'96, volume 1140 of Lecture Notes in Computer Science, pages 17-31. Springer, September 1996.
• About the completeness of type systems. Stefan Kahrs. In Maarten de Rijke, editor, Observational Equivalence and Logical Equivalence, page 17. ESSLLI, August 1996.
• The variable containment problem. Stefan Kahrs. In Gilles Dowek, Jan Heering, Karl Meinke, and Bernhard M"oller, editors, Higher-Order Algebra, Logic, and Term Rewriting, volume 1074 of Lecture Notes in Computer Science, pages 109-123. Springer, September 1995.
• Towards a domain theory for termination proofs. Stefan Kahrs. In Jieh Hsiang, editor, Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 241-255. Springer, April 1995.
• First-class polymorphism for ML. Stefan Kahrs. In Donald Sannella, editor, Programming Languages and Systems - ESOP'94, volume 788 of Lecture Notes in Computer Science, pages 333-347. Springer, April 1994.
• Compilation of combinatory reduction systems. Stefan Kahrs. In Jan Heering, Karl Meinke, Bernhard M"oller, and Tobias Nipkow, editors, Higher-Order Algebra, Logic, and Term Rewriting, volume 816 of Lecture Notes in Computer Science, pages 169-188. Springer, September 1993.
• Unlimp - uniqueness as a leitmotiv for implementation. Stefan Kahrs. In Maurice Bruynooghe and Martin Wirsing, editors, Programming Language Implementation and Logic Programming, volume 631 of Lecture Notes in Computer Science, pages 115-129. Springer, August 1992.

Miscellaneous

• Lecture notes on formal program development. Stefan Kahrs. LFCS Report ECS-LFCS-97-372, University of Edinburgh, November 1997.
• The definition of Extended ML. Stefan Kahrs, Don Sannella, and Andrzej Tarlecki. LFCS Report ECS-LFCS-94-300, University of Edinburgh, January 1994.
• Mistakes and ambiguities in the definition of Standard ML. Stefan Kahrs. LFCS Report ECS-LFCS-93-257, University of Edinburgh, April 1993. An update listing further errors can be found at t ftp://ftp.dcs.ed.ac.uk/pub/smk/SML/errors-new.ps.Z.
• Polymorphic type checking by interpretation of code. Stefan Kahrs. LFCS report ECS-LFCS-92-238, University of Edinburgh, Laboratory for Foundations of Computer Science, September 1992.