Folgen
Kazuyuki Asada
Kazuyuki Asada
Bestätigte E-Mail-Adresse bei riec.tohoku.ac.jp - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Generalised species of rigid resource terms
T Tsukada, K Asada, CHL Ong
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017
372017
Species, profunctors and taylor expansion weighted by SMCC: A unified framework for modelling nondeterministic, probabilistic and quantum programs
T Tsukada, K Asada, CHL Ong
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
302018
Verifying relational properties of functional programs by first-order refinement
K Asada, R Sato, N Kobayashi
Proceedings of the 2015 Workshop on Partial Evaluation and Program …, 2015
282015
Structural recursion for querying ordered graphs
S Hidaka, K Asada, Z Hu, H Kato, K Nakano
Proceedings of the 18th ACM SIGPLAN international conference on Functional …, 2013
212013
Arrows are strong monads
K Asada
Proceedings of the third ACM SIGPLAN workshop on Mathematically Structured …, 2010
162010
Categorifying computations into components via arrows as profunctors
K Asada, I Hasuo
Electronic Notes in Theoretical Computer Science 264 (2), 25-45, 2010
122010
On word and frontier languages of unsafe higher-order grammars
K Asada, N Kobayashi
arXiv preprint arXiv:1604.01595, 2016
102016
A parameterized graph transformation calculus for finite graphs with monadic branches
K Asada, S Hidaka, H Kato, Z Hu, K Nakano
Proceedings of the 15th Symposium on Principles and Practice of Declarative …, 2013
92013
The algebra of recursive graph transformation language UnCAL: Complete axiomatisation and iteration categorical semantics
M Hamana, K Matsuda, K Asada
Mathematical Structures in Computer Science 28 (2), 287-337, 2018
72018
Pumping lemma for higher-order languages
K Asada, N Kobayashi
arXiv preprint arXiv:1705.10699, 2017
72017
Almost Every Simply Typed-Term Has a Long-Reduction Sequence
R Sin’Ya, K Asada, N Kobayashi, T Tsukada
International Conference on Foundations of Software Science and Computation …, 2017
72017
A functional reformulation of UnCAL graph-transformations: or, graph transformation as graph reduction
K Matsuda, K Asada
Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and …, 2017
62017
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence
K Asada, N Kobayashi, R Sin'Ya, T Tsukada
Logical Methods in Computer Science 15, 2019
52019
A compositional approach to parity games
K Watanabe, C Eberhart, K Asada, I Hasuo
arXiv preprint arXiv:2112.14058, 2021
42021
Linear-Algebraic Models of Linear Logic as Categories of Modules over Σ-Semirings✱
T Tsukada, K Asada
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022
32022
Size-preserving translations from order-(n+ 1) word grammars to order-n tree grammars
K Asada, N Kobayashi
5th International Conference on Formal Structures for Computation and …, 2020
32020
Parameterized graph transformation languages with monads
K Asada, S Hidaka, H Kato, Z Hu, K Nakano
Technical Report GRACETR-2012-07, GRACE Center, National Institute of …, 2012
32012
Compositional probabilistic model checking with string diagrams of MDPs
K Watanabe, C Eberhart, K Asada, I Hasuo
International Conference on Computer Aided Verification, 40-61, 2023
22023
On Average-Case Hardness of Higher-Order Model Checking
Y Nakamura, K Asada, N Kobayashi, R Sin'Ya, T Tsukada
5th International Conference on Formal Structures for Computation and …, 2020
22020
Lambda-definable order-3 tree functions are well-quasi-ordered
K Asada, N Kobayashi
38th IARCS Annual Conference on Foundations of Software Technology and …, 2018
22018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20