Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Kohei Honda"'
Autor:
Olivier Laurent, Kohei Honda
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2010, 411 (22--24), pp.2223--2238. ⟨10.1016/j.tcs.2010.01.028⟩
Theoretical Computer Science, Elsevier, 2010, 411 (22--24), pp.2223--2238. ⟨10.1016/j.tcs.2010.01.028⟩
International audience; This paper presents an exact correspondence in typing and dynamics between polarised linear logic and a typed π-calculus based on IO-typing. The respective incremental constraints, one on geometric structures of proof-nets an
Autor:
Kohei Honda, Nobuko Yoshida
Publikováno v:
Theoretical Computer Science. 221:393-456
We present a general semantic universe of call-by-value computation based on elements of game semantics, and validate its appropriateness as a semantic universe by the full abstraction result for call-by-value PCF, a generic typed programming languag
Autor:
Kohei Honda, Nobuko Yoshida
Publikováno v:
Theoretical Computer Science. 151(2):437-486
A formulation of semantic theories for processes which does not rely on the notion of observables or convergence is studied. The new construction is based solely on a reduction relation and equational reasoning, but can induce meaningful theories for