Items where Author, Editor or other role is "Kahrs, Stefan"

Group by: Creator's name | Item Type | Date | No Grouping

Jump to: K | S

Number of items: 27.

K

Kahrs, Stefan, Runciman, Colin (2022) Simplifying Regular Expressions Further. Journal of Symbolic Computation, 109 . pp. 124-143. ISSN 0747-7171. (doi:10.1016/j.jsc.2021.08.003) (KAR id:91292)

Kahrs, Stefan (2013) Infinitary rewriting: closure operators, equivalences and models. Acta Informatica, 50 (2). pp. 123-156. ISSN 0001-5903. (doi: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) (KAR id:33337)

Kahrs, Stefan (2010) Infinitary Rewriting: Foundations Revisited. In: Lynch, Christopher, ed. Proceedings of the 21st International Conference on Rewriting Techniques and Applications. LIPIcs . Schloss Dagstuhl, Dagstuhl, Germany, pp. 182-196. ISBN 978-3-939897-18-7. (doi: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) (KAR id:30652)

Kahrs, Stefan (2010) Modularity of Convergence and Strong Convergence in Infinitary Rewriting. Logical Methods in Computer Science, 6 (3). pp. 182-196. (doi: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) (KAR id:30698)

Kahrs, Stefan (2009) Modularity of Convergence in Infinitary Rewriting. In: Treinen, Ralf, ed. Rewriting Techniques and Applications 20th International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 179-193. ISBN 978-3-642-02347-7. E-ISBN 978-3-642-02348-4. (doi:10.1007/978-3-642-02348-4_13) (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) (KAR id:24126)

Kahrs, Stefan (2007) Infinitary rewriting: meta-theory and convergence. Acta Informatica, 44 (2). pp. 91-121. ISSN 0001-5903. (doi:10.1007/s00236-007-0043-2) (KAR id:14587)

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) (KAR id:14457)

Kahrs, Stefan (2006) Genetic Programming with Primitive Recursion. In: Keijzer, Maarten, ed. Proceedings of the 8th annual conference on Genetic and evolutionary computation. ACM, New York, USA, pp. 941-942. ISBN 1-59593-186-4. (doi: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) (KAR id:14460)

Kahrs, Stefan (2003) Well-Going Programs Can Be Typed. In: Hofmann, Martin, ed. Typed Lambda Calculi and Applications 6th International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 167-179. ISBN 978-3-540-40332-6. E-ISBN 978-3-540-44904-1. (doi:10.1007/3-540-44904-3_12) (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) (KAR id:13967)

Kahrs, Stefan (2001) Red-black trees with types. Journal of Functional Programming, 11 (4). pp. 425-432. (doi: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) (KAR id:13587)

Kahrs, Stefan and Sannella, Don (1998) Reflections on the design of a specification language. In: Astesiano, Egidio, ed. Fundamental Approaches to Software Engineering First International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 154-170. ISBN 978-3-540-64303-6. E-ISBN 978-3-540-69723-7. (doi: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) (KAR id:17391)

Kahrs, Stefan (1997) Lecture Notes on Formal Program Development. Technical report. University of Edinburgh (KAR id:21433)

Kahrs, Stefan, Sannella, Don, Tarlecki, Andrzej (1997) The semantics of Extended ML: A gentle introduction. Theoretical Computer Science, 173 (2). pp. 445-484. ISSN 0304-3975. (KAR id:21538)

Kahrs, Stefan (1996) Limits of ML-definability. In: UNSPECIFIED. (doi:10.1007/3-540-61756-6_74) (KAR id:21337)

Kahrs, Stefan (1996) About the completeness of type systems. In: UNSPECIFIED. (KAR id:21352)

Kahrs, Stefan (1995) The variable containment problem. In: Dowek, Gilles and Heering, Jan and Meinke, Karl and Möller, Bernhard, eds. Higher-Order Algebra, Logic, and Term Rewriting Second International Workshop. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 109-123. ISBN 978-3-540-61254-4. E-ISBN 978-3-540-68389-6. (doi:10.1007/3-540-61254-8_22) (KAR id:21244)

Kahrs, Stefan (1995) Confluence of Curried Term-Rewriting Systems. Journal of Symbolic Computation, 19 . pp. 601-623. (KAR id:21251)

Kahrs, Stefan (1995) Towards a domain theory for termination proofs. In: Hsiang, Jieh, ed. Rewriting Techniques and Applications 6th International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 241-255. ISBN 978-3-540-59200-6. E-ISBN 978-3-540-49223-8. (doi:10.1007/3-540-59200-8_60) (KAR id:21266)

Kahrs, Stefan (1994) First-class polymorphism for ML. In: Sannella, Don, ed. Programming Languages and Systems — ESOP '94 5th European Symposium on Programming. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 333-347. ISBN 978-3-540-57880-2. E-ISBN 978-3-540-48376-2. (doi:10.1007/3-540-57880-3_22) (KAR id:21199)

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) (KAR id:21213)

Kahrs, Stefan (1993) Compilation of combinatory reduction systems. In: Heering, Jan and Meinke, Karl and Möller, Bernhard and Nipkow, Tobias, eds. Higher-Order Algebra, Logic, and Term Rewriting: First International Workshop. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 169-188. ISBN 978-3-540-58233-5. E-ISBN 978-3-540-48579-7. (doi:10.1007/3-540-58233-9_9) (KAR id:21097)

Kahrs, Stefan (1993) Mistakes and Ambiguities in the definition of Standard ML. Technical report. University of Edinburgh (KAR id:21122)

Kahrs, Stefan (1992) Polymorphic Type Checking by Interpretation of Code. Technical report. (KAR id:21028)

Kahrs, Stefan (1992) Unlimp -- uniqueness as a leitmotiv for implementation. In: Bruynooghe, Maurice and Wirsing, Martin, eds. Programming Language Implementation and Logic Programming 4th International Symposium. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 115-129. ISBN 978-3-540-55844-6. E-ISBN 978-3-540-47297-1. (doi:10.1007/3-540-55844-6_131) (KAR id:21036)

S

Smith, Connor Lane (2017) Optimal Sharing Graphs for Substructural Higher-order Rewriting Systems. Doctor of Philosophy (PhD) thesis, University of Kent,. (KAR id:63884)

Smith, Connor Lane, 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. 22:1-22:17. Schloss Dagstuhl: Leibniz-Zentrum für Informatik, Porto, Portugal ISBN 978-3-95977-010-1. (doi:10.4230/LIPIcs.FSCD.2016.22) (KAR id:55349)

Sannella, Don, Tarlecki, Andrzej, Kahrs, Stefan (1994) Interfaces and Extended ML. SIGPLAN Notices, 29 (8). pp. 111-118. (doi:10.1145/185084.185113) (KAR id:21170)

This list was generated on Fri Nov 22 20:24:40 2024 GMT.