Author

Manfred Schmidt

Professor f
Title
Cited by
Year
Nominal unification of higher order expressions with recursive let
M Schmidt-Schauß, T Kutsia, J Levy, M VillaretLogic-Based Program Synthesis and Transformation: 26th International …, 2017201
30
2017
Improvements in a functional core language with call-by-need operational semantics
M Schmidt-Schauß, D SabelProceedings of the 17th International Symposium on Principles and Practice …, 2015201
25
2015
Observational program calculi and the correctness of translations
M Schmidt-Schauß, D Sabel, J Niehren, J SchwinghammerTheoretical Computer Science 577, 98-124, 2015201
16
2015
Nominal unification with atom-variables
M Schmidt-Schauß, D Sabel, YDK KutzJournal of Symbolic Computation 90, 42-64, 2019201
13
2019
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
M Schmidt-Schauß, D Sabel, E MachkasovaLogical Methods in Computer Science , 2015201
11
2015
Unification of program expressions with recursive bindings
M Schmidt-Schauß, D SabelProceedings of the 18th International Symposium on Principles and Practice …, 2016201
11
2016
Contextual equivalences in call-by-need and call-by-name polymorphically typed calculi (preliminary report)
M Schmidt-Schauß, D SabelFirst International Workshop on Rewriting Techniques for Program …, 2014201
10
2014
Sharing-aware improvements in a call-by-need functional core language
M Schmidt-Schauß, D SabelProceedings of the 27th Symposium on the Implementation and Application of …, 2015201
10
2015
Correctness of an STM Haskell implementation
M Schmidt-Schauß, D SabelProceedings of the 18th ACM SIGPLAN International Conference on Functional …, 2013201
9
2013
Space improvements and equivalences in a functional core language
M Schmidt-Schauß, N DallmeyerarXiv preprint arXiv:1802.06498, 2018201
7
2018
Nominal unification with atom and context variables
M Schmidt-Schauß, D Sabel3rd International Conference on Formal Structures for Computation and …, 20187201
7
2018
An environment for analyzing space optimizations in call-by-need functional languages
N Dallmeyer, M Schmidt-SchaußarXiv preprint arXiv:1701.0040, 2017201
6
2017
Two-restricted one context unification is in polynomial time
A Gascón, M Schmidt-Schauß, A Tiwari24th EACSL Annual Conference on Computer Science Logic (CSL 2015), 2015201
6
2015
One context unification problems solvable in polynomial time
A Gascón, A Tiwari, MS Schaus2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 499-510, 2015201
6
2015
Sequential and parallel improvements in a concurrent functional programming language
M Schmidt-Schauß, D Sabel, N DallmeyerProceedings of the 20th International Symposium on Principles and Practice …, 2018201
6
2018
Improvements in a call-by-need functional core language: Common subexpression elimination and resource preserving translations
M Schmidt-Schauß, D SabelScience of Computer Programming 147, 3-26, 2017201
5
2017
Sharing decorations for improvements in a functional core language with call-by-need operational semantics
M Schmidt-Schauß, D SabelUniversitätsbibliothek Johann Christian Senckenberg, 2016201
4
2016
Rewriting with generalized nominal unification
Y Kutz, M Schmidt-SchaußMathematical Structures in Computer Science 30 (6), 710-735, 2020202
4
2020
Nominal unification and matching of higher order expressions with recursive let
M Schmidt-Schauß, T Kutsia, J Levy, M Villaret, Y KutzFundamenta Informaticae 185, 2022202
4
2022
Processing succinct matrices and vectors
M Lohrey, M Schmidt-SchaußTheory of Computing Systems 61, 22-51, 2017201
3
2017

Referred From: https://scholar.google.com/citations?hl=en&user=gKk8nIYAAAAJ

Cited by
Citations 5223
h-index 28
i10-index 68
Open Access Journals