The following pages link to Manfred Schmidt-Schauss (Q1110492):
Displayed 34 items.
- (Q3779785) (← links)
- (Q3786020) (← links)
- (Q3811748) (← links)
- (Q3838760) (← links)
- (Q4263157) (← links)
- (Q4282529) (← links)
- (Q4411845) (← links)
- Linear pattern matching of compressed terms and polynomial rewriting (Q4585011) (← links)
- (Q4723321) (← links)
- (Q4783328) (← links)
- A Decision Algorithm for Stratified Context Unification (Q4796458) (← links)
- (Q4993360) (← links)
- (Q5020947) (← links)
- An algorithm for distributive unification (Q5055867) (← links)
- Nominal Unification and Matching of Higher Order Expressions with Recursive Let (Q5075515) (← links)
- (Q5111911) (← links)
- Rewriting with generalized nominal unification (Q5139280) (← links)
- Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk) (Q5170804) (← links)
- Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB (Q5170830) (← links)
- Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq (Q5178823) (← links)
- A non-deterministic call-by-need lambda calculus (Q5234278) (← links)
- (Q5240138) (← links)
- (Q5240185) (← links)
- Correctness of an STM Haskell implementation (Q5244798) (← links)
- Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures (Q5262945) (← links)
- A non-deterministic call-by-need lambda calculus (Q5348907) (← links)
- (Q5351971) (← links)
- (Q5389151) (← links)
- Correctness of Copy in Calculi with Letrec (Q5432349) (← links)
- Deciding inclusion of set constants over infinite non-strict data structures (Q5441550) (← links)
- Mechanizing Mathematical Reasoning (Q5717438) (← links)
- Automated Deduction – CADE-19 (Q5900735) (← links)
- Rewriting Techniques and Applications (Q5901562) (← links)
- Program equivalence in a typed probabilistic call-by-need functional language (Q6052951) (← links)