Zobrazeno 1 - 10
of 113
pro vyhledávání: '"Nakata, Keiko"'
Autor:
Nakata, Keiko, Uustalu, Tarmo
Publikováno v:
Logical Methods in Computer Science, Volume 11, Issue 1 (February 11, 2015) lmcs:692
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for While. In this semantics, both traces and evaluation (relating initial
Externí odkaz:
http://arxiv.org/abs/1412.6579
Autor:
Nakata, Keiko
Kyoto University (京都大学)
0048
甲第12792号
理博第3102号
新制||理||1462(附属図書館)
UT51-2007-H65
学位規則第4条第1項該当
0048
甲第12792号
理博第3102号
新制||理||1462(附属図書館)
UT51-2007-H65
学位規則第4条第1項該当
Externí odkaz:
http://hdl.handle.net/2433/136740
Publikováno v:
Logical Methods in Computer Science, Volume 8, Issue 4 (October 10, 2012) lmcs:1048
Mixing induction and coinduction, we study alternative definitions of streams being finitely red. We organize our definitions into a hierarchy including also some well-known alternatives in intuitionistic analysis. The hierarchy collapses classically
Externí odkaz:
http://arxiv.org/abs/1210.1200
Autor:
Ilik, Danko, Nakata, Keiko
Publikováno v:
Leibniz International Proceedings in Informatics, 26, 2014
First, we reconstruct Wim Veldman's result that Open Induction on Cantor space can be derived from Double-negation Shift and Markov's Principle. In doing this, we notice that one has to use a countable choice axiom in the proof and that Markov's Prin
Externí odkaz:
http://arxiv.org/abs/1209.2229
Autor:
Nakata, Keiko
Publikováno v:
EPTCS 66, 2011, pp. 226-235
In this tutorial, we program big-step and small-step total interpreters for the While language extended with input and output primitives. While is a simple imperative language consisting of skip, assignment, sequence, conditional and loop. We first d
Externí odkaz:
http://arxiv.org/abs/1109.0785
Autor:
Nakata, Keiko, Uustalu, Tarmo
Publikováno v:
EPTCS 32, 2010, pp. 57-75
We look at the operational semantics of languages with interactive I/O through the glasses of constructive type theory. Following on from our earlier work on coinductive trace-based semantics for While, we define several big-step semantics for While
Externí odkaz:
http://arxiv.org/abs/1008.2112
Autor:
Nakata, Keiko
Programming languages are expected to support programmer's effort to structure program code. The ML module system, object systems and mixins are good examples of language constructs promoting modular programming. Among the three, mixins can be though
Externí odkaz:
http://arxiv.org/abs/0908.3650
Autor:
Nakata, Keiko, Hasegawa, Masahito
We present natural semantics for acyclic as well as cyclic call-by-need lambda calculi, which are proved equivalent to the reduction semantics given by Ariola and Felleisen. The natural semantics are big-step and use global heaps, where evaluation is
Externí odkaz:
http://arxiv.org/abs/0907.4640