Zobrazeno 1 - 10
of 88
pro vyhledávání: '"Manfred Schmidt-Schauß"'
Autor:
Manfred Schmidt-Schauß, Nils Dallmeyer
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 289, Iss Proc. WPTE 2018, Pp 53-67 (2019)
This paper is a contribution to exploring and analyzing space-improvements in concurrent programming languages, in particular in the functional process-calculus CHF. Space-improvements are defined as a generalization of the corresponding notion in de
Externí odkaz:
https://doaj.org/article/b83c1ffbda1346d6ac174a16ca1bf6cb
Autor:
Manfred Schmidt-Schauß, Nils Dallmeyer
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 265, Iss Proc. WPTE 2017, Pp 98-112 (2018)
We explore space improvements in LRP, a polymorphically typed call-by-need functional core language. A relaxed space measure is chosen for the maximal size usage during an evaluation. It abstracts from the details of the implementation via abstract m
Externí odkaz:
https://doaj.org/article/f4150e4d654a4493a6311231bdc7bfa1
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 235, Iss Proc. WPTE 2016, Pp 78-92 (2017)
We present an implementation of an interpreter LRPi for the call-by-need calculus LRP, based on a variant of Sestoft's abstract machine Mark 1, extended with an eager garbage collector. It is used as a tool for exact space usage analyses as a support
Externí odkaz:
https://doaj.org/article/133f1d51ddec4e4f9d291a5e1af78b71
Autor:
Manfred Schmidt-Schauss
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 110, Iss Proc. TERMGRAPH 2013, Pp 29-40 (2013)
This paper is an extended abstract of an analysis of term rewriting where the terms in the rewrite rules as well as the term to be rewritten are compressed by a singleton tree grammar (STG). This form of compression is more general than node sharing
Externí odkaz:
https://doaj.org/article/f7686178a4dc4838a426cbcae8542083
Autor:
Manfred Schmidt-Schauß, Conrad Rau
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 42, Iss Proc. UNIF 2010, Pp 39-53 (2010)
Correctness of program transformations in extended lambda calculi with a contextual semantics is usually based on reasoning about the operational semantics which is a rewrite semantics. A successful approach to proving correctness is the combination
Externí odkaz:
https://doaj.org/article/c6d6784c8af6476a83af3758249ccc52
Publikováno v:
Logical Methods in Computer Science, Vol Volume 11, Issue 1 (2015)
This paper shows equivalence of several versions of applicative similarity and contextual approximation, and hence also of applicative bisimilarity and contextual equivalence, in LR, the deterministic call-by-need lambda calculus with letrec extended
Externí odkaz:
https://doaj.org/article/2e8144c38920478eb7c40724f35bc7e2
Publikováno v:
Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::adaaa502674571bab495d605eec7f457
https://doi.org/10.1145/3551357.3551374
https://doi.org/10.1145/3551357.3551374
Autor:
Manfred Schmidt-Schauß, David Sabel
Publikováno v:
EXPRESS/SOS
Comparison of concurrent programming languages and correctness of program transformations in concurrency are the focus of this research. As criterion we use contextual semantics adapted to concurrency, where may -- as well as should -- convergence ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c3245f0ba0c0db37aee7f7a6133a229
https://doi.org/10.4204/eptcs.322.8
https://doi.org/10.4204/eptcs.322.8
Autor:
Manfred Schmidt-Schauß, David Sabel
Publikováno v:
EXPRESS/SOS
In order to understand the relative expressive power of larger concurrent programming languages, we analyze translations of small process calculi which model the communication and synchronization of concurrent processes. The source language SYNCSIMPL
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12913a1fc6dcba2d98e3d91f6ad4db22
http://arxiv.org/abs/2108.11226
http://arxiv.org/abs/2108.11226
Publikováno v:
Journal of Symbolic Computation. 90:42-64
The problem of nominal unification where variables are allowed for atoms, and computing a complete set of unifiers is considered. The complexity is shown to be NP-complete, while for special cases there are polynomial time algorithms. The main result
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9923d66ed3ca3d113b88c32700b5b07a
https://doi.org/10.1016/j.jsc.2018.04.003
https://doi.org/10.1016/j.jsc.2018.04.003