• Communications of the Korean Mathematical Society
• /
• v.11 no.1
• /
• pp.139-145
• /
• 1996

We show how some interesting results involving series summation and the digamma function are established by means of Riemann-Liouville operator of fractional calculus. We derive the relation $$ \frac{\Gamma(\lambda)}{\Gamma(\nu)} \sum^{\infty}_{n=1}{\frac{\Gamma(\nu+n)}{n\Gamma(\lambda+n)}_{p+2}F_{p+1}(a_1, \cdots, a_{p+1},\lambda + n; x/a)} = \sum^{\infty}_{k=0}{\frac{(a_1)_k \cdots (a_{(p+1)}{(b_1)_k \cdots (b_p)_k K!} (\frac{x}{a})^k [\psi(\lambda + k) - \psi(\lambda - \nu + k)]}, Re(\lambda) > Re(\nu) \geq 0 $$ and explain some special cases.

• Journal for History of Mathematics
• /
• v.17 no.4
• /
• pp.45-64
• /
• 2004

The lambda calculus is a mathematical formalism in which functions can be formed, combined and used for computation that is defined as rewriting rules. With the development of the computer science, many programming languages have been based on the lambda calculus (LISP, CAML, MIRANDA) which provides simple and clear views of computation. Furthermore, thanks to the "Curry-Howard correspondence", it is possible to establish correspondence between proofs and computer programming. The purpose of this article is to make available, for didactic purposes, a subject matter that is not well-known to the general public. The impact of the lambda calculus in logic and computer science still remains as an area of further investigation.stigation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.4
• /
• pp.178-185
• /
• 2008

This research presents an translation technique of encoding rewrite rules with patterns into the lambda calculus. We show, following the theory of Böhm separability, rewrite rules with distinctive patterns, called separable systems, can be translated into the lambda calculus. Moreover, according to the property of Böhm equivalence classes, we can also encode rewrite systems with default rules, which allows to interpret some of 'undefined' terms of TRSs as an identified lambda term.

• Journal for History of Mathematics
• /
• v.23 no.3
• /
• pp.45-56
• /
• 2010

Sequent Calculus is a symmetrical version of the Natural Deduction which Gentzen restructured in 1934, where he presents 'Hauptsatz'. In this thesis, we will examine why the Cut-Elimination Theorem has such an important status in Proof Theory despite of the efficiency of the Cut Rule. Subsequently, the dynamic side of Curry-Howard correspondence which interprets the system of Natural Deduction as 'Simply typed $\lambda$-calculus', so to speak the correspondence of Cut-Elimination and $\beta$-reduction in $\lambda$-calculus, will also be studied. The importance of this correspondence lies in matching the world of program and the world of mathematical proof. Also it guarantees the accuracy of program.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.10
• /
• pp.1261-1268
• /
• 2001

Despite of various useful features, functional languages do not provide an efficient way of representing states. To improve expressiveness of functional language, it is required a method representing explicit state without violating of functional semantic properties. In this paper, imperative functional language, $\lambda$st-calculus is designed to represent states without compromising the properties of pure functional languages. And we construct an algorithm to reduce proposed imperative functional language. $\lambda$st-calculus model which is an extension of the $\lambda$-calculus model with explicit state constructor without violating their semantic properties. it improves expressiveness of syntax through a concept of state composition and simplified reduction rules.

• Kyungpook Mathematical Journal
• /
• v.45 no.1
• /
• pp.1-11
• /
• 2005

Making use of the multidimensional fractional calculus operators introduced in [20], this paper gives the images under these operators of the celebrated Fox's H-function. Special cases are briefly point out, and some of the results are also studied on general spaces of functions $M_{\lambda}(R_{+}^n)$.

• Korean Journal of Mathematics
• /
• v.17 no.2
• /
• pp.127-145
• /
• 2009

In this paper we introduce a new subclass $K_{\mu}^{\lambda},{\phi},{\eta}(n;{\rho};{\alpha})$ of analytic and multivalent functions with negative coefficients using fractional calculus operators. Connections to the well known and some new subclasses are discussed. A necessary and sufficient condition for a function to be in $K_{\mu}^{\lambda},{\phi},{\eta}(n;{\rho};{\alpha})$ is obtained. Several distortion inequalities involving fractional integral and fractional derivative operators are also presented. We also give results for radius of starlikeness, convexity and close-to-convexity and inclusion property for functions in the subclass. Modified Hadamard product, application of class preserving integral operator and other interesting properties are also discussed.

• 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 언어에서 정확도가 떨어지는 경우는 앞으로 계산할 값의 인자가 쓰이지 않는 경우임을 밝혀내었다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.3
• /
• pp.141-149
• /
• 2008

Most functional programming languages allows programmers to write ambiguous rules, under the strategy that pattern-matching will be performed in a direction of 'from top to bottom' way. While providing programmers with convenience and intuitive understanding of defining default rules, such ambiguous rules may make the semantics of functional languages unclear. More specifically, it may fail to apply the equational reasoning, one of most significant advantage of functional programming, and may cause to obscure finding a formal way of translating functional languages into the ${\lambda}$-calculus; as a result, we only get an ad hoc translation. In this paper, we associate with separability of term rewriting systems, holding purely-declarative property, pattern-matching semantics of lazy functional languages. Separability can serve a formalism for translating lazy functional languages into the ${\lambda}$-calculus.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.11a
• /
• pp.175-176
• /
• 2010