Kazuyuki Asada

According to our database, Kazuyuki Asada authored at least 27 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Enriched Presheaf Model of Quantum FPC.

Takeshi Tsukada, Kazuyuki Asada

Proc. ACM Program. Lang., January, 2024

2023

Compositional Solution of Mean Payoff Games by String Diagrams.

Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo

CoRR, 2023

Compositional Probabilistic Model Checking with String Diagrams of MDPs.

Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo

Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022

Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings.

Takeshi Tsukada, Kazuyuki Asada

CoRR, 2022

On Higher-Order Reachability Games Vs May Reachability.

Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi

Proceedings of the Reachability Problems - 16th International Conference, 2022

Linear-Algebraic Models of Linear Logic as Categories of Modules over Σ-Semirings✱.

Takeshi Tsukada, Kazuyuki Asada

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021

Streaming ranked-tree-to-string transducers.

Yuta Takahashi, Kazuyuki Asada, Keisuke Nakano

Theor. Comput. Sci., 2021

A Compositional Approach to Parity Games.

Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo

Proceedings of the Proceedings 37th Conference on Mathematical Foundations of Programming Semantics, 2021

2020

On Average-Case Hardness of Higher-Order Model Checking.

Yoshiki Nakamura, Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada

Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

Size-Preserving Translations from Order-(n+1) Word Grammars to Order-n Tree Grammars.

Kazuyuki Asada, Naoki Kobayashi

Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

2019

Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence.

Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada

Log. Methods Comput. Sci., 2019

2018

The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics.

Makoto Hamana, Kazutaka Matsuda, Kazuyuki Asada

Math. Struct. Comput. Sci., 2018

Species, Profunctors and Taylor Expansion Weighted by SMCC: A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs.

Takeshi Tsukada, Kazuyuki Asada, C.-H. Luke Ong

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered.

Kazuyuki Asada, Naoki Kobayashi

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

Verifying relational properties of functional programs by first-order refinement.

Kazuyuki Asada, Ryosuke Sato, Naoki Kobayashi

Sci. Comput. Program., 2017

A functional reformulation of UnCAL graph-transformations: or, graph transformation as graph reduction.

Kazutaka Matsuda, Kazuyuki Asada

Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2017

Generalised species of rigid resource terms.

Takeshi Tsukada, Kazuyuki Asada, C.-H. Luke Ong

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Pumping Lemma for Higher-order Languages.

Kazuyuki Asada, Naoki Kobayashi

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence.

Ryoma Sin'ya, Kazuyuki Asada, Naoki Kobayashi, Takeshi Tsukada

Proceedings of the Foundations of Software Science and Computation Structures, 2017

2016

On Word and Frontier Languages of Unsafe Higher-Order Grammars.

Kazuyuki Asada, Naoki Kobayashi

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Refinement Type Checking via Assertion Checking.

Ryosuke Sato, Kazuyuki Asada, Naoki Kobayashi

J. Inf. Process., 2015

Decision Algorithms for Checking Definability of Order-2 Finitary PCF.

Sadaaki Kawata, Kazuyuki Asada, Naoki Kobayashi

Proceedings of the Programming Languages and Systems - 13th Asian Symposium, 2015

2013

A parameterized graph transformation calculus for finite graphs with monadic branches.

Kazuyuki Asada, Soichiro Hidaka, Hiroyuki Kato, Zhenjiang Hu, Keisuke Nakano

Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

Structural recursion for querying ordered graphs.

Soichiro Hidaka, Kazuyuki Asada, Zhenjiang Hu, Hiroyuki Kato, Keisuke Nakano

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

2010

Categorifying Computations into Components via Arrows as Profunctors.

Kazuyuki Asada, Ichiro Hasuo

Proceedings of the Tenth Workshop on Coalgebraic Methods in Computer Science, 2010

Arrows Are Strong Monads.

Kazuyuki Asada

Proceedings of the 3rd ACM SIGPLAN Workshop on Mathematically Structured Functional Programming, 2010

2008

Extensional Universal Types for Call-by-Value.

Kazuyuki Asada

Proceedings of the Programming Languages and Systems, 6th Asian Symposium, 2008