Kazuyuki Asada
Kazuyuki Asada
確認したメール アドレス: riec.tohoku.ac.jp - ホームページ
タイトル
引用先
引用先
Verifying relational properties of functional programs by first-order refinement
K Asada, R Sato, N Kobayashi
Science of computer programming 137, 2-62, 2017
212017
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
192017
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
172013
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
162018
Arrows are strong monads
K Asada
Proceedings of the third ACM SIGPLAN workshop on Mathematically Structured …, 2010
132010
Categorifying computations into components via arrows as profunctors
K Asada, I Hasuo
Electronic Notes in Theoretical Computer Science 264 (2), 25-45, 2010
112010
On word and frontier languages of unsafe higher-order grammars
K Asada, N Kobayashi
arXiv preprint arXiv:1604.01595, 2016
82016
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
82013
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
Pumping lemma for higher-order languages
K Asada, N Kobayashi
arXiv preprint arXiv:1705.10699, 2017
62017
The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
M Hamana, K Matsuda, K Asada
arXiv preprint arXiv:1511.08851, 2015
62015
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence
K Asada, N Kobayashi, R Sin'ya, T Tsukada
arXiv preprint arXiv:1801.03886, 2018
32018
Parameterized graph transformation languages with monads
K Asada, S Hidaka, H Kato, Z Hu, K Nakano
Technical Report GRACE-TR-2012-07, GRACE Center, National Institute of …, 2012
32012
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
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
22017
Refinement type checking via assertion checking
R Sato, K Asada, N Kobayashi
Journal of information processing 23 (6), 827-834, 2015
22015
Extensional universal types for call-by-value
K Asada
Asian Symposium on Programming Languages and Systems, 122-137, 2008
22008
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
12020
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
2020
Streaming ranked-tree-to-string transducers
Y Takahashi, K Asada, K Nakano
International Conference on Implementation and Application of Automata, 235-247, 2019
2019
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20