default search action
Masahito Hasegawa
Person information
- affiliation: Kyoto University, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c22]Masahito Hasegawa
, Serge Lechenne
Braids, Twists, Trace and Duality in Combinatory Algebras. LICS 2024: 42:1-42:14 - [i4]Masahito Hasegawa, Serge Lechenne:
Braids, twists, trace and duality in combinatory algebras. CoRR abs/2405.10152 (2024) - 2022
- [j10]Masahito Hasegawa
A special issue on categorical algebras and computation in celebration of John Power's 60th birthday, part II. Math. Struct. Comput. Sci. 32(4): 348 (2022) - [c21]Masahito Hasegawa:
The Internal Operads of Combinatory Algebras. MFPS 2022 - 2021
- [j9]Masahito Hasegawa
A special issue on categorical algebras and computation in celebration of John Power's 60th birthday, part I. Math. Struct. Comput. Sci. 31(7): 746-747 (2021) - 2020
- [c20]Masahito Hasegawa
A Braided Lambda Calculus. Linearity&TLLA@IJCAR-FSCD 2020: 94-108
2010 – 2019
- 2018
- [c19]Masahito Hasegawa
From Linear Logic to Cyclic Sharing. Linearity-TLLA@FLoC 2018: 31-42 - [i3]Dan R. Ghica, Masahito Hasegawa, Pawel Sobocinski:
Diagrammatic methods for linear and nonlinear systems (NII Shonan Meeting 2018-18). NII Shonan Meet. Rep. 2018 (2018) - 2016
- [c18]Masahito Hasegawa
Linear Exponential Comonads without Symmetry. LINEARITY 2016: 54-63 - 2013
- [e1]Masahito Hasegawa
Typed Lambda Calculi and Applications, 11th International Conference, TLCA 2013, Eindhoven, The Netherlands, June 26-28, 2013. Proceedings. Lecture Notes in Computer Science 7941, Springer 2013, ISBN 978-3-642-38945-0 [contents] - 2012
- [j8]Masahito Hasegawa
A quantum double construction in Rel. Math. Struct. Comput. Sci. 22(4): 618-650 (2012) - 2010
- [c17]Masahito Hasegawa:
Bialgebras in Rel. MFPS 2010: 337-350
2000 – 2009
- 2009
- [j7]Keiko Nakata, Masahito Hasegawa
Small-step and big-step semantics for call-by-need. J. Funct. Program. 19(6): 699-722 (2009) - [j6]Masahito Hasegawa
On traced monoidal closed categories. Math. Struct. Comput. Sci. 19(2): 217-244 (2009) - [i2]Keiko Nakata, Masahito Hasegawa:
Small-step and big-step semantics for call-by-need. CoRR abs/0907.4640 (2009) - 2008
- [c16]Masahito Hasegawa
Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories. Pillars of Computer Science 2008: 367-385 - 2006
- [j5]Masahito Hasegawa
Relational Parametricity and Control. Log. Methods Comput. Sci. 2(3) (2006) - [c15]Yo Ohta, Masahito Hasegawa
A Terminating and Confluent Linear Lambda Calculus. RTA 2006: 166-180 - [i1]Masahito Hasegawa:
Relational Parametricity and Control. CoRR abs/cs/0606072 (2006) - 2005
- [j4]Yoshihiko Kakutani, Masahito Hasegawa:
Parameterizations and Fixed-Point Operators on Control Categories. Fundam. Informaticae 65(1-2): 153-172 (2005) - [j3]Masahito Hasegawa
Classical linear logic of implications. Math. Struct. Comput. Sci. 15(2): 323-342 (2005) - [c14]Masahito Hasegawa:
Relational Parametricity and Control. LICS 2005: 72-81 - 2004
- [c13]Masahito Hasegawa
Semantics of Linear Continuation-Passing in Call-by-Name. FLOPS 2004: 229-243 - 2003
- [c12]Yukiyoshi Kameyama, Masahito Hasegawa
A sound and complete axiomatization of delimited continuations. ICFP 2003: 177-188 - [c11]Yoshihiko Kakutani, Masahito Hasegawa:
Parameterizations and Fixed-Point Operators on Control Categories. TLCA 2003: 180-194 - 2002
- [j2]Masahito Hasegawa
Axioms for Recursion in Call-by-Value. High. Order Symb. Comput. 15(2-3): 235-264 (2002) - [c10]Masahito Hasegawa:
Classical Linear Logic of Implications. CSL 2002: 458-472 - [c9]Masahito Hasegawa
Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus. FLOPS 2002: 167-182 - [c8]Masahito Hasegawa:
The Uniformity Principle on Traced Monoidal Categories. CTCS 2002: 137-155 - 2001
- [c7]Masahito Hasegawa:
Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus. APLAS 2001: 277-288 - [c6]Masahito Hasegawa, Yoshihiko Kakutani:
Axioms for Recursion in Call-by-Value. FoSSaCS 2001: 246-260 - 2000
- [j1]Masahito Hasegawa
Girard translation and logical predicates. J. Funct. Program. 10(1): 77-89 (2000)
1990 – 1999
- 1999
- [c5]Masahito Hasegawa:
Logical Predicates for Intuitionistic Linear Type Theories. TLCA 1999: 198-212 - 1997
- [b1]Masahito Hasegawa:
Models of sharing graphs : a categorical semantics of let and letrec. University of Edinburgh, UK, 1997 - [c4]Andrew G. Barber, Philippa Gardner, Masahito Hasegawa
From Action Calculi to Linear Logic. CSL 1997: 78-97 - [c3]Philippa Gardner, Masahito Hasegawa
Types and Models for Higher-Order Action Calculi. TACS 1997: 583-603 - [c2]Masahito Hasegawa
Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi. TLCA 1997: 196-213 - 1995
- [c1]Masahito Hasegawa
Decomposing Typed Lambda Calculus into a Couple of Categorical Programming Languages. Category Theory and Computer Science 1995: 200-219
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: