Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Misao Nagayama"'
Publikováno v:
Electronic Notes in Theoretical Computer Science. 161:43-57
We give a category-theoretic formulation of Engeler-style models for the untyped λ-calculus. In order to do so, we exhibit an equivalence between distributive laws and extensions of one monad to the Kleisli category of another and explore the exampl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::54b4308420eac46062cec4b91bbb9716
https://doi.org/10.1016/j.entcs.2006.04.024
https://doi.org/10.1016/j.entcs.2006.04.024
Autor:
Misao Nagayama, Mitsuhiro Okada
Publikováno v:
Theoretical Computer Science. 294:551-573
It is well known that every proof net of a non-commutative version of MLL (multiplicative fragment of commutative linear logic) can be drawn as a plane Danos–Regnier graph (drawing) satisfying the switching condition of Danos–Regnier [3]. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b9dca0efd57fa17d5d313c8243e7452
https://doi.org/10.1016/s0304-3975(01)00178-5
https://doi.org/10.1016/s0304-3975(01)00178-5
Autor:
Misao Nagayama, Mitsuhiro Okada
Publikováno v:
Journal of Symbolic Logic. 66:1524-1542
This paper presents a new correctness criterion for marked Danos-Reginer graphs (D-R graphs, for short) of Multiplicative Cyclic Linear Logic MCLL and Abrusci's non-commutative Linear Logic MNLL.As a corollary we obtain an affirmative answer to the o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c62c3463c7e37a13d8793e6611a682ef
https://doi.org/10.2307/2694960
https://doi.org/10.2307/2694960
Autor:
Oliveira Vale, Arthur1 arthur.oliveiravale@yale.edu, Shao, Zhong1 zhong.shao@yale.edu, Chen, Yixuan1 yixuan.chen@yale.edu
Publikováno v:
Journal of the ACM. Apr2024, Vol. 71 Issue 2, p1-107. 107p.
Autor:
Misao Nagayama
Publikováno v:
Studia Logica. 53:227-234
A BCK-algebra is an algebra in which the terms are generated by a set of variables, 1, and an arrow. We mean by aBCK-identity an equation valid in all BCK-algebras. In this paper using a syntactic method we show that for two termss andt, if neithers=
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::758bb413f46ec3276637ef62b105d175
https://doi.org/10.1007/bf01054710
https://doi.org/10.1007/bf01054710
Autor:
Misao Nagayama
Publikováno v:
Journal of Symbolic Logic. 57:1305-1318
In this paper we consider properties, related to model-completeness, of the theory of integrally closed commutative regular rings. We obtain the main theorem claiming that in a Boolean algebra B, the truth of a prenex Σn-formula whose parameters ai,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32d1edec06f26b145bb1a1175fea2c40
https://doi.org/10.2307/2275369
https://doi.org/10.2307/2275369
Autor:
Mitsuhiro Okada, Misao Nagayama
Publikováno v:
Electronic Notes in Theoretical Computer Science. :153
It is well-known that every proof net of a non-commutative version of MLL (Multiplicative fragment of Commutative Linear Logic) can be drawn as a plane Danos-Regnier graph (drawing) satisfying the switching condition of Danos-Regnier [3]. In this pap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1fea7dbac497fd27d9f071e58244f6ba
Autor:
Humberstone, Lloyd1 Lloyd.Humberstone@arts.monash.edu.au, Meyer, Robert K.2 bob.meyer@anu.edu.au
Publikováno v:
Logic Journal of the IGPL. Mar2007, Vol. 15 Issue 2, p165-181. 17p.