default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Sabel
Person information
- affiliation: Goethe University, Institute of Computer Science, Frankfurt am Main, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Manfred Schmidt-Schauß
, David Sabel:
Program equivalence in a typed probabilistic call-by-need functional language. J. Log. Algebraic Methods Program. 135: 100904 (2023)- 2022
- [c30]David Sabel, Manfred Schmidt-Schauß, Luca Maio:
Contextual Equivalence in a Probabilistic Call-by-Need Lambda-Calculus. PPDP 2022: 4:1-4:15 - [i3]David Sabel, Manfred Schmidt-Schauß, Luca Maio:
A Probabilistic Call-by-Need Lambda-Calculus - Extended Version. CoRR abs/2205.14916 (2022) - 2021
- [c29]Manfred Schmidt-Schauß, David Sabel:
Minimal Translations from Synchronous Communication to Synchronizing Locks. EXPRESS/SOS 2021: 59-75 - [i2]Michael Christian Fink Amores, David Sabel:
Complexity of Deciding Syntactic Equivalence up to Renaming for Term Rewriting Systems (Extended Version). CoRR abs/2106.13520 (2021) - [i1]Manfred Schmidt-Schauß, David Sabel:
Minimal Translations from Synchronous Communication to Synchronizing Locks (Extended Version). CoRR abs/2107.14651 (2021) - 2020
- [c28]Manfred Schmidt-Schauß, David Sabel:
Correctly Implementing Synchronous Message Passing in the Pi-Calculus By Concurrent Haskell's MVars. EXPRESS/SOS 2020: 88-105
2010 – 2019
- 2019
- [j12]Manfred Schmidt-Schauß, David Sabel, Yunus D. K. Kutz:
Nominal unification with atom-variables. J. Symb. Comput. 90: 42-64 (2019) - [e5]Joachim Niehren, David Sabel:
Proceedings Fifth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@FSCD 2018, Oxford, England, 8th July 2018. EPTCS 289, 2019 [contents] - 2018
- [c27]Manfred Schmidt-Schauß, David Sabel, Nils Dallmeyer:
Sequential and Parallel Improvements in a Concurrent Functional Programming Language. PPDP 2018: 20:1-20:13 - [c26]Manfred Schmidt-Schauß, David Sabel:
Nominal Unification with Atom and Context Variables. FSCD 2018: 28:1-28:20 - [c25]David Sabel:
Automating the Diagram Method to Prove Correctness of Program Transformations. WPTE@FSCD 2018: 17-33 - [e4]David Sabel, Peter Thiemann:
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, PPDP 2018, Frankfurt am Main, Germany, September 03-05, 2018. ACM 2018 [contents] - [e3]Horatiu Cirstea, David Sabel:
Proceedings Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@FSCD 2017, Oxford, UK, 8th September 2017. EPTCS 265, 2018 [contents] - 2017
- [j11]David Sabel, Hans Zantema:
Termination of Cycle Rewriting by Transformation and Matrix Interpretation. Log. Methods Comput. Sci. 13(1) (2017) - [j10]Manfred Schmidt-Schauß, David Sabel:
Improvements in a call-by-need functional core language: Common subexpression elimination and resource preserving translations. Sci. Comput. Program. 147: 3-26 (2017) - [c24]David Sabel:
Alpha-renaming of higher-order meta-expressions. PPDP 2017: 151-162 - 2016
- [c23]Manfred Schmidt-Schauß, David Sabel:
Unification of program expressions with recursive bindings. PPDP 2016: 160-173 - [c22]David Sabel, Manfred Schmidt-Schauß:
A Call-by-Need Lambda Calculus with Scoped Work Decorations. Software Engineering (Workshops) 2016: 70-90 - 2015
- [j9]Manfred Schmidt-Schauß, David Sabel, Elena Machkasova:
Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq. Log. Methods Comput. Sci. 11(1) (2015) - [j8]Manfred Schmidt-Schauß, David Sabel, Joachim Niehren, Jan Schwinghammer:
Observational program calculi and the correctness of translations. Theor. Comput. Sci. 577: 98-124 (2015) - [c21]Manfred Schmidt-Schauß, David Sabel:
Sharing-aware improvements in a call-by-need functional core language. IFL 2015: 6:1-6:12 - [c20]Manfred Schmidt-Schauß, David Sabel:
Improvements in a functional core language with call-by-need operational semantics. PPDP 2015: 220-231 - [c19]David Sabel, Manfred Schmidt-Schauß:
Observing Success in the Pi-Calculus. WPTE@RDP 2015: 31-46 - [c18]David Sabel, Hans Zantema:
Transforming Cycle Rewriting into String Rewriting. RTA 2015: 285-300 - [e2]Yuki Chiba, Santiago Escobar, Naoki Nishida, David Sabel, Manfred Schmidt-Schauß:
2nd International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@RDP 2015, July 2, 2015, Warsaw, Poland. OASIcs 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-94-1 [contents] - 2014
- [c17]David Sabel:
Structural Rewriting in the pi-Calculus. WPTE@RTA/TLCA 2014: 51-62 - [c16]Manfred Schmidt-Schauß, David Sabel:
Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report). WPTE@RTA/TLCA 2014: 63-74 - [c15]Manfred Schmidt-Schauß, David Sabel:
Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB. RTA-TLCA 2014: 379-394 - [c14]David Sabel:
A Haskell-Implementation of STM Haskell with Early Conflict Detection. Software Engineering (Workshops) 2014: 171-190 - [e1]Manfred Schmidt-Schauß, Masahiko Sakai, David Sabel, Yuki Chiba:
First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@RTA 2014, July 13, 2014, Vienna, Austria. OASIcs 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-70-5 [contents] - 2013
- [j7]David Sabel, Manfred Schmidt-Schauß:
A Two-Valued Logic for Properties of Strict Functional Programs Allowing Partial Functions. J. Autom. Reason. 50(4): 383-421 (2013) - [c13]Manfred Schmidt-Schauß, David Sabel:
Correctness of an STM Haskell implementation. ICFP 2013: 161-172 - [c12]Manfred Schmidt-Schauß, Elena Machkasova, David Sabel:
Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings. RTA 2013: 239-254 - [c11]Manfred Schmidt-Schauß, Conrad Rau, David Sabel:
Algorithms for Extended Alpha-Equivalence and Complexity. RTA 2013: 255-270 - [c10]Till Berger, David Sabel:
Parallelizing DPLL in Haskell. Software Engineering (Workshops) 2013: 27-42 - 2012
- [c9]Conrad Rau, David Sabel, Manfred Schmidt-Schauß:
Correctness of Program Transformations as a Termination Problem. IJCAR 2012: 462-476 - [c8]David Sabel, Manfred Schmidt-Schauß:
Conservative Concurrency in Haskell. LICS 2012: 561-570 - [c7]David Sabel:
An abstract machine for concurrent haskell with futures. Software Engineering (Workshops) 2012: 29-44 - 2011
- [j6]Manfred Schmidt-Schauß, David Sabel, Elena Machkasova:
Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec. Inf. Process. Lett. 111(14): 711-716 (2011) - [c6]Manfred Schmidt-Schauß, David Sabel, Altug Anis:
Congruence Closure of Compressed Terms in Polynomial Time. FroCoS 2011: 227-242 - [c5]David Sabel, Manfred Schmidt-Schauß:
A contextual semantics for concurrent Haskell with futures. PPDP 2011: 101-112 - 2010
- [j5]Manfred Schmidt-Schauß, David Sabel:
Closures of may-, should- and must-convergences for contextual equivalence. Inf. Process. Lett. 110(6): 232-235 (2010) - [j4]Manfred Schmidt-Schauß, David Sabel:
On generic context lemmas for higher-order calculi with sharing. Theor. Comput. Sci. 411(11-13): 1521-1541 (2010) - [c4]Manfred Schmidt-Schauß, David Sabel, Elena Machkasova:
Simulation in the Call-by-Need Lambda-Calculus with letrec. RTA 2010: 295-310
2000 – 2009
- 2009
- [c3]David Sabel, Manfred Schmidt-Schauß, Frederik Harwath:
Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi. GI Jahrestagung 2009: 2931-2945 - 2008
- [b1]David Sabel:
Semantics of a call-by-need lambda calculus with McCarthy's amb for programm equivalence. Goethe University Frankfurt am Main, Verlag Dr. Hut 2008, ISBN 978-3-89963-866-0, pp. I-XXX, 1-358 - [j3]Manfred Schmidt-Schauß, David Sabel, Marko Schütz:
Safety of Nöcker's strictness analysis. J. Funct. Program. 18(4): 503-551 (2008) - [j2]David Sabel, Manfred Schmidt-Schauß:
A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations. Math. Struct. Comput. Sci. 18(3): 501-553 (2008) - [c2]Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer, David Sabel:
Adequacy of Compositional Translations for Observational Semantics. IFIP TCS 2008: 521-535 - [p1]David Sabel:
Semantik eines verzögert auswertenden Lambdakalküls mit McCarthy's amb für Programmäquivalenz [Semantics of a Call-by-Need Lambda Calculus with McCarthy's Amb for Program Equivalence]. Ausgezeichnete Informatikdissertationen 2008: 221-230 - 2007
- [j1]Manfred Schmidt-Schauß, David Sabel, Marko Schütz:
Deciding inclusion of set constants over infinite non-strict data structures. RAIRO Theor. Informatics Appl. 41(2): 225-241 (2007) - [c1]Joachim Niehren, David Sabel, Manfred Schmidt-Schauß, Jan Schwinghammer:
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures. MFPS 2007: 313-337
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 20:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
