Kazuyuki Asada

38 papers A* 5A 1B 6C 5Journal 15Unranked 6
YearRankTypeTitle / Venue / Authors
2025 C conf
Characterizations of Partial Well-Behaved Lenses.
PEPM
Keishi Hashiba, Keisuke Nakano, Kazuyuki Asada, Kentaro Kikuchi
2024 — conf
Compositional Solution of Mean Payoff Games by String Diagrams.
Principles of Verification (3)
Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo
2024 J jnl
Enriched Presheaf Model of Quantum FPC.
Proc. ACM Program. Lang.
Takeshi Tsukada, Kazuyuki Asada
2023 — conf
Compositional Probabilistic Model Checking with String Diagrams of MDPs.
CAV (3)
Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo
2023 J jnl
Compositional Probabilistic Model Checking with String Diagrams of MDPs.
CoRR
Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo
2023 J jnl
Compositional Solution of Mean Payoff Games by String Diagrams.
CoRR
Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo
2023 J jnl
Enriched Presheaf Model of Quantum FPC.
CoRR
Takeshi Tsukada, Kazuyuki Asada
2022 J jnl
Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings.
CoRR
Takeshi Tsukada, Kazuyuki Asada
2022 A* conf
Linear-Algebraic Models of Linear Logic as Categories of Modules over Σ-Semirings✱.
LICS
Takeshi Tsukada, Kazuyuki Asada
2022 — conf
On Higher-Order Reachability Games Vs May Reachability.
RP
Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi
2022 J jnl
On Higher-Order Reachability Games vs May Reachability.
CoRR
Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi
2021 B conf
A Compositional Approach to Parity Games.
MFPS
Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo
2021 J jnl
Streaming ranked-tree-to-string transducers.
Theor. Comput. Sci.
Yuta Takahashi, Kazuyuki Asada, Keisuke Nakano
2020 B conf
On Average-Case Hardness of Higher-Order Model Checking.
FSCD
Yoshiki Nakamura, Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada
2020 B conf
Size-Preserving Translations from Order-(n+1) Word Grammars to Order-n Tree Grammars.
FSCD
Kazuyuki Asada, Naoki Kobayashi
2019 J jnl
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence.
Log. Methods Comput. Sci.
Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada
2019 C conf
Streaming Ranked-Tree-to-String Transducers.
CIAA
Yuta Takahashi, Kazuyuki Asada, Keisuke Nakano
2018 J jnl
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence.
CoRR
Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada
2018 — conf
Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered.
FSTTCS
Kazuyuki Asada, Naoki Kobayashi
2018 A* conf
Species, Profunctors and Taylor Expansion Weighted by SMCC: A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs.
LICS
Takeshi Tsukada, Kazuyuki Asada, C.-H. Luke Ong
2018 J jnl
The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics.
Math. Struct. Comput. Sci.
Makoto Hamana, Kazutaka Matsuda, Kazuyuki Asada
2017 C conf
A functional reformulation of UnCAL graph-transformations: or, graph transformation as graph reduction.
PEPM
Kazutaka Matsuda, Kazuyuki Asada
2017 B conf
Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence.
FoSSaCS
Ryoma Sin'ya, Kazuyuki Asada, Naoki Kobayashi, Takeshi Tsukada
2017 A* conf
Generalised species of rigid resource terms.
LICS
Takeshi Tsukada, Kazuyuki Asada, C.-H. Luke Ong
2017 A* conf
Pumping Lemma for Higher-order Languages.
ICALP
Kazuyuki Asada, Naoki Kobayashi
2017 J jnl
Pumping Lemma for Higher-order Languages.
CoRR
Kazuyuki Asada, Naoki Kobayashi
2017 J jnl
Verifying relational properties of functional programs by first-order refinement.
Sci. Comput. Program.
Kazuyuki Asada, Ryosuke Sato, Naoki Kobayashi
2016 A* conf
On Word and Frontier Languages of Unsafe Higher-Order Grammars.
ICALP
Kazuyuki Asada, Naoki Kobayashi
2016 J jnl
On Word and Frontier Languages of Unsafe Higher-Order Grammars.
CoRR
Kazuyuki Asada, Naoki Kobayashi
2015 B conf
Decision Algorithms for Checking Definability of Order-2 Finitary PCF.
APLAS
Sadaaki Kawata, Kazuyuki Asada, Naoki Kobayashi
2015 J jnl
Refinement Type Checking via Assertion Checking.
J. Inf. Process.
Ryosuke Sato, Kazuyuki Asada, Naoki Kobayashi
2015 J jnl
The Algebra of Recursive Graph Transformation Language UnCAL: Complete Axiomatisation and Iteration Categorical Semantics.
CoRR
Makoto Hamana, Kazutaka Matsuda, Kazuyuki Asada
2015 C conf
Verifying Relational Properties of Functional Programs by First-Order Refinement.
PEPM
Kazuyuki Asada, Ryosuke Sato, Naoki Kobayashi
2013 C conf
A parameterized graph transformation calculus for finite graphs with monadic branches.
PPDP
Kazuyuki Asada, Soichiro Hidaka, Hiroyuki Kato, Zhenjiang Hu, Keisuke Nakano
2013 A conf
Structural recursion for querying ordered graphs.
ICFP
Soichiro Hidaka, Kazuyuki Asada, Zhenjiang Hu, Hiroyuki Kato, Keisuke Nakano
2010 — conf
Arrows Are Strong Monads.
MSFP@ICFP
Kazuyuki Asada
2010 — conf
Categorifying Computations into Components via Arrows as Profunctors.
CMCS@ETAPS
Kazuyuki Asada, Ichiro Hasuo
2008 B conf
Extensional Universal Types for Call-by-Value.
APLAS
Kazuyuki Asada