The following pages link to Manfred Schmidt-Schauss (Q1110492):
Displaying 50 items.
- (Q352945) (redirect page) (← links)
- A two-valued logic for properties of strict functional programs allowing partial functions (Q352946) (← links)
- Fast equality test for straight-line compressed strings (Q436321) (← links)
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Unification under associativity and idempotence is of type nullary (Q580999) (← links)
- Unification in Boolean rings and Abelian groups (Q582073) (← links)
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Modular termination of \(r\)-consistent and left-linear term rewriting systems (Q672714) (← links)
- Decidability of unification in the theory of one-sided distributivity and a multiplicative unit (Q674747) (← links)
- Attributive concept descriptions with complements (Q749235) (← links)
- On generic context lemmas for higher-order calculi with sharing (Q960863) (← links)
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi (Q964003) (← links)
- Closures of may-, should- and must-convergences for contextual equivalence (Q991760) (← links)
- Context unification with one context variable (Q1041589) (← links)
- Implication of clauses is undecidable (Q1110493) (← links)
- A decision algorithm for distributive unification (Q1275018) (← links)
- Decidability of behavioural equivalence in unary PCF (Q1285665) (← links)
- Solvability of context equations with two context variables is decidable (Q1599536) (← links)
- Nominal unification with atom-variables (Q1640638) (← links)
- The complexity of linear and stratified context matching problems (Q1764421) (← links)
- Computational aspects of an order-sorted logic with term declarations (Q1801289) (← links)
- Problem corner: The Lion and the Unicorn (Q1821566) (← links)
- On equational theories, unification, and (un)decidability (Q1825184) (← links)
- Unification in permutative equational theories is undecidable (Q1825190) (← links)
- Decidability of bounded second order unification (Q1887168) (← links)
- Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec (Q1944119) (← links)
- Nominal unification with letrec and environment-variables (Q2119105) (← links)
- A note on unification, subsumption and unification type (Q2185490) (← links)
- Observational program calculi and the correctness of translations (Q2339472) (← links)
- Nominal unification of higher order expressions with recursive let (Q2409747) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- On the complexity of Bounded Second-Order Unification and Stratified Context Unification (Q2889573) (← links)
- Correctness of Program Transformations as a Termination Problem (Q2908517) (← links)
- Unification and matching on compressed terms (Q2946645) (← links)
- Extending Abramsky's lazy lambda calculus: (non)-conservativity of embeddings (Q2958387) (← links)
- Algorithms for Extended Alpha-Equivalence and Complexity (Q2958388) (← links)
- Conservative Concurrency in Haskell (Q2986833) (← links)
- (Q3149792) (← links)
- Congruence Closure of Compressed Terms in Polynomial Time (Q3172897) (← links)
- (Q3388524) (← links)
- (Q3493318) (← links)
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations (Q3520145) (← links)
- Safety of Nöcker's strictness analysis (Q3520168) (← links)
- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case (Q3522027) (← links)
- Bounded Second-Order Unification Is NP-Complete (Q3527311) (← links)
- Stratified Context Unification Is NP-Complete (Q3613402) (← links)
- Parameter Reduction in Grammar-Compressed Trees (Q3617731) (← links)
- The Complexity of Monadic Second-Order Unification (Q3631904) (← links)
- Unification with Singleton Tree Grammars (Q3636835) (← links)
