BibSLEIGH — Manfred_Schmidt-Schauss

Travelled to:

1 × Brazil
1 × Canada
1 × Croatia
1 × Denmark
1 × The Netherlands
2 × Austria
2 × Germany
2 × Italy
3 × Japan
4 × France
6 × United Kingdom
8 × USA

Collaborated with:

D.Sabel ∅ K.U.Schulz A.Gascón E.Machkasova J.Levy M.Villaret S.E.Panitz A.Tiwari C.Rau G.Godoy A.Kutzner M.Lohrey S.Maneth M.Schütz A.Boudet J.Jouannaud H.Bürckert A.Herold Nils Dallmeyer

Talks about:

unif (14) context (8) calculus (6) program (5) order (5) call (5) languag (4) concurr (4) equat (4) decid (4)

Person: Manfred Schmidt-Schauß

DBLP: Schmidt-Schau=szlig=:Manfred

Facilitated 1 volumes:

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2004

2003

2002

2001

1999

1998

1997

1996

1995

1989

1988

1987

1986

2016

2018

Wrote 37 papers:

CSL-2015-GasconST #polynomial #strict #unification: Two-Restricted One Context Unification is in Polynomial Time (AG, MSS, AT), pp. 405–422.
LICS-2015-GasconTS #polynomial #problem #unification: One Context Unification Problems Solvable in Polynomial Time (AG, AT, MSS), pp. 499–510.
PPDP-2015-Schmidt-Schauss #call-by #functional #semantics: Improvements in a functional core language with call-by-need operational semantics (MSS, DS), pp. 220–231.
RTA-TLCA-2014-Schmidt-Schauss #analysis #concurrent #programming language #semantics: Concurrent Programming Languages and Methods for Semantic Analyses (MSS), pp. 21–30.
RTA-TLCA-2014-Schmidt-SchaussS #call-by #λ-calculus: Applicative May- and Should-Simulation in the Call-by-Value λ Calculus with AMB (MSS, DS), pp. 379–394.
ICFP-2013-Schmidt-SchaussS #correctness #haskell #implementation: Correctness of an STM Haskell implementation (MSS, DS), pp. 161–172.
RTA-2013-Schmidt-SchaussMS #lazy evaluation #λ-calculus: Extending Abramsky’s Lazy λ Calculus: (Non)-Conservativity of Embeddings (MSS, EM, DS), pp. 239–254.
RTA-2013-Schmidt-SchaussRS #algorithm #complexity: Algorithms for Extended α-Equivalence and Complexity (MSS, CR, DS), pp. 255–270.
IJCAR-2012-RauSS #correctness #problem #program transformation #termination: Correctness of Program Transformations as a Termination Problem (CR, DS, MSS), pp. 462–476.
LICS-2012-SabelS #concurrent #haskell: Conservative Concurrency in Haskell (DS, MSS), pp. 561–570.
RTA-2012-Schmidt-Schauss: Matching of Compressed Patterns with Character-Variables (MSS), pp. 272–287.
PPDP-2011-SabelS #concurrent #haskell #semantics: A contextual semantics for concurrent Haskell with futures (DS, MSS), pp. 101–112.
RTA-2010-Schmidt-SchaussSM #call-by #simulation #λ-calculus: Simulation in the Call-by-Need λ-Calculus with letrec (MSS, DS, EM), pp. 295–310.
FoSSaCS-2009-LohreyMS #parametricity #reduction: Parameter Reduction in Grammar-Compressed Trees (ML, SM, MSS), pp. 212–226.
RTA-2009-GasconGS #unification: Unification with Singleton Tree Grammars (AG, GG, MSS), pp. 365–379.
LICS-2008-GasconGS: Context Matching for Compressed Terms (AG, GG, MSS), pp. 93–102.
RTA-2008-Schmidt-SchaussM #call-by #finite #nondeterminism #simulation #λ-calculus: A Finite Simulation Method in a Non-deterministic Call-by-Need λ-Calculus with Letrec, Constructors, and Case (MSS, EM), pp. 321–335.
RTA-2007-Schmidt-Schauss #calculus #correctness: Correctness of Copy in Calculi with Letrec (MSS), pp. 329–343.
IJCAR-2006-LevySV #unification: Stratified Context Unification Is NP-Complete (JL, MSS, MV), pp. 82–96.
RTA-2006-LevySV #bound #higher-order #unification: Bounded Second-Order Unification Is NP-Complete (JL, MSS, MV), pp. 400–414.
RTA-2004-LevySV #higher-order #monad #unification: Monadic Second-Order Unification Is NP-Complete (JL, MSS, MV), pp. 55–69.
CADE-2003-Schmidt-Schauss #bound #decidability #higher-order: Decidability of Arity-Bounded Higher-Order Matching (MSS), pp. 488–502.
CSL-2002-Schmidt-SchaussS #bound #decidability #higher-order #unification: Decidability of Bounded Higher-Order Unification (MSS, KUS), pp. 522–536.
CSL-2001-Schmidt-Schauss #unification: Stratified Context Unification Is in PSPACE (MSS), pp. 498–512.
CADE-1999-Schmidt-SchaussS #decidability #equation: Solvability of Context Equations with Two Context Variables is Decidable (MSS, KUS), pp. 67–81.
ICFP-1998-KutznerS #call-by #nondeterminism #λ-calculus: A Non-Deterministic Call-by-Need λ Calculus (AK, MSS), pp. 324–335.
RTA-1998-Schmidt-SchaussS #equation #on the: On the Exponent of Periodicity of Minimal Solutions of Context Equation (MSS, KUS), pp. 61–75.
SAS-1997-PanitzS #automation #functional #higher-order #named #proving #source code #strict #termination: TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language (SEP, MSS), pp. 345–360.
RTA-1996-Schmidt-Schauss #algorithm #unification: An Algorithm for Distributive Unification (MSS), pp. 287–301.
SAS-1995-Schmidt-SchausPS #calculus #reduction #using: Abstract Reduction Using a Tableau Calculus (MSS, SEP, MS), pp. 348–365.
KR-1989-Schmidt-Schauss #decidability: Subsumption in KL-ONE is Undecidable (MSS), pp. 421–431.
CADE-1988-Schmidt-Schauss #equation #unification: Unification in a Combination of Arbitrary Disjoint Equational Theories (MSS), pp. 378–396.
LICS-1988-BoudetJS #unification: Unification in Free Extensions of Boolean Rings and Abelian Groups (AB, JPJ, MSS), pp. 121–130.
RTA-1987-BurckertHS #decidability #equation #on the #unification: On Equational Theories, Unification and Decidability (HJB, AH, MSS), pp. 204–215.
CADE-1986-Schmidt-Schauss #unification: Unification in Many-Sorted Eqational Theories (MSS), pp. 538–552.
PPDP-2016-Schmidt-Schauss #recursion #unification: Unification of program expressions with recursive bindings (MSS, DS), pp. 160–173.
PPDP-2018-Schmidt-Schauss #concurrent #functional #parallel #programming language: Sequential and Parallel Improvements in a Concurrent Functional Programming Language (MSS, DS, ND), p. 13.