I have been working on semantic models of computation, with particular emphasis on the analysis of programming languages. My research topics include lambda calculi, type theory, functional programming, operational semantics, denotational semantics, and category theory.
Research Interests
tensor categories
semantics of programming languages
monoidal categories
software
theory of programming languages
functional programming languages
traced monoidal categories
linear logic
type theory
Geometry of Interaction
semantics
category theory
programming languages
lambda calculus
Research Areas
Natural sciences, Applied mathematics and statistics
Natural sciences, Basic mathematics
Natural sciences, Algebra
Informatics, Software
Informatics, Information theory
Papers
A special issue on categorical algebras and computation in celebration of John Power’s 60th birthday, part II
Masahito Hasegawa; Stephen Lack; Guy McCusker
Mathematical Structures in Computer Science, Apr. 2022
A special issue on categorical algebras and computation in celebration of John Power’s 60th birthday, part I
Masahito Hasegawa; Stephen Lack; Guy McCusker
Mathematical Structures in Computer Science, Aug. 2021
Typed Lambda Calculi and Applications
Masahito Hasegawa
2013
Models of Sharing Graphs
Masahito Hasegawa
1999
Braids, Twists, Trace and Duality in Combinatory Algebras.
Masahito Hasegawa; Serge Lechenne
LICS, 2024, Peer-reviewed
Traced Monads and Hopf Monads
Masahito Hasegawa; Jean-Simon Pacaud Lemay
Compositionality, 30 Oct. 2023, Peer-reviewed
Hopf monads on biproducts
Masahito Hasegawa
Theory and Applications of Categories, 20 Sep. 2023, Peer-reviewed
The Internal Operads of Combinatory Algebras.
Masahito Hasegawa
MFPS, 2022, Peer-reviewed
A Braided Lambda Calculus
Masahito Hasegawa
Electronic Proceedings in Theoretical Computer Science, 30 Dec. 2021, Peer-reviewed
From Linear Logic to Cyclic Sharing
Masahito Hasegawa
Electronic Proceedings in Theoretical Computer Science, 15 Apr. 2019, Peer-reviewed
Linear distributivity with negation, star-autonomy, and Hopf monads
Masahito Hasegawa
Theory and Applications of Categories, 16 Nov. 2018, Peer-reviewed
Linear Exponential Comonads without Symmetry
Masahito Hasegawa
Electronic Proceedings in Theoretical Computer Science, 17 Jan. 2017, Peer-reviewed
TRACED *-AUTONOMOUS CATEGORIES ARE COMPACT CLOSED
Tamas Hajgato; Masahito Hasegawa
THEORY AND APPLICATIONS OF CATEGORIES, 2013, Peer-reviewed
A quantum double construction in Rel
Masahito Hasegawa
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, Aug. 2012, Peer-reviewed
A note on the biadjunction between 2-categories of traced monoidal categories and tortile monoidal categories
Masahito Hasegawa; Shin-Ya Katsumata
MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, Jan. 2010, Peer-reviewed
Small-step and big-step semantics for call-by-need
Keiko Nakata; Masahito Hasegawa
JOURNAL OF FUNCTIONAL PROGRAMMING, Nov. 2009, Peer-reviewed
On traced monoidal closed categories
Masahito Hasegawa
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, Apr. 2009, Peer-reviewed
Finite dimensional vector spaces are complete for traced symmetric monoidal categories
Masahito Hasegawa; Martin Hofmann; Gordon Plotkin
PILLARS OF COMPUTER SCIENCE, 2008, Peer-reviewed, Invited
On semantics of recursive programs
Masahito Hasegawa
数学, Apr. 2007, Peer-reviewed, Invited
RELATIONAL PARAMETRICITY AND CONTROL
Masahito Hasegawa
LOGICAL METHODS IN COMPUTER SCIENCE, 2006, Peer-reviewed, Invited
Coherence of the double involution on *-autonomous categories
Masahito Hasegawa
Theory and Applications of Categories, 16 Dec. 2006, Peer-reviewed
A terminating and confluent linear lambda calculus
Yo Ohta; Masahito Hasegawa
TERM REWRITING AND APPLICATIONS, PROCEEDINGS, 2006, Peer-reviewed
Classical linear logic of implications
M Hasegawa
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, Apr. 2005, Peer-reviewed
Parameterizations and fixed-point operators on control categories
Y Kakutani; M Hasegawa
FUNDAMENTA INFORMATICAE, Mar. 2005, Peer-reviewed, Invited
Relational parametricity and control
Masahito Hasegawa
Proceedings - Symposium on Logic in Computer Science, 2005, Peer-reviewed
The uniformity principle on traced monoidal categories
M Hasegawa
PUBLICATIONS OF THE RESEARCH INSTITUTE FOR MATHEMATICAL SCIENCES, Sep. 2004, Peer-reviewed, Invited
Semantics of linear continuation-passing in call-by-name
M Hasegawa
FUNCTIONAL AND LOGIC PROGRAMMING, 2004, Peer-reviewed
A sound and complete axiomatization of delimited continuations
Y Kameyama; M Hasegawa
ACM SIGPLAN NOTICES, Sep. 2003, Peer-reviewed
The uniformity principle on traced monoidal categories
Masahito Hasegawa
Electronic Notes in Theoretical Computer Science, Feb. 2003, Peer-reviewed
Parameterizations and fixed-point operators on control categories
Y Kakutani; M Hasegawa
TYPED LAMBDA CALCULI AND APPLICATIONS, PROCEEDINGS, 2003, Peer-reviewed
Axioms for recursion in call-by-value
Masahito Hasegawa; Yoshihiko Kakutani
Higher-Order and Symbolic Computation, Sep. 2002, Peer-reviewed, Invited
Linearly used effects: Monadic and CPS transformations into the linear lambda calculus
Masahito Hasegawa
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2002, Peer-reviewed