BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Brazil
1 × France
1 × Germany
1 × Poland
1 × Portugal
1 × Serbia
1 × United Kingdom
2 × Austria
2 × Italy
2 × Japan
3 × USA
Collaborated with:
T.Aoto ∅ T.Nagaya M.Sakai A.Middeldorp K.Uchida J.Yoshida Y.Chiba T.Yamada K.Kusakari M.Nakamura J.W.Klop H.P.Barendregt T.Suzuki K.Kikuchi
Talks about:
rewrit (15) system (14) term (12) termin (5) confluenc (4) prove (4) order (4) transform (3) left (3) sequenti (2)

Person: Yoshihito Toyama

DBLP DBLP: Toyama:Yoshihito

Facilitated 2 volumes:

IJFCS/FLOPS 1998Ed
IJFCS/FLOPS 1998Ed

Contributed to:

RTA 20152015
RTA-TLCA 20142014
RTA 20112011
RTA 20092009
RTA 20082008
PPDP 20052005
RTA 20052005
RTA 20042004
PPDP 19991999
RTA 19991999
RTA 19981998
ALP/HOA 19971997
RTA 19961996
LICS 19921992
RTA 19911991
RTA 19891989
CADE 19861986

Wrote 18 papers:

RTA-2015-SuzukiKAT #confluence #orthogonal #revisited #term rewriting
Confluence of Orthogonal Nominal Rewriting Systems Revisited (TS, KK, TA, YT), pp. 301–317.
RTA-TLCA-2014-AotoTU #confluence #diagrams #proving #term rewriting
Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams (TA, YT, KU), pp. 46–60.
RTA-2011-AotoT #confluence #proving #term rewriting
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems (TA, YT), pp. 91–106.
RTA-2009-AotoYT #automation #confluence #proving #term rewriting
Proving Confluence of Term Rewriting Systems Automatically (TA, JY, YT), pp. 93–102.
RTA-2008-Toyama #lisp #proving #recursion #term rewriting #termination
Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (YT), pp. 381–391.
PPDP-2005-ChibaAT #program transformation #term rewriting
Program transformation by templates based on term rewriting (YC, TA, YT), pp. 59–69.
RTA-2005-Toyama #confluence #term rewriting
Confluent Term Rewriting Systems (YT), p. 1.
RTA-2004-AotoYT #higher-order #induction #theorem
Inductive Theorems for Higher-Order Rewriting (TA, TY, YT), pp. 269–284.
RTA-2004-Toyama #higher-order #lisp #term rewriting #termination
Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms (YT), pp. 40–54.
PPDP-1999-KusakariNT
Argument Filtering Transformation (KK, MN, YT), pp. 47–61.
RTA-1999-NagayaT #decidability #term rewriting
Decidability for Left-Linaer Growing Term Rewriting Systems (TN, YT), pp. 256–270.
RTA-1998-AotoT #termination
Termination Transformation by Tree Lifting Ordering (TA, YT), pp. 256–270.
ALP-1997-AotoT #composition #on the #term rewriting
On Composable Properties of Term Rewriting Systems (TA, YT), pp. 114–128.
RTA-1996-SakaiT #semantics #term rewriting
Semantics and Strong Sequentiality of Priority Term Rewriting Systems (MS, YT), pp. 377–391.
LICS-1992-Toyama #linear #term rewriting
Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems (YT), pp. 274–284.
RTA-1991-MiddeldorpT
Completeness of Combinations of Constructor Systems (AM, YT), pp. 188–199.
RTA-1989-ToyamaKB #linear #term rewriting #termination
Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft- (YT, JWK, HPB), pp. 477–491.
CADE-1986-Toyama #equivalence #how #induction #term rewriting
How to Prove Equivalence of Term Rewriting Systems without Induction (YT), pp. 118–127.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.