| Safety of Nöcker's strictness analysis M Schmidt-Schauß, D Sabel, M Schütz Journal of Functional Programming 18 (4), 503-551, 2008 | 67 | 2008 |
| A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations D Sabel, M Schmidt-Schauß Mathematical Structures in Computer Science 18 (3), 501-553, 2008 | 58 | 2008 |
| Observational semantics for a concurrent lambda calculus with reference cells and futures J Niehren, D Sabel, M Schmidt-Schauß, J Schwinghammer Electronic Notes in Theoretical Computer Science 173, 313-337, 2007 | 43 | 2007 |
| A contextual semantics for Concurrent Haskell with futures D Sabel, M Schmidt-Schauß Proceedings of the 13th international ACM SIGPLAN symposium on Principles …, 2011 | 42 | 2011 |
| On generic context lemmas for higher-order calculi with sharing M Schmidt-Schauß, D Sabel Theoretical computer science 411 (11-13), 1521-1541, 2010 | 34* | 2010 |
| Improvements in a functional core language with call-by-need operational semantics M Schmidt-Schauß, D Sabel Proceedings of the 17th International Symposium on Principles and Practice …, 2015 | 26* | 2015 |
| Conservative concurrency in Haskell D Sabel, M Schmidt-Schauß 2012 27th Annual IEEE Symposium on Logic in Computer Science, 561-570, 2012 | 26 | 2012 |
| Adequacy of compositional translations for observational semantics M Schmidt-Schauß, J Niehren, J Schwinghammer, D Sabel Fifth Ifip International Conference On Theoretical Computer Science–Tcs 2008 …, 2008 | 23 | 2008 |
| Closures of may-, should-and must-convergences for contextual equivalence M Schmidt-Schauß, D Sabel Information Processing Letters 110 (6), 232-235, 2010 | 18 | 2010 |
| Simulation in the call-by-need lambda-calculus with letrec M Schmidt-Schauß, D Sabel, E Machkasova Proceedings of the 21st International Conference on Rewriting Techniques and …, 2010 | 18 | 2010 |
| Observational program calculi and the correctness of translations M Schmidt-Schauß, D Sabel, J Niehren, J Schwinghammer Theoretical Computer Science 577, 98-124, 2015 | 17 | 2015 |
| Algorithms for extended alpha-equivalence and complexity M Schmidt-Schauß, C Rau, D Sabel 24th International Conference on Rewriting Techniques and Applications (RTA …, 2013 | 16 | 2013 |
| Semantics of a call-by-need lambda calculus with McCarthy's amb for programm equivalence. D Sabel Verlag Dr. Hut, 2008 | 16 | 2008 |
| Nominal unification with atom-variables M Schmidt-Schauß, D Sabel, YDK Kutz Journal of Symbolic Computation 90, 42-64, 2019 | 13 | 2019 |
| Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq EM Manfred Schmidt-Schauss, David Sabel Logical Methods in Computer Science 11 (1), 2015 | 13 | 2015 |
| Einführung in die Methoden der künstlichen Intelligenz M Schmidt-Schauß, D Sabel Institut für Informatik, Goethe-Universität Frankfurt am Main, 2013 | 13 | 2013 |
| Correctness of program transformations as a termination problem C Rau, D Sabel, M Schmidt-Schauß International Joint Conference on Automated Reasoning, 462-476, 2012 | 13 | 2012 |
| Unification of program expressions with recursive bindings M Schmidt-Schauß, D Sabel Proceedings of the 18th International Symposium on Principles and Practice …, 2016 | 11 | 2016 |
| A complete proof of the safety of Nöcker's strictness analysis M Schmidt-Schauß, M Schütz, D Sabel Johann Wolfgang Goethe-Univ., Fachbereich Informatik und Mathematik, Inst …, 2005 | 11 | 2005 |
| Sharing-aware improvements in a call-by-need functional core language M Schmidt-Schauß, D Sabel Proceedings of the 27th Symposium on the Implementation and Application of …, 2015 | 10 | 2015 |
Manfred Schmidt-SchaußProfessor für Informatik, Goethe-University FrankfurtVerified email at ki.informatik.uni-frankfurt.de
