Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Asada, Kazuyuki
add a person with the name Asada, Kazuyuki
 

Other publications of authors with the same name

Decision Algorithms for Checking Definability of Order-2 Finitary PCF., , and . APLAS, volume 9458 of Lecture Notes in Computer Science, page 313-331. Springer, (2015)Arrows Are Strong Monads.. MSFP@ICFP, page 33-42. ACM, (2010)Structural recursion for querying ordered graphs., , , , and . ICFP, page 305-318. ACM, (2013)Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence., , , and . CoRR, (2018)Streaming Ranked-Tree-to-String Transducers., , and . CIAA, volume 11601 of Lecture Notes in Computer Science, page 235-247. Springer, (2019)The Algebra of Recursive Graph Transformation Language UnCAL: Complete Axiomatisation and Iteration Categorical Semantics., , and . CoRR, (2015)Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence., , , and . Logical Methods in Computer Science, (2019)Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence., , , and . FoSSaCS, volume 10203 of Lecture Notes in Computer Science, page 53-68. (2017)Pumping Lemma for Higher-order Languages., and . ICALP, volume 80 of LIPIcs, page 97:1-97:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered., and . FSTTCS, volume 122 of LIPIcs, page 14:1-14:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)