| Models of Sharing Graphs: A Categorical Semantics of let and letrec M Hasegawa University of Edinburgh, 1997 | 174* | 1997 |
| Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi M Hasegawa International Conference on Typed Lambda Calculi and Applications, 196-213, 1997 | 156 | 1997 |
| A sound and complete axiomatization of delimited continuations Y Kameyama, M Hasegawa Proceedings of the eighth ACM SIGPLAN international conference on Functional …, 2003 | 82 | 2003 |
| On traced monoidal closed categories M Hasegawa Mathematical Structures in Computer Science 19 (2), 217-244, 2009 | 63 | 2009 |
| Finite dimensional vector spaces are complete for traced symmetric monoidal categories M Hasegawa, M Hofmann, G Plotkin Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot …, 2008 | 44 | 2008 |
| The uniformity principle on traced monoidal categories M Hasegawa Electronic Notes in Theoretical Computer Science 69, 137-155, 2003 | 35 | 2003 |
| From action calculi to linear logic A Barber, P Gardner, M Hasegawa, G Plotkin Computer Science Logic: 11th International Workshop, CSL'97 Annual …, 1998 | 35 | 1998 |
| Small-step and big-step semantics for call-by-need K Nakata, M Hasegawa Journal of Functional Programming 19 (6), 699-722, 2009 | 34 | 2009 |
| Linearly used effects: Monadic and CPS transformations into the linear lambda calculus M Hasegawa International Symposium on Functional and Logic Programming, 167-182, 2002 | 34 | 2002 |
| Decomposing typed lambda calculus into a couple of categorical programming languages M Hasegawa International Conference on Category Theory and Computer Science, 200-219, 1995 | 33 | 1995 |
| Logical predicates for intuitionistic linear type theories M Hasegawa International Conference on Typed Lambda Calculi and Applications, 198-213, 1999 | 31 | 1999 |
| Relational parametricity and control M Hasegawa Logical Methods in Computer Science 2, 2006 | 27 | 2006 |
| A terminating and confluent linear lambda calculus Y Ohta, M Hasegawa International Conference on Rewriting Techniques and Applications, 166-180, 2006 | 25 | 2006 |
| Axioms for recursion in call-by-value M Hasegawa, Y Kakutani Higher-Order and Symbolic Computation 15, 235-264, 2002 | 22 | 2002 |
| Coherence of the double involution on∗-autonomous categories JRB Cockett, M Hasegawa, RAG Seely Theory and Applications of Categories 17 (2), 17-29, 2006 | 17 | 2006 |
| Semantics of linear continuation-passing in call-by-name M Hasegawa International Symposium on Functional and Logic Programming, 229-243, 2004 | 14 | 2004 |
| Categorical glueing and logical predicates for models of linear logic M Hasegawa Kyoto University. Research Institute for Mathematical Sciences [RIMS], 1999 | 14 | 1999 |
| Classical linear logic of implications M Hasegawa International Workshop on Computer Science Logic, 458-472, 2002 | 13 | 2002 |
| Types and models for higher-order action calculi P Gardner, M Hasegawa International Symposium on Theoretical Aspects of Computer Software, 583-603, 1997 | 12 | 1997 |
| Classical linear logic of implications M Hasegawa Mathematical Structures in Computer Science 15 (2), 323-342, 2005 | 11 | 2005 |
