School of Computing

Publications by Dr Stefan Kahrs

Also view these in the Kent Academic Repository

Kahrs, S. (2013). Infinitary rewriting: closure operators, equivalences and models. Acta Informatica [Online] 50:123-156. Available at:
Kahrs, S. (2010). Modularity of Convergence and Strong Convergence in Infinitary Rewriting. Logical Methods in Computer Science [Online] 6:182-196. Available at:
Kahrs, S. (2007). Infinitary rewriting: meta-theory and convergence. Acta Informatica [Online] 44:91-121. Available at:
Kahrs, S. (2001). Red-black trees with types. Journal of Functional Programming [Online] 11:425-432. Available at:
Kahrs, S., Sannella, D. and Tarlecki, A. (1997). The semantics of Extended ML: A gentle introduction. Theoretical Computer Science 173:445-484.
Kahrs, S. (1995). Confluence of Curried Term-Rewriting Systems. Journal of Symbolic Computation 19:601-623.
Sannella, D., Tarlecki, A. and Kahrs, S. (1994). Interfaces and Extended ML. SIGPLAN Notices 29:111-118.
Kahrs, S. (1997). Lecture Notes on Formal Program Development. University of Edinburgh. Available at:
Kahrs, S., Sannella, D. and Tarlecki, A. (1994). The definition of Extended ML. University of Edinburgh.
Kahrs, S. (1993). Mistakes and Ambiguities in the definition of Standard ML. University of Edinburgh.
Kahrs, S. (1992). Polymorphic Type Checking by Interpretation of Code.
Conference or workshop item
Smith, C. and Kahrs, S. (2016). Non-omega-overlapping TRSs are UN. in: Formal Structures for Computation and Deduction. Porto, Portugal: Schloss Dagstuhl: Leibniz-Zentrum für Informatik, pp. 22:1-22:17. Available at:
Kahrs, S. (2010). Infinitary Rewriting: Foundations Revisited. in: Lynch, C. ed. Proceedings of the 21st International Conference on Rewriting Techniques and Applications. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, pp. 182-196. Available at:
Kahrs, S. (2009). Modularity of Convergence in Infinitary Rewriting. in: Treinen, R. ed. Rewriting Techniques and Applications. Springer, pp. 179-193.
Kahrs, S. (2006). Gene Expression Programming with Pre-Order Traversals. in: Sirlantzis, K. ed. 6th International Conference on Recent Advances in Soft Computing. pp. 84-89.
Kahrs, S. (2006). Genetic Programming with Primitive Recursion. in: Keijzer, M. ed. 2006 Genetic and Evolutionary Computation Conference. New York, New York (USA): ACM Press, pp. 941-942. Available at:
Kahrs, S. (2003). Well-Going Programs Can Be Typed. in: Hofmann, M. ed. Typed Lambda Calculi and Applications. Springer, pp. 167-179. Available at:
Kahrs, S. and Sannella, D. (1998). Reflections on the design of a specification language. in: Astesiano, E. ed. 1st International Conference on Fundamental Approaches to Software Engineering at the Joint European Conferences on Theory and Practice of Software. Springer-Verlag Berlin, pp. 154-170. Available at:
Kahrs, S. (1996). Limits of ML-definability. in: Springer, pp. 17-31.
Kahrs, S. (1996). About the completeness of type systems. in: de Rijke, M. ed.
Kahrs, S. (1995). Towards a domain theory for termination proofs. in: Hsiang, J. ed. Springer, pp. 241-255.
Kahrs, S. (1995). The variable containment problem. in: Dowek, G. et al. eds. Springer, pp. 109-123.
Kahrs, S. (1994). First-class polymorphism for ML. in: Sannella, D. ed. Springer, pp. 333-347.
Kahrs, S. (1993). Compilation of combinatory reduction systems. in: Heering, J. et al. eds. Springer, pp. 169-188.
Kahrs, S. (1992). Unlimp -- uniqueness as a leitmotiv for implementation. in: Bruynooghe, M. and Wirsing, M. eds. Springer, pp. 115-129.
Total publications in KAR: 25 [See all in KAR]

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 25/05/2018