• Title/Summary/Keyword: 재귀 타입

Search Result 4, Processing Time 0.019 seconds

To Design a Type System for Recursive Module Programming (재귀모듈 프로그래밍을 위한 타입시스템의 설계)

  • Im, Hyeon-Seung;Lim, Jeong-Pyo;Park, Sung-Woo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06a
    • /
    • pp.422-424
    • /
    • 2012
  • ML 언어에서 제공하는 모듈 시스템은 강력한 모듈화 프로그래밍과 데이터 추상화를 지원함에도 불구하고 재귀모듈을 지원하지 못한다는 점이 단점으로 지적되어 왔다. 재귀모듈을 이용하면 상호의존적이지만 개념적으로는 서로 분리된 소프트웨어 컴포넌트들을 각각 다른 모듈에 작성할 수 있기 때문에 코드의 재사용성을 더욱 증진시킬 수 있다. 이러한 중요성 때문에 재귀모듈은 지난 10년 동안 프로그래밍 언어 분야에서 깊이 있게 연구되어 왔다. 그러나 기존 연구는 복시문제와 순환타입문제를 완벽하게 해결하지 못하여 한정된 재귀모듈 프로그래밍 패턴만을 지원하는 한계점이 있다. 본 논문에서는 복시문제와 순환타입 문제를 해결하고 다양한 재귀모듈 패턴을 지원하는 타입시스템을 제안한다.

Coinductive Subtyping for Recursive and Union Types (재귀 타입과 합집합 타입을 위한 코인덕션 서브타이핑)

  • Im, Hyeonseung
    • Journal of KIISE
    • /
    • v.43 no.12
    • /
    • pp.1342-1350
    • /
    • 2016
  • Induction and coinduction are well-established proof principles, which are widely used in mathematics and computer science. In particular, induction is taught in most undergraduate programs and well understood in the field of computer science. In contrast, coinduction is not as widespread or well understood as induction. In this paper, we introduce coinduction by defining a subtype system for recursive and union types and proving the transitivity property of the system. This paper will help to promote familiarity with coinduction and provides a basis for a subtype system for recursive types with other advanced type constructors and connectives.

Template Fusion for Fingerprint Recognition (지문 등록을 위한 템플릿 융합 알고리즘)

  • 류춘우;문지현;김학일
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.2
    • /
    • pp.51-64
    • /
    • 2004
  • This paper proposes an algerian of generating a tuner-template from multiple fingerprint impressions using a data fusion technique for fingerprint enrollment. The super-template is considered as a single fingerprint template which contains most likely true minutiae based on multiple fingerprint images. The proposed algorithm creates the super template by utilizing a recursive Bayesian estimation method (RBEM), which assumes a sequential fingerprint input model and estimates the credibility of the minutiae in previous input templates froma current input template. Consequently. the RBEM assigns a higher credibility to commonly detectable minutiae from several input templates and a lower credibility to rarely found minutiae from other input templates. Likewise, the RBEM is able to estimate a credibility of the minutia type (ridge ending or bifurcation). Preliminary experiments demonstrate that, as the number of fingerfrint images increases, the performance of recognition can be improved while maintaining the processing time and the size of memory storage for tile super-template almost constant.

Inline Binding For XNL DataInline Binding For XML Data (XML 데이터의 인라인 바인딩 방법)

  • Lee Eun-Jung;Yoo Ga-Yeon
    • The KIPS Transactions:PartA
    • /
    • v.13A no.1 s.98
    • /
    • pp.71-78
    • /
    • 2006
  • For using XML data in programming languages, there is a data binding method, which generates classes from XML type definitions. However, since existing binding frameworks for this method generate all classes for element definitions, the number of generated classes becomes large and the complexity of the overall application system gets high. In this research, we propose an inline binding method for selecting necessary classes from element definitions. In the proposed method, classes are created only for elements with repetitions and recursions, and they include fields for values of terminal elements. We introduce a generation algorithm for binding classes and the marshaling methods for recovering the omitted paths. We develop IBinder system to validate the proposed method and compare the generated codes with the ones of existing systems. As a result, we carl show that the number of generated classes decrease substantially compared to other systems.