| Verifying relational properties of functional programs by first-order refinement K Asada, R Sato, N Kobayashi Science of computer programming 137, 2-62, 2017 | 28 | 2017 |
| 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 | 26 | 2017 |
| 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 | 19 | 2018 |
| 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 | 18 | 2013 |
| Arrows are strong monads K Asada Proceedings of the third ACM SIGPLAN workshop on Mathematically Structured …, 2010 | 14 | 2010 |
| Categorifying computations into components via arrows as profunctors K Asada, I Hasuo Electronic Notes in Theoretical Computer Science 264 (2), 25-45, 2010 | 11 | 2010 |
| On word and frontier languages of unsafe higher-order grammars K Asada, N Kobayashi arXiv preprint arXiv:1604.01595, 2016 | 10 | 2016 |
| 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 | 8 | 2013 |
| Pumping lemma for higher-order languages K Asada, N Kobayashi arXiv preprint arXiv:1705.10699, 2017 | 7 | 2017 |
| 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 | 7 | 2017 |
| 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 | 6 | 2018 |
| Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence T Tsukada, R Sin'ya, N Kobayashi, K Asada Logical Methods in Computer Science 15, 2019 | 3 | 2019 |
| 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 | 3 | 2012 |
| 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 | 2 | 2020 |
| 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 | 2 | 2018 |
| 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 | 2 | 2017 |
| Refinement type checking via assertion checking R Sato, K Asada, N Kobayashi Journal of information processing 23 (6), 827-834, 2015 | 2 | 2015 |
| Extensional universal types for call-by-value K Asada Asian Symposium on Programming Languages and Systems, 122-137, 2008 | 2 | 2008 |
| Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings T Tsukada, K Asada arXiv preprint arXiv:2204.10589, 2022 | | 2022 |
| On Higher-Order Reachability Games vs May Reachability K Asada, H Katsura, N Kobayashi arXiv preprint arXiv:2203.08416, 2022 | | 2022 |
Naoki KobayashiUniversity of Tokyo確認したメール アドレス: is.s.u-tokyo.ac.jp
