• Journal of the Korean Mathematical Society
• /
• v.43 no.1
• /
• pp.11-28
• /
• 2006

The existence, uniqueness and iterative approximation of solutions for a few classes of functional equations arising in dynamic programming of multistage decision processes are discussed. The results presented in this paper extend, improve and unify the results due to Bellman [2, 3], Bhakta-Choudhury [6], Bhakta-Mitra [7], and Liu [12].

• Communications of the Korean Mathematical Society
• /
• v.24 no.1
• /
• pp.67-83
• /
• 2009

Several common fixed point theorems for a few contractive type mappings in complete metric spaces are established. As applications, the existence and uniqueness of common solutions for certain systems of functional equations arising in dynamic programming are discussed.

• 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 applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.717-730
• /
• 2002

In this paper we use measure theory to solve a wide range of the nonlinear programming problems. First, we transform a nonlinear programming problem to a classical optimal control problem with no restriction on states and controls. The new problem is modified into one consisting of the minimization of a special linear functional over a set of Radon measures; then we obtain an optimal measure corresponding to functional problem which is then approximated by a finite combination of atomic measures and the problem converted approximately to a finite-dimensional linear programming. Then by the solution of the linear programming problem we obtain the approximate optimal control and then, by the solution of the latter problem we obtain an approximate solution for the original problem. Furthermore, we obtain the path from the initial point to the admissible solution.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.4
• /
• pp.34-42
• /
• 1996

Robot programming has been discussed in detail during the recent years. Numerous studies in particular presented relevance, solution concepts and implementation of off-line programming. In this paper a new user-friendly robot programming method is introduced, which permits the implicit description and programming of assembly process. On the functional level of programming, the assembly processes are described in terms of their operational functions. On the language level, the individual functions are then translated into commands for the robots.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.573-585
• /
• 2008

A few sufficient conditions for the existence and uniqueness of fixed point and common fixed point for certain contractive type mappings in complete metric spaces are provided. Several existence and uniqueness results of solution and common solution for some functional equations and system of functional equations in dynamic programming are discussed by using the fixed point and common fixed point theorems presented in this paper.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.2
• /
• pp.111-119
• /
• 2023

In this paper, we investigate the feasibility of functional programming in the Scala language. The main issue is to what extent Scala is able to handle major properties of functional programming such as lambda expression, high-order functions, generic types, algebraic data types, and monads. For this purpose, we implement an interpreter of an imperative language. In this implementation, the same functional programming techniques are applied to both Haskell and Scala languages, and then these two versions of implementations are compared and analyzed. The abstract syntax tree of an imperative language is expressed as algebraic data types with generics and enum classes in Scala, and the state transition of imperative languages is implemented by using state monad. Extension and given, new features of Scala, are used as well.

• Journal of KIISE:Software and Applications
• /
• v.37 no.5
• /
• pp.403-410
• /
• 2010

Monad in Haskell allows one to do imperative-style programming as well as pure functional programming. In this work, we characterize monadic abstraction and its programming technique by restructuring an assembly language interpreter coded in pure functional style into the one by the monadic style. Monad programming consists of two phases; the State monad is applied to a stack and a symbol table, and then a State Monad Transformer integrating these two monads is constructed. As a result, we can see that the program code by monad programming is much clearer and more intuitive than one written in the pure functional style.

• Journal of Engineering Education Research
• /
• v.15 no.3
• /
• pp.66-71
• /
• 2012

In this paper, we try to explore basic factors that defines easy-to-learn programming language and easy-to-learn development environments for novice students who have not been exposed to computer programming language education. For these purpose, we investigate and analyze computer programming languages that are widely used in industrial environments, and present the summary and analyzed results. From the experimental results, most novice programmers understand computer programming languages in terms of procedural programming languages rather than in terms of functional programming languages or object oriented programming languages. Furthermore, we have found that, for effective education of basic level programming languages, factors of development environments are much more important than factors of programming paradigms that the computer programming languages are based on.

• 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.