default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazuyuki Asada
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Takeshi Tsukada
, Kazuyuki Asada:
Enriched Presheaf Model of Quantum FPC. Proc. ACM Program. Lang. 8(POPL): 362-392 (2024)- 2023
- [c21]Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo:
Compositional Probabilistic Model Checking with String Diagrams of MDPs. CAV (3) 2023: 40-61 - [i9]Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo:
Compositional Solution of Mean Payoff Games by String Diagrams. CoRR abs/2307.08034 (2023) - [i8]Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo:
Compositional Probabilistic Model Checking with String Diagrams of MDPs. CoRR abs/2307.08765 (2023) - [i7]Takeshi Tsukada, Kazuyuki Asada:
Enriched Presheaf Model of Quantum FPC. CoRR abs/2311.03117 (2023) - 2022
- [c20]Takeshi Tsukada, Kazuyuki Asada:
Linear-Algebraic Models of Linear Logic as Categories of Modules over Σ-Semirings✱. LICS 2022: 60:1-60:13 - [c19]Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi:
On Higher-Order Reachability Games Vs May Reachability. RP 2022: 108-124 - [i6]Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi:
On Higher-Order Reachability Games vs May Reachability. CoRR abs/2203.08416 (2022) - [i5]Takeshi Tsukada, Kazuyuki Asada:
Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings. CoRR abs/2204.10589 (2022) - 2021
- [j5]Yuta Takahashi, Kazuyuki Asada, Keisuke Nakano:
Streaming ranked-tree-to-string transducers. Theor. Comput. Sci. 870: 165-187 (2021) - [c18]Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo:
A Compositional Approach to Parity Games. MFPS 2021: 278-295 - 2020
- [c17]Yoshiki Nakamura, Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada:
On Average-Case Hardness of Higher-Order Model Checking. FSCD 2020: 21:1-21:23 - [c16]Kazuyuki Asada, Naoki Kobayashi:
Size-Preserving Translations from Order-(n+1) Word Grammars to Order-n Tree Grammars. FSCD 2020: 22:1-22:22
2010 – 2019
- 2019
- [j4]Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada:
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence. Log. Methods Comput. Sci. 15(1) (2019) - [c15]Yuta Takahashi, Kazuyuki Asada, Keisuke Nakano:
Streaming Ranked-Tree-to-String Transducers. CIAA 2019: 235-247 - 2018
- [j3]Makoto Hamana, Kazutaka Matsuda, Kazuyuki Asada:
The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics. Math. Struct. Comput. Sci. 28(2): 287-337 (2018) - [c14]Kazuyuki Asada, Naoki Kobayashi:
Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered. FSTTCS 2018: 14:1-14:15 - [c13]Takeshi Tsukada, Kazuyuki Asada, C.-H. Luke Ong:
Species, Profunctors and Taylor Expansion Weighted by SMCC: A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs. LICS 2018: 889-898 - [i4]Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada:
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence. CoRR abs/1801.03886 (2018) - 2017
- [j2]Kazuyuki Asada, Ryosuke Sato, Naoki Kobayashi:
Verifying relational properties of functional programs by first-order refinement. Sci. Comput. Program. 137: 2-62 (2017) - [c12]Ryoma Sin'ya, Kazuyuki Asada, Naoki Kobayashi, Takeshi Tsukada:
Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence. FoSSaCS 2017: 53-68 - [c11]Kazuyuki Asada, Naoki Kobayashi:
Pumping Lemma for Higher-order Languages. ICALP 2017: 97:1-97:14 - [c10]Takeshi Tsukada, Kazuyuki Asada, C.-H. Luke Ong:
Generalised species of rigid resource terms. LICS 2017: 1-12 - [c9]Kazutaka Matsuda, Kazuyuki Asada:
A functional reformulation of UnCAL graph-transformations: or, graph transformation as graph reduction. PEPM 2017: 71-82 - [i3]Kazuyuki Asada, Naoki Kobayashi:
Pumping Lemma for Higher-order Languages. CoRR abs/1705.10699 (2017) - 2016
- [c8]Kazuyuki Asada, Naoki Kobayashi:
On Word and Frontier Languages of Unsafe Higher-Order Grammars. ICALP 2016: 111:1-111:13 - [i2]Kazuyuki Asada, Naoki Kobayashi:
On Word and Frontier Languages of Unsafe Higher-Order Grammars. CoRR abs/1604.01595 (2016) - 2015
- [j1]Ryosuke Sato, Kazuyuki Asada, Naoki Kobayashi:
Refinement Type Checking via Assertion Checking. J. Inf. Process. 23(6): 827-834 (2015) - [c7]Sadaaki Kawata, Kazuyuki Asada, Naoki Kobayashi:
Decision Algorithms for Checking Definability of Order-2 Finitary PCF. APLAS 2015: 313-331 - [c6]Kazuyuki Asada, Ryosuke Sato, Naoki Kobayashi:
Verifying Relational Properties of Functional Programs by First-Order Refinement. PEPM 2015: 61-72 - [i1]Makoto Hamana, Kazutaka Matsuda, Kazuyuki Asada:
The Algebra of Recursive Graph Transformation Language UnCAL: Complete Axiomatisation and Iteration Categorical Semantics. CoRR abs/1511.08851 (2015) - 2013
- [c5]Soichiro Hidaka, Kazuyuki Asada, Zhenjiang Hu, Hiroyuki Kato, Keisuke Nakano:
Structural recursion for querying ordered graphs. ICFP 2013: 305-318 - [c4]Kazuyuki Asada, Soichiro Hidaka, Hiroyuki Kato, Zhenjiang Hu, Keisuke Nakano:
A parameterized graph transformation calculus for finite graphs with monadic branches. PPDP 2013: 73-84 - 2010
- [c3]Kazuyuki Asada:
Arrows Are Strong Monads. MSFP@ICFP 2010: 33-42 - [c2]Kazuyuki Asada, Ichiro Hasuo:
Categorifying Computations into Components via Arrows as Profunctors. CMCS@ETAPS 2010: 25-45
2000 – 2009
- 2008
- [c1]Kazuyuki Asada:
Extensional Universal Types for Call-by-Value. APLAS 2008: 122-137
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
