• Proceedings of the Korean Society for Language and Information Conference
• /
• 1998.02a
• /
• pp.295-302
• /
• 1998

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.421-426
• /
• 2001

A formal development method is used to develop software rigorously and systematically. In a formal development method, we specify system by a formal specification language and gradually develop the system more concretely until we can implement the system. VDM is one of formal specification languages. VDM uses mathematical data structures such as sets, sequences, and maps to specify the system, but most programming languages do not have such data structures. Therefore, these data structures should be converted. We can convert mathematical data structures in VDM to a linked list, a data structure in a programming language. In this article, we propose a method to convert a set, a sequence, and a map in VDM to a linked list in a programming language and prove the correctness of this conversion mathematically.

• Language and Information
• /
• v.6 no.1
• /
• pp.41-69
• /
• 2002

This paper addresses the issue of constraints on the conversion of the participle II in German, proposing a constraint-based lexical semantic approach. I argue against the widely accepted syntactic view which is based on the dichotomous distinction of intransitive verbs, which has been advanced by the Unaccusative Hypothesis [Perlmutter (1978)]. Several arguments are also given against the semantic view which is based on some aspectual notions such as 'telicity', 'transformativity' or 'terminativity'. The crucial constraints on the conversion of the participle II in German, it is argued, is instead two lexical semantic entailments, movement with a definite change of location and affectedness. These and other lexical semantic entailments in the sense of Dowty (1991) are encoded into the multiple inheritance type hierarchy of qfpsoa. The proposal made in this paper is based on the multiple inheritance hierarchy which is envisaged in a recent framework of head-driven Phrase Structure Grammar.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.792-803
• /
• 1999

Most data parallel language compilers are source-to-source translators. Most Compilers of HPF which is recognized as a standard data parallel language convert a parallel program in PHF in a Fortran 77 program inserted message passing primitives. By the way, they currently generate significant amount of ineffective codes in the course of the conversion. Especially, FORALL construct is converted into several DO loops, so loop overhead of these codes is very increased. In this paper, we define and use relation distance vector to keep necessary informations. Then we evaluate and analyze execution time for the codes converted by our method and by PARADIGM method for various array sizes.

• The Journal of Korean Association of Computer Education
• /
• v.16 no.6
• /
• pp.111-120
• /
• 2013

Programming novices have various difficulties when they learn C language for the first time. Novices have a large burden for understanding of a C language grammar, and have a tendency to focus on the grammar rather than problem solving. Moreover, it requires programming domains to arouse student's interest for software development. This paper presents a programming environment for C languages education focusing on a problem solving. To this end, this paper defines Tiny-VPL that is a simple visual programming language for NXT robot programming and presents robot programming environment using Tiny-VPL. This paper also presents an environment for NXT robot programming using Mini-C language which is a subset of C language. For the purpose of helping to understand the C syntax and semantics, the visual and interactive conversion system of Tiny-VPL to Mini-C is provided. Our programming environment can arouse student's interest through robot programming and can be used effectively for C language education focusing on problem solving with graphical and interactive conversion of the visual language Tiny-VPL to the textual language Mini-C.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.1177-1180
• /
• 2003

Recently, SystemC is one among the language observed. In Industry, there are many the languages that use Verilog. But, unskillful SystemC users must learn SystemC for conversion that from Verilog to SystemC and need time and effort for this. By these reason, feel necessity of easy and efficient conversion. This paper argues efficient methodology to change Verilog to SystemC. Abstract concepts of Verilog are proposed fittingly each one by one in SystemC.

• Korean Institute of Interior Design Journal
• /
• v.18 no.5
• /
• pp.71-79
• /
• 2009

This research understands semantics-system in contemporary space design as a poetic form. It provides that the possibility of various interpretation of space and makes to escape from insipid formal logic of compulsion uniform meaning. In order to unfold this argument, poetic semantics system has to be revealed using conversion of articulation factors in text of space(semantics and syntax). First of all, after setting up the articulation system of space language, we have to understand the conversion of articulation factors that generate a new grammar breaking up the rule of old syntax. And the various expression of form in Contemporary Space design focuses on a poetic expression, that is, the abstraction system fused by space factors(conversion of articulation system). In this method of research to recognize the subject of space in architecture, the importance of interpretation has to be highlighted, as the importance of language is emphasized that intermediates between object and interpretation. The reason to recognize Contemporary space design as a text is that it is a gathering of symbol as a object of interpretation and a mediator. The important issue of this study is to research how and what to transmit by poetic semantics system in contemporary space design. It brings about a poetic problem what it intends to becomes(the problem of meaning operation) in a narrow sense and a interpretational problem what it intends to do(the problem of communication). When we define interpretation the technique of defining a text, it involves the premise of inevitableness of multiple understanding, or the possibility to Interpret variously. In the end the ambiguity of poetic language and the infinity of moaning process as the moaning expansion system in contemporary space design is the flexible measure to solve the self-criticism.

• Journal of KIISE:Software and Applications
• /
• v.36 no.3
• /
• pp.244-251
• /
• 2009

We present a transformation which converts open-code multi-staged programs into closed ones. Staged computation, which explicitly divides a computation into separate stages, is a unifying framework for existing program generation systems. Because a multi-staged program generates another program, which can also generate a third program and on, the implementation of a multi-staged language is not straightforward. Dynamic binding of (lexically free) variables in code also makes the implementation of a multi-staged language hard. By converting each code into code of function which takes environment for free variables as its argument and giving an actual environment at the code-composition site, we can transform a open-code program into a closed-code one. Combining with Davies and Pfenning's method, our closed-code-conversion enables the implementation of the unstaged language to be useful for executing multi-staged programs. We also prove the correctness of our conversion: the converted program is equivalent to the original program, and the converted program does not have open code.

• Journal of English Language & Literature
• /
• v.57 no.6
• /
• pp.1131-1149
• /
• 2011

Michael McKeon, in The Origins of the English Novel, 1600-1740, sets forth a theoretical study of a large canon of seventeenth- and eighteenthcentury works, based upon the dialectic of genre formations, which attempts to analyze certain "instabilities" in generic and social categories- "instabilities" that McKeon identifies as "Questions of Truth" and "Questions of Virtue." In this paper, I argue with McKeon's optimistic reading of Samuel Richardson's work, Clarissa, or The History of Young Lady (1740), which concludes that-unlike Pamela's "manifest material and social empowerment"-Clarissa acquires "manifest discursive and imaginative empowerment" and "wins" (to use McKeon's terms) the "battle" with her antagonist, Robert Lovelace. What is difficult to accept in this reading of Clarissa is McKeon's claim that the "success" of Clarissa's resistance to Lovelace, despite the tragic rape, is evident in her "new-found power" which is represented in the heroine's spiritual "conversion"- her decision to die to protect her "version of truth and virtue." McKeon's spiritual "conversion" not only forces Clarissa to surrender her legal right to prosecute her rapist but also forces her to seek the shelter of her "father's house" in the afterlife because she can no longer "make others accept [her] own version of events as authoritative." Thus, in contrast to McKeon, I claim that Clarissa represents the necessary conditions for its heroine's "empowerment" primarily in language that suggests her manifest social invalidation; language which in particular emphasizes that her rape and torture by Lovelace forces Clarissa's spiritual "conversion" to seek her reward in the afterlife-thereby concluding that Clarissa's discursive and imaginative empowerment does not and cannot exist in the secular, material world.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.227-230
• /
• 2003

We can not distinguish semantism of the feature of the current language “big”, “small”, “beautiful”. But we study artificial linguistic interface work and convert natural language to digital binary linguistic theory, we should define the basical conversion process. When we utilize the sum of product fuzzy theory and the visible numerical value, we can establish reasoning rule of input language. Fuzzy theory should be converted to general resulting rule.