The following pages link to Takahito Aoto (Q1288177):
Displayed 36 items.
- Uniqueness of normal proofs in implicational intuitionistic logic (Q1288178) (← links)
- Parallel closure theorem for left-linear nominal rewriting systems (Q1687545) (← links)
- Confluence and commutation for nominal rewriting systems with atom-variables (Q2119102) (← links)
- A proof method for local sufficient completeness of term rewriting systems (Q2119990) (← links)
- Automated proofs of unique normal forms w.r.t. conversion for term rewriting systems (Q2180238) (← links)
- Commutative rational term rewriting (Q2232282) (← links)
- Nominal Confluence Tool (Q2817917) (← links)
- Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering (Q2849497) (← links)
- A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems (Q2881099) (← links)
- Rational Term Rewriting Revisited: Decidability and Confluence (Q2918980) (← links)
- Sound lemma generation for proving inductive validity of equations (Q3165943) (← links)
- Confluence Competition 2015 (Q3454083) (← links)
- Dealing with Non-orientable Equations in Rewriting Induction (Q3527298) (← links)
- RAPT: A Program Transformation System Based on Term Rewriting (Q3527300) (← links)
- Proving Confluence of Term Rewriting Systems Automatically (Q3636821) (← links)
- Argument Filterings and Usable Rules for Simply Typed Dependency Pairs (Q3655195) (← links)
- (Q4217941) (← links)
- (Q4315299) (← links)
- (Q4364373) (← links)
- (Q4413064) (← links)
- (Q4447246) (← links)
- (Q4520528) (← links)
- On the Finite Model Property of Intuitionistic Modal Logics over MIPC (Q4704648) (← links)
- Termination of Rule-Based Calculi for Uniform Semi-Unification (Q4910441) (← links)
- (Q4993364) (← links)
- Improving rewriting induction approach for proving ground confluence (Q5111302) (← links)
- Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams (Q5170807) (← links)
- Confluence of orthogonal nominal rewriting systems revisited (Q5277887) (← links)
- Ground Confluence Prover based on Rewriting Induction (Q5369498) (← links)
- A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems (Q5389075) (← links)
- Natural inductive theorems for higher-order Rewriting (Q5389076) (← links)
- Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling. (Q5389131) (← links)
- Term Rewriting and Applications (Q5703843) (← links)
- Correctness of Context-Moving Transformations for Term Rewriting Systems (Q5743602) (← links)
- Rewriting Techniques and Applications (Q5901573) (← links)
- (Q6187069) (← links)