• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.464-469
• /
• 2005

The imperative programming language like C language is Generally used when we develop the game program. But there is the need of much effort and time on low-level-details in order to express the game program that has complicated and varied motion. I will try to take measures to use the pure functional language, Haskell as the method of simplifying complex game program. The pure functional programming language like Haskell has excellence of technology and it has become specific in many domains. In this paper I'll discuss the difference between The two languages and merits and demerits in the game development aspect. Also discuss the possibility of putting Haskell to practical use in the future.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06c
• /
• pp.516-520
• /
• 2007

이 논문에서는 다단계 프로그램의 실행흐름을 타입을 기반으로 분석하는 방법을 제시하고 있다. 다단계 프로그램이란 실행 중 코드를 만들고 실행할 수 있는 언어를 말한다. 본 논문에서는 기존의 고차 함수형 언어의 실행흐름을 분석하는 방법을 다단계 언어를 위해서 확장한 방법을 제시하고 있다. 이 분석은 한 수식이 평가될 때 호출될 수 있는 함수들의 집합을 정적으로 분석하여 다단계 프로그램의 실행흐름 정보를 제공한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.394-396
• /
• 2004

함수형 언어를 사용하여 작성한 응용 어플리케이션은 성능이 떨어진다는 생각이 지배적이다. 함수형 언어 ERLANG은 성능이 우수한 통신응용프로그램을 작성하기 위하여 개발되었다. ERLANG으로 작성한 웹서버인 YAWS는 범용 웹서버와 성능면에서 뒤지지 않지만 모든 웹 프로그래밍 언어를 지원하지 않는다. 본 연구는 Jsp/Servlets을 서비스 할 수 있도록 YAWS의 기능을 개선하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.76-78
• /
• 2001

Secure Lambda calculus(SLam)는 정보 보안을 보장해주는 언어이나, Continuation Passing Style(CPS) 변환 후에는 안전성 분석의 정확도가 떨어진다. CPS의 논리적인 성질(ordered linearity)을 반영하여 변환 후에도 정확도가 떨어지지 않는 타입 시스템을 고안하고 무간섭성을 증명하였다. 함수형 SLam 언어에서 정확도가 떨어지는 경우는 앞으로 계산할 값의 인자가 쓰이지 않는 경우임을 밝혀내었다.

• Annual Conference on Human and Language Technology
• /
• 2020.10a
• /
• pp.93-97
• /
• 2020

본 연구는 딥 러닝 기반 의존 구문 분석에서, 학습에 적용하는 손실 함수에 따른 성능을 평가하였다. Pointer Network를 이용한 Left-To-Right 모델을 총 세 가지의 손실 함수(Maximize Golden Probability, Cross Entropy, Local Hinge)를 이용하여 학습시켰다. 그 결과 LH 손실 함수로 학습한 모델이 선행 연구와 같이 MGP 손실 함수로 학습한 것에 비해 UAS/LAS가 각각 0.86%p/0.87%p 상승하였으며, 특히 의존 거리가 먼 경우에 대하여 분석 성능이 크게 향상됨을 확인하였다. 딥러닝 의존 구문 분석기를 구현할 때 학습모델과 입력 표상뿐만 아니라 손실 함수 역시 중요하게 고려되어야 함을 보였다.

• Journal of the Korea Convergence Society
• /
• v.7 no.4
• /
• pp.173-180
• /
• 2016

OpenCV is a programming language used in digital image processing and computer vision. In this study, look at media arts made using OpenCV programming language and find out about the utilization possibilities. To this end, the first, look at OpenCV functions that are frequently used in media art, the examples of utilizing the functions. The second, discuss media arts using OpenCV. focused on the OpenCV functions, programming language for an production of media art. The third, analyze features of media arts using OpenCV, mainly focused on the functions and programming languages. The study may provide guidance to the artists to produce a media art using the OpenCV or programming language.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2435-2446
• /
• 1998

In this paper. We describe a dataflow model for efficient execution of a functional logic language and a method of translation a functional logic language into a dataflow graph. To explore parallelism and intelligent backtracking, we us model in which clause and function are represented as independent dataflow graph. The node denotes basic actions to be performed when the clause and function are executed. The dataflow mechanism allows an operation to be executed as soon as all its operands are available. Since the operations can never be executed earlier, a dataflow model is an excellent base for increasing execution speed. We did decrease a delay time with concurrent execution of dependency analysis and subgoal.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.1
• /
• pp.192-201
• /
• 2001

It has been a long standing problem in research of pure functional programming to program side-effect, input/output, exception handling, nondeterminism, and etc, preserving declarative property and lazy-evaluation of pure functional languages. Being introduced in 1989, Monadic approach has been suggested as a solution to this problem. In this paper, we introduce the principle of functional monadic programming and its various application techniques using the Pure functional language Haskell.

• Journal of KIISE:Software and Applications
• /
• v.29 no.11
• /
• pp.826-836
• /
• 2002

We need an enormous amount of memories for name spaces as well as additional processors if we are to effectively exploit a massively parallelism in nested loops of functional languages such as Id. If there is no sufficient amount of memories enough to exploit that parallelism, the execution of programs can be aborted during the unfolding of loops. Additionally, if loops are overunfolded, compared with the number of processors available, the system performance can be degraded severely due to the overhead of loop unfolding. This paper suggests and analyzes an algorithm which can be used to effectively unfold nested loops of functional languages on multithreaded architectures. This algorithm has a feature to unfold a given nested loop safely and near optimally, considering the system resources of processors and memories available when the loop is to be unfolded.

• The KIPS Transactions:PartA
• /
• v.13A no.6 s.103
• /
• pp.481-488
• /
• 2006

FRP(Functional Reactive Programming) is a kind of embedded language in Haskell, it declaratively program reactive system based on two essential high-order types named behavior and events. This Paper design and implementation RT-FRP(Real-time Functional Reactive Programming) translator for using FRP in embedded systems with many constraints. The RT-FRP translator generates a C Program from an RT-FRP program according to the operational semantics of the RT-FRP language. To show the effectiveness of the RT-FRP translator, we loaded and executed the test program generated by the translator onto a real embedded system, LEGO Mindstorm. According to the experimental result, the reactive system software can be programmed more concisely using RT-FRP than using an imperative counter part although the size of the binary code is rather increased.