Browse by Person (creator, editor, contributor, etc.)
 | Up a level |
Number of items: 26.
2017
| Smith, Connor Lane (2017) Optimal Sharing Graphs for Substructural Higher-order Rewriting Systems. Doctor of Philosophy (PhD) thesis, University of Kent,. (Full text available) |
|
2016
| Smith, Connor and Kahrs, Stefan (2016) Non-omega-overlapping TRSs are UN. In: 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016). 2016 Formal Structures for Computation and Deduction. Leibniz International Proceedings in Informatics, 52. Schloss Dagstuhl: Leibniz-Zentrum für Informatik, Porto, Portugal 22:1-22:17. ISBN 978-3-95977-010-1. (doi:https://doi.org/10.4230/LIPIcs.FSCD.2016.22) (Full text available) |
|
2013
| Kahrs, Stefan (2013) Infinitary rewriting: closure operators, equivalences and models. Acta Informatica, 50 (2). pp. 123-156. ISSN 0001-5903. (doi:https://doi.org/10.1007/s00236-012-0174-y) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) |
2010
| Kahrs, Stefan (2010) Infinitary Rewriting: Foundations Revisited. In: Lynch, Christopher, ed. Proceedings of the 21st International Conference on Rewriting Techniques and Applications. Leibniz International Proceedings in Informatics (LIPIcs), 6. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany pp. 182-196. ISBN 978-3-939897-18-7. (doi:https://doi.org/10.4230/LIPIcs.RTA.2010.161) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) |
| Kahrs, Stefan (2010) Modularity of Convergence and Strong Convergence in Infinitary Rewriting. Logical Methods in Computer Science, 6 (3). pp. 182-196. (doi:https://doi.org/10.2168/LMCS-6(3:18)2010) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) |
2009
| Kahrs, Stefan (2009) Modularity of Convergence in Infinitary Rewriting. In: Treinen, Ralf, ed. Rewriting Techniques and Applications. Lecture Notes in Computer Science, 5595. Springer pp. 179-193. ISBN 978-3-642-02347-7. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) |
2007
| Kahrs, Stefan (2007) Infinitary rewriting: meta-theory and convergence. Acta Informatica, 44 (2). pp. 91-121. ISSN 0001-5903. (doi:https://doi.org/10.1007/s00236-007-0043-2) (Full text available) |
|
2006
| Kahrs, Stefan (2006) Gene Expression Programming with Pre-Order Traversals. In: Sirlantzis, Konstantinos, ed. Proceedings of the 6th International Conference on Recent Advances in Soft Computing. pp. 84-89. ISBN 1-902671-42-2. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) |
| Kahrs, Stefan (2006) Genetic Programming with Primitive Recursion. In: Keijzer, Maarten, ed. Proceedings of the 8th annual conference on Genetic and evolutionary computation. ACM Press, New York, New York (USA) pp. 941-942. ISBN 1-59593-186-4. (doi:https://doi.org/10.1145/1143997.1144160) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) |
2003
| Kahrs, Stefan (2003) Well-Going Programs Can Be Typed. In: Hofmann, Martin, ed. Typed Lambda Calculi and Applications Proceedings. LNCS, 2701 (2701). Springer pp. 167-179. ISBN 3-540-40332-9. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) |
2001
| Kahrs, Stefan (2001) Red-black trees with types. Journal of Functional Programming, 11 (4). pp. 425-432. (doi:https://doi.org/10.1017/S0956796801004026) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) |
1998
| Kahrs, Stefan and Sannella, Don (1998) Reflections on the design of a specification language. In: Astesiano, Egidio, ed. Fundamental Approaches to Software Engineering. Springer-Verlag Berlin pp. 154-170. ISBN 3-540-64303-6. (doi:https://doi.org/10.1007/BFb0053578) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) |
1997
| Kahrs, Stefan (1997) Lecture Notes on Formal Program Development. Technical report. University of Edinburgh (Full text available) |
|
| Kahrs, Stefan and Sannella, Don and Tarlecki, Andrzej (1997) The semantics of Extended ML: A gentle introduction. Theoretical Computer Science, 173 (2). pp. 445-484. ISSN 0304-3975. (Full text available) |
|
1996
| Kahrs, Stefan (1996) Limits of ML-definability. In: UNSPECIFIED. (Full text available) |
|
| Kahrs, Stefan (1996) About the completeness of type systems. In: UNSPECIFIED. (Full text available) |
|
1995
| Kahrs, Stefan (1995) The variable containment problem. In: UNSPECIFIED. (Full text available) |
|
| Kahrs, Stefan (1995) Confluence of Curried Term-Rewriting Systems. Journal of Symbolic Computation, 19 . pp. 601-623. (Full text available) |
|
| Kahrs, Stefan (1995) Towards a domain theory for termination proofs. In: UNSPECIFIED. (Full text available) |
|
1994
| Sannella, Don and Tarlecki, Andrzej and Kahrs, Stefan (1994) Interfaces and Extended ML. SIGPLAN Notices, 29 (8). pp. 111-118. (Full text available) |
|
| Kahrs, Stefan (1994) First-class polymorphism for ML. In: UNSPECIFIED. (Full text available) |
|
| Kahrs, Stefan and Sannella, Don and Tarlecki, Andrzej (1994) The definition of Extended ML. Technical report. University of Edinburgh (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided) |
![[img]](https://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
![[img]](https://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
1993
| Kahrs, Stefan (1993) Compilation of combinatory reduction systems. In: Heering, Jan and Meinke, Karl and Möller, Bernhard and Nipkow, Tobias, eds. Selected Papers from the First International Workshop on Higher-Order Algebra, Logic, and Term Rewriting. Lecture Notes in Computer Science, 816. Springer pp. 169-188. ISBN 3-540-58233-9. (Full text available) |
|
| Kahrs, Stefan (1993) Mistakes and Ambiguities in the definition of Standard ML. Technical report. University of Edinburgh (Full text available) |
|
1992
| Kahrs, Stefan (1992) Polymorphic Type Checking by Interpretation of Code. Technical report. (Full text available) |
|
| Kahrs, Stefan (1992) Unlimp -- uniqueness as a leitmotiv for implementation. In: UNSPECIFIED. (Full text available) |
|
