Travelled to:1 × Germany
1 × Japan
1 × Korea
1 × Taiwan
1 × The Netherlands
1 × United Kingdom
2 × USA
Collaborated with:A.Middeldorp T.Suzuki H.Takahashi S.Okui A.Kasem F.Ghourabi M.Marin K.Nakagawa K.Nakahara E.Goto T.Soma N.Inada M.Idesawa K.Hiraki M.Suzuki K.Shimizu B.Philipov
Talks about:narrow (5) origami (4) higher (4) order (4) lazi (4) variabl (3) complet (3) logic (3) function (2) calculus (2)
Person: Tetsuo Ida
DBLP: Ida:Tetsuo
Contributed to:
201120092007
1999
19971995
1995
1982
19951996Wrote 10 papers:
- SAC-2011-KasemGI #axiom
- Origami axioms and circle extension (AK, FG, TI), pp. 1106–1111.
- SAC-2009-IdaT #algebra #graph grammar
- Origami fold as algebraic graph rewriting (TI, HT), pp. 1132–1137.
- SAC-2007-GhourabiITMK #algebra #axiom #logic
- Logical and algebraic view of Huzita’s origami axioms with applications to computational origami (FG, TI, HT, MM, AK), pp. 767–772.
- FLOPS-1999-MarinIS #higher-order #lazy evaluation #on the
- On Reducing the Search Space of Higher-Order Lazy Narrowing (MM, TI, TS), pp. 319–334.
- ALP-1997-SuzukiNI #calculus #functional #higher-order #lazy evaluation #logic
- Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Language (TS, KN, TI), pp. 99–113.
- PLILP-1995-NakaharaMI #calculus #functional #higher-order #logic programming
- A Complete Narrowing Calculus for Higher-Order Functional Logic Programming (KN, AM, TI), pp. 97–114.
- RTA-1995-SuzukiMI #term rewriting
- Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides (TS, AM, TI), pp. 179–193.
- LFP-1982-GotoSIIIHSSP #design #lisp
- Design of a Lisp Machine — FLATS (EG, TS, NI, TI, MI, KH, MS, KS, BP), pp. 208–215.
- TAPSOFT-1995-OkuiMI #lazy evaluation
- Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract) (SO, AM, TI), pp. 394–408.
- TAPSOFT-J-1995-MiddeldorpOI96 #lazy evaluation
- Lazy Narrowing: Strong Completeness and Eager Variable Elimination (AM, SO, TI), pp. 95–130.