David Sabel


Computer Scientist


Home Research Publications Talks Teaching Software
Other Databases
Find my publications at other databases: [ DBLP | ACM DL | Google Scholar ]
Publications
[1]
Manfred Schmidt-Schauß and David Sabel. Nominal unification with atom and context variables. Frank report 59, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, January 2018.
bib | PDF ]
[2]
Horatiu Cirstea and David Sabel, editors. Proceedings Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, volume 265 of EPTCS, 2018.
bib | DOI | http ]
[3]
Manfred Schmidt-Schauß, David Sabel, and Nils Dallmeyer. Improvements for concurrent haskell with futures. Frank report 58, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, December 2017.
bib | PDF ]
[4]
Manfred Schmidt-Schauß and David Sabel. Improvements in a call-by-need functional core language: Common subexpression elimination and resource preserving translations. Science of Computer Programming, 147:3--26, November 2017.
bib | DOI | PDF | http ]
[5]
David Sabel. Rewriting of higher-order meta-expressions with recursive bindings. Frankfurter Informatik-Berichte 2017-1, Goethe-University Frankfurt am Main, June 2017.
bib | http ]
[6]
David Sabel. Alpha-renaming of higher-order meta-expressions. Frankfurter Informatik-Berichte 2017-2, Goethe-University Frankfurt am Main, June 2017.
bib | http ]
[7]
David Sabel and Hans Zantema. Termination of cycle rewriting by transformation and matrix interpretation. Logical Methods in Computer Science, Volume 13, Issue 1, March 2017.
bib | DOI | http ]
[8]
David Sabel. Alpha-renaming of higher-order meta-expressions. In Brigitte Pientka and Wim Vanhoof, editors, Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, PPDP '17, pages 151--162, New York, NY, USA, 2017. ACM. ©ACM.
bib | DOI | PDF | http ]
[9]
Manfred Schmidt-Schauß, David Sabel, and Yunus Kutz. Nominal unification with atom-variables. J. Symbolic Comput., 2017. accepted for publication, to appear.
bib | PDF ]
[10]
Manfred Schmidt-Schauß and David Sabel. Unification of program expressions with recursive bindings. In James Cheney and Germán Vidal, editors, PPDP '16: Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, pages 160--173, New York, NY, USA, September 2016. ACM. ©ACM.
bib | DOI | slides (PPDP 2016) | post conference version PDF | PDF | http ]
[11]
Manfred Schmidt-Schauß and David Sabel. Improvements in a functional core language with call-by-need operational semantics. Frank report 55, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, August 2016.
bib | PDF | previous version (2.0) | previous version (1.0) ]
[12]
David Sabel and Manfred Schmidt-Schauß. A call-by-need lambda calculus with scoped work decorations. In Wolf Zimmermann, Lukas Alperowitz, Bernd Brügge, Jörn Fahsel, Andrea Herrmann, Anne Hoffmann, Andreas Krall, Dieter Landes, Horst Lichter, Dirk Riehle, Ina Schaefer, Constantin Scheuermann, Alexander Schlaefer, Sibylle Schupp, Andreas Seitz, Andreas Steffens, André Stollenwerk, and Rüdiger Weißbach, editors, Software Engineering Workshops 2016, volume 1559 of CEUR Workshop Proceedings, pages 70--90. CEUR-WS.org, February 2016. 9. Arbeitstagung Programmiersprachen (ATPS'16).
bib | PDF ]
[13]
Manfred Schmidt-Schauß and David Sabel. Sharing decorations for improvements in a functional core language with call-by-need operational semantics. Frank report 56, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, December 2015.
bib | PDF | previous version ]
[14]
Manfred Schmidt-Schauß and David Sabel. Sharing-aware improvements in a call-by-need functional core language. In Ralf Lämmel, editor, Proceedings of the 27th Symposium on the Implementation and Application of Functional Programming Languages, IFL '15, pages 6:1--6:12, New York, NY, USA, September 2015. ACM. ©ACM.
bib | DOI | PDF | http ]
[15]
David Sabel and Manfred Schmidt-Schauß. Observing Success in the Pi-Calculus. In Yuki Chiba, Santiago Escobar, Naoki Nishida, David Sabel, and Manfred Schmidt-Schauß, editors, 2nd International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2015), volume 46 of OpenAccess Series in Informatics (OASIcs), pages 31--46, Dagstuhl, Germany, July 2015. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
bib | DOI | slides (WPTE 2015) | http ]
[16]
Yuki Chiba, Santiago Escobar, Naoki Nishida, David Sabel, and Manfred Schmidt-Schauß, editors. 2nd International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE 2015, July 2, 2015, Warsaw, Poland, volume 46 of OASIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, July 2015.
bib | http ]
[17]
Manfred Schmidt-Schauß and David Sabel. Improvements in a functional core language with call-by-need operational semantics. In Moreno Falaschi and Elvira Albert, editors, PPDP '15: Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, Siena, Italy, July 14-16, 2015, pages 220--231. ACM, July 2015. ©ACM.
bib | DOI | PDF | http ]
[18]
David Sabel and Hans Zantema. Transforming Cycle Rewriting into String Rewriting. In Maribel Fernández, editor, 26th International Conference on Rewriting Techniques and Applications (RTA 2015), volume 36 of Leibniz International Proceedings in Informatics (LIPIcs), pages 285--300, Dagstuhl, Germany, June 2015. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
bib | DOI | PDF (extended version) | slides (RTA 2015) | http ]
[19]
Manfred Schmidt-Schauß, David Sabel, Joachim Niehren, and Jan Schwinghammer. Observational program calculi and the correctness of translations. Theoretical Computer Science, 577:98--124, 2015. ©Elsevier B.V.,.
bib | DOI | PDF | http ]
[20]
Manfred Schmidt-Schauß, David Sabel, and Elena Machkasova. Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq. Logical Methods in Computer Science, 11(1), 2015.
bib | DOI | PDF | http ]
[21]
David Sabel. Structural rewriting in the pi-calculus. In Manfred Schmidt-Schauß, Masahiko Sakai, David Sabel, and Yuki Chiba, editors, First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE 2014, July 13, 2014, Vienna, Austria, volume 40 of OASICS, pages 51--62. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, July 2014.
bib | DOI | slides (WPTE 2014) ]
[22]
Manfred Schmidt-Schauß and David Sabel. Contextual equivalences in call-by-need and call-by-name polymorphically typed calculi (preliminary report). In Manfred Schmidt-Schauß, Masahiko Sakai, David Sabel, and Yuki Chiba, editors, First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE 2014, July 13, 2014, Vienna, Austria, volume 40 of OASICS, pages 63--74. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, July 2014.
bib | DOI ]
[23]
Manfred Schmidt-Schauß, Masahiko Sakai, David Sabel, and Yuki Chiba, editors. First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE 2014, July 13, 2014, Vienna, Austria, volume 40 of OASICS. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, July 2014.
bib | http ]
[24]
Manfred Schmidt-Schauß and David Sabel. Applicative may- and should-simulation in the call-by-value lambda calculus with amb. In Gilles Dowek, editor, Rewriting and Typed Lambda Calculi - Joint International Conference, RTA-TLCA 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings, volume 8560 of Lecture Notes in Computer Science, pages 379--394. Springer, July 2014. ©Springer Verlag, The original publication is available at www.springerlink.com.
bib | DOI | slides (RTA/TLCA 2014) ]
[25]
Manfred Schmidt-Schauß and David Sabel. Applicative may- and should-simulation in the call-by-value lambda calculus with amb. Frank report 54, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, April 2014.
bib | PDF ]
[26]
David Sabel and Manfred Schmidt-Schauß. Contextual equivalence for the pi-calculus that can stop. Frank report 53, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, March 2014.
bib | PDF ]
[27]
David Sabel. A Haskell-implementation of STM Haskell with early conflict detection. In Klaus Schmid, Wolfgang Böhm, Andrea Herrmann, Anne Hoffmann, Dieter Landes, Thomas Ruhroth, Oliver Sander, Volker Stolz, Baltasar Trancón Widemann, and Rüdiger Weißbach, editors, Software Engineering Workshops 2014, volume 1129 of CEUR Workshop Proceedings, pages 171--190. CEUR-WS.org, February 2014. 7. Arbeitstagung Programmiersprachen (ATPS'14).
bib | PDF ]
[28]
Manfred Schmidt-Schauß and David Sabel. Correctness of an STM Haskell implementation. In Greg Morrisett and Tarmo Uustalu, editors, Proceedings of the 18th ACM SIGPLAN International Conference on Functional programming, ICFP '13, pages 161--172, New York, NY, USA, September 2013. ACM.
bib | DOI | slides (ICFP 2013) | PDF | http ]
[29]
Manfred Schmidt-Schauß, David Sabel, and Elena Machkasova. Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq. Frank report 49, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, August 2013.
bib | PDF | previous version ]
[30]
Manfred Schmidt-Schauß, Elena Machkasova, and David Sabel. Extending abramsky's lazy lambda calculus: (non)-conservativity of embeddings. Frank report 51, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, August 2013.
bib | PDF | previous version ]
[31]
David Sabel. Korrektheit von Programmen und Programmiersprachen -- Methoden, Analysen und Anwendungen. Kumulative Habilitationsschrift, J. W. Goethe-Universität Frankfurt, Fachbereich Informatik und Mathematik, June 2013.
bib | PDF ]
[32]
Manfred Schmidt-Schauß, Elena Machkasova, and David Sabel. Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings. In Femke van Raamsdonk, editor, 24th International Conference on Rewriting Techniques and Applications (RTA 2013), volume 21 of Leibniz International Proceedings in Informatics (LIPIcs), pages 239--254, Dagstuhl, Germany, June 2013. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
bib | DOI | PDF | http ]
[33]
Manfred Schmidt-Schauß, Conrad Rau, and David Sabel. Algorithms for Extended Alpha-Equivalence and Complexity. In Femke van Raamsdonk, editor, 24th International Conference on Rewriting Techniques and Applications (RTA 2013), volume 21 of Leibniz International Proceedings in Informatics (LIPIcs), pages 255--270, Dagstuhl, Germany, June 2013. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
bib | DOI | slides (RTA 2013) | PDF | http ]
[34]
Manfred Schmidt-Schauß, David Sabel, Joachim Niehren, and Jan Schwinghammer. Observational program calculi and the correctness of translations. Frank report 52, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, May 2013.
bib | PDF ]
[35]
Manfred Schmidt-Schauß and David Sabel. Correctness of an STM Haskell implementation. Frank report 50, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, March 2013.
bib | PDF | previous version (1.0) ]
[36]
Till Berger and David Sabel. Parallelizing DPLL in Haskell. In Stefan Wagner and Horst Lichter, editors, Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium), Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar - 1. März 2013 in Aachen, volume 215 of LNI, pages 27--42. GI, February 2013. ©Gesellschaft für Informatik e.V., (6. Arbeitstagung Programmiersprachen (ATPS'13)).
bib | PDF ]
[37]
David Sabel and Manfred Schmidt-Schauß. A two-valued logic for properties of strict functional programs allowing partial functions. Journal of Automated Reasoning, 50(4):383--421, 2013. ©Springer Verlag, The original publication is available at www.springerlink.com.
bib | DOI | PDF | http ]
[38]
David Sabel and Manfred Schmidt-Schauß. Conservative concurrency in Haskell. In Nachum Dershowitz, editor, Proceedings of the 27th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2012), 25-28 June 2012, Dubrovnik, Croatia, pages 561--570, June 2012. ©IEEE.
bib | slides (LICS 2012) | PDF ]
[39]
Conrad Rau, David Sabel, and Manfred Schmidt-Schauß. Correctness of program transformations as a termination problem. In Bernhard Gramlich, Dale Miller, and Uli Sattler, editors, Automated Reasoning -- Proceedings of the 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, 2012, volume 7364 of Lecture Notes in Computer Science, pages 462--476. Springer Berlin / Heidelberg, June 2012. ©Springer Verlag, The original publication is available at www.springerlink.com.
bib | PDF ]
[40]
David Sabel and Manfred Schmidt-Schauß. On conservativity of Concurrent Haskell. Frank report 47, Institut für Informatik, Goethe-Universität Frankfurt am Main, April 2012.
bib | PDF | previous version ]
[41]
David Sabel. An abstract machine for Concurrent Haskell with futures. Frank report 48, Institut für Informatik, Goethe-Universität Frankfurt am Main, February 2012.
bib | PDF ]
[42]
David Sabel. An abstract machine for Concurrent Haskell with futures. In Stefan Jähnichen, Bernhard Rumpe, and Holger Schlingloff, editors, Software Engineering 2012 Workshopband, Fachtagung des GI-Fachbereichs Softwaretechnik, 27. Februar - 2. März 2012 in Berlin, volume 199 of GI Edition - Lecture Notes in Informatics, pages 29--44, February 2012. ©Gesellschaft für Informatik e.V., (5. Arbeitstagung Programmiersprachen (ATPS'12)).
bib | slides (ATPS 2012) | PDF ]
[43]
Conrad Rau, David Sabel, and Manfred Schmidt-Schauß. Encoding induction in correctness proofs of program transformations as a termination problem. In Georg Moser, editor, 12th International Workshop on Termination, WST 2012, February 19-23, 2012, Obergurgl, Austria, pages 74--78, February 2012. Published online and open access by G. Moser, Institute of Computer Science, University of Innsbruck, Austria.
bib | Online Proceedings | PDF ]
[44]
Manfred Schmidt-Schauß, David Sabel, and Altug Anis. Congruence closure of compressed terms in polynomial time. In Cesare Tinelli and Viorica Sofronie-Stokkermans, editors, Frontiers of Combining Systems, volume 6989 of Lecture Notes in Computer Science, pages 227--242. Springer Berlin / Heidelberg, October 2011. ©Springer Verlag, The original publication is available at www.springerlink.com .
bib | PDF | http ]
[45]
Manfred Schmidt-Schauß, David Sabel, and Elena Machkasova. Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec. Information Processing Letters, 111(14):711--716, July 2011.
bib | DOI | http ]
[46]
David Sabel and Manfred Schmidt-Schauß. A contextual semantics for concurrent haskell with futures. In Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming, PPDP '11, pages 101--112, New York, NY, USA, July 2011. ACM. ©ACM, 2011.
bib | DOI | PDF | http ]
[47]
David Sabel and Manfred Schmidt-Schauß. A contextual semantics for Concurrent Haskell with futures. Frank report 44, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, March 2011.
bib | PDF ]
[48]
David Sabel and Manfred Schmidt-Schauß. Reconstruction of a logic for inductive proofs of properties of functional programs. Frank report 39, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, January 2011.
bib | PDF | previous version (3.0) | previous version (2.0) | previous version (1.0) ]
[49]
Manfred Schmidt-Schauß and David Sabel. A termination proof of reduction in a simply typed calculus with constructors. Frank report 42, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, October 2010.
bib | PDF ]
[50]
Manfred Schmidt-Schauß, David Sabel, and Elena Machkasova. Simulation in the call-by-need lambda-calculus with letrec. In Christopher Lynch, editor, Proceedings of the 21st International Conference on Rewriting Techniques and Applications, volume 6 of Leibniz International Proceedings in Informatics (LIPIcs), pages 295--310, Dagstuhl, Germany, July 2010. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
bib | DOI | PDF | http ]
[51]
Manfred Schmidt-Schauß, David Sabel, and Elena Machkasova. Simulation in the call-by-need lambda-calculus with letrec. Frank report 40, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, April 2010.
bib | PDF ]
[52]
Manfred Schmidt-Schauß and David Sabel. On generic context lemmas for higher-order calculi with sharing. Theoretical Computer Science, 411(11-13):1521 -- 1541, 2010.
bib | DOI | http ]
[53]
Manfred Schmidt-Schauß and David Sabel. Closures of may-, should- and must-convergences for contextual equivalence. Information Processing Letters, 110(6):232 -- 235, 2010.
bib | DOI | http ]
[54]
David Sabel, Manfred Schmidt-Schauß, and Frederik Harwath. Reasoning about contextual equivalence: From untyped to polymorphically typed calculi. In Stefan Fischer, Erik Maehle, and Rüdiger Reischuk, editors, INFORMATIK 2009, Im Focus das Leben, Beiträge der 39. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 28.9 - 2.10.2009 in Lübeck, volume 154 of GI Edition - Lecture Notes in Informatics, pages 369; 2931--45, October 2009. ©Gesellschaft für Informatik e.V., (4. Arbeitstagung Programmiersprachen (ATPS'09)).
bib | slides (ATPS 2009) | PDF | previous version ]
[55]
Manfred Schmidt-Schauß, Elena Machkasova, and David Sabel. Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec. Frank report 38, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, August 2009.
bib | PDF ]
[56]
Jan Schwinghammer, David Sabel, Manfred Schmidt-Schauß, and Joachim Niehren. Correctly translating concurrency primitives. In ML '09: Proceedings of the 2009 ACM SIGPLAN workshop on ML, pages 27--38, New York, NY, USA, August 2009. ACM. ©ACM.
bib | PDF | http ]
[57]
Jan Schwinghammer, David Sabel, Joachim Niehren, and Manfred Schmidt-Schauß. On correctness of buffer implementations in a concurrent lambda calculus with futures. Frank report 37, Institut für Informatik. Fachbereich Informatik und Mathematik. Goethe-Universität Frankfurt am Main, May 2009.
bib | PDF | previous version ]
[58]
Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer, and David Sabel. Adequacy of compositional translations for observational semantics. Frank report 33, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, February 2009.
bib | PDF | previous version (4.0) | previous version (3.0) | previous version (2.0) | previous version (1.0) ]
[59]
Manfred Schmidt-Schauß, David Sabel, and Frederik Harwath. Contextual equivalence in lambda-calculi extended with letrec and with a parametric polymorphic type system. Frank report 36, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, January 2009.
bib | PDF ]
[60]
David Sabel. Semantik eines verzögert auswertenden Lambdakalküls mit McCarthy's amb für Programmäquivalenz. In Dorothea Wagner et. al., editor, Ausgezeichnete Informatikdissertationen 2008, volume D-9 of GI-Edition Lecture Notes in Informatics (LNI) - Dissertations, pages 221--230, Bonn, Germany, 2009. Köllen Druck+Verlag. ©Gesellschaft für Informatik e.V.
bib | PDF ]
[61]
Manfred Schmidt-Schauß and David Sabel. Closures of may and must convergence for contextual equivalence. Frank report 35, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, December 2008.
bib | PDF ]
[62]
David Sabel. Semantics of a Call-by-Need Lambda Calculus with McCarthy's amb for Program Equivalence. Dissertation, J. W. Goethe-Universität Frankfurt, Institut für Informatik. Fachbereich Informatik und Mathematik, November 2008. ©Published by Verlag Dr. Hut with ISBN 978-3-89963-866-0.
bib | PDF ]
[63]
Jan Schwinghammer, David Sabel, Joachim Niehren, and Manfred Schmidt-Schauß. On proving the equivalence of concurrency primitives. Frank report 34, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, October 2008.
bib | PDF ]
[64]
Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer, and David Sabel. Adequacy of compositional translations for observational semantics. In Giorgio Ausiello, Juhani Karhumäki, Giancarlo Mauri, and C.-H. Luke Ong, editors, Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy, volume 273 of IFIP, pages 521--535. Springer, September 2008. ©Springer Verlag.
bib ]
[65]
Manfred Schmidt-Schauß, Marko Schütz, and David Sabel. Safety of Nöcker's strictness analysis. Journal of Functional Programming, 18(04):503--551, 2008. The original publication is available here, ©Cambridge University Press.
bib | DOI | appendix | PDF | http ]
[66]
David Sabel and Manfred Schmidt-Schauß. A call-by-need lambda-calculus with locally bottom-avoiding choice: Context lemma and correctness of transformations. Mathematical Structures in Computer Science, 18(03):501--553, 2008.
bib | http ]
[67]
Manfred Schmidt-Schauß and David Sabel. On generic context lemmas for lambda calculi with sharing. Frank report 27, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, August 2007.
bib | PDF | previous version (2.0) | previous version (1.0) ]
[68]
Manfred Schmidt-Schauß, David Sabel, and Marko Schütz. Deciding inclusion of set constants over infinite non-strict data structures. RAIRO-Theoretical Informatics and Applications, 41(2):225--241, July 2007. The original publication is available at: www.edpsciences.org/ita, © EDP Sciences 2007.
bib | PDF | http ]
[69]
Joachim Niehren, David Sabel, Manfred Schmidt-Schauß, and Jan Schwinghammer. Observational semantics for a concurrent lambda calculus with reference cells and futures. Electronic Notes in Theoretical Computer Science, 173:313--337, April 2007. ©Elsevier B.V.
bib | DOI | slides (MFPS XXIII) | http ]
[70]
Manfred Schmidt-Schauß and David Sabel. Program transformation for functional circuit descriptions. Frank report 30, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, February 2007.
bib | PDF ]
[71]
Joachim Niehren, David Sabel, Manfred Schmidt-Schauß, and Jan Schwinghammer. Program equivalence for a concurrent lambda calculus with futures. Frank report 26, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, October 2006.
bib | PDF ]
[72]
Manfred Schmidt-Schauß, David Sabel, and Marko Schütz. Deciding subset relationship of co-inductively defined set constants. Frank report 23, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, September 2006.
bib | PDF | previous version ]
[73]
David Sabel and Manfred Schmidt-Schauß. A call-by-need lambda-calculus with locally bottom-avoiding choice: Context lemma and correctness of transformations. Frank report 24, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, July 2006.
bib | PDF | previous version (2.0) | previous version (1.0) ]
[74]
Manfred Schmidt-Schauß, Marko Schütz, and David Sabel. A complete proof of the safety of Nöcker's strictness analysis. Frank report 20, Institut für Informatik. J.W.Goethe-Universität Frankfurt am Main, April 2005.
bib | PDF ]
[75]
Manfred Schmidt-Schauß, Marko Schütz, and David Sabel. On the safety of Nöcker's strictness analysis. Frank Report 19, Institut für Informatik, J.W. Goethe-Universität Frankfurt am Main, October 2004.
bib | PDF ]
[76]
David Sabel. Realising nondeterministic I/O in the Glasgow Haskell Compiler. Frank report 17, Institut für Informatik, J.W. Goethe-Universität Frankfurt am Main, December 2003.
bib | compressed PostScript | PostScript | PDF ]

This file was generated by bibtex2html 1.98.

© 2016 PD Dr. David Sabel, Imprint, Last modified: $Author: sabel $, $Date: 2018/02/21 18:54:57 $