Seguir
David Sabel
David Sabel
Afiliación desconocida
Dirección de correo verificada de online.de - Página principal
Título
Citado por
Citado por
Año
Safety of Nöcker's strictness analysis
M Schmidt-Schauß, D Sabel, M Schütz
Journal of Functional Programming 18 (4), 503-551, 2008
662008
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
562008
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
562008
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
432007
A contextual semantics for Concurrent Haskell with futures
D Sabel, M Schmidt-Schauß
Proceedings of the 13th international ACM SIGPLAN symposium on Principles …, 2011
412011
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
252012
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
232008
Observational program calculi and the correctness of translations
M Schmidt-Schauß, D Sabel, J Niehren, J Schwinghammer
Theoretical Computer Science 577, 98-124, 2015
172015
Closures of may-, should-and must-convergences for contextual equivalence
M Schmidt-Schauß, D Sabel
Information Processing Letters 110 (6), 232-235, 2010
172010
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
172010
Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence
D Sabel
Verlag Dr. Hut, 2008
152008
Algorithms for extended alpha-equivalence and complexity
M Schmidt-Schauß, C Rau, D Sabel
24th International Conference on Rewriting Techniques and Applications (RTA …, 2013
142013
Nominal unification with atom-variables
M Schmidt-Schauß, D Sabel, YDK Kutz
Journal of Symbolic Computation 90, 42-64, 2019
132019
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
132013
Correctness of program transformations as a termination problem
C Rau, D Sabel, M Schmidt-Schauß
International Joint Conference on Automated Reasoning, 462-476, 2012
132012
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
122015
Unification of program expressions with recursive bindings
M Schmidt-Schauß, D Sabel
Proceedings of the 18th International Symposium on Principles and Practice …, 2016
112016
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
112005
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20