We derive a simple abstract machine for lazy evaluation of the lambda calculus, starting from Launchbury's natural semantics. Lazy evaluation here means non-strict evaluation with sharing of argument evaluation, that is, call-by-need. The machine we derive is a lazy version of Krivine's abstract machine, which was originally designed for call-by-name evaluation. We extend it with datatype const...

cosmological argument has been one of the most significant philosophical and theological arguments in religious traditions of different religions. in the western theo-philosophical tradition, there have been both different interpretations and numerous criticisms presented about this argument. in this article, the most important of those arguments and their criticisms are both taken into conside...

In physical problems often the modified Bessel functions Kniz) with complex argument z occur, or the Hankel functions of the first kind Hn\z) which are related to Kniz) hyKniz) = iir/2)in+1Hna\iz), with i = (-l)m. Computationally rapid and fairly exact procedures are available for the evaluation of these functions for real or imaginary argument either by recurrence, [1], [2], or by polynomial a...

In relatively free word order languages, grammatical functions are intricately related to case marking. Assuming an ordered representation of the predicate-argument structure, this work proposes a Combinatory Categorial Grammar formulation of relating surface case cues to categories and types for correctly placing the arguments in the predicateargument structure. This is achieved by assigning c...

In this paper, we propose a task for quality evaluation of disputing argument. In order to understand the disputation behavior, we propose three sub-tasks, detecting disagreement hierarchy, refutation method and argumentation strategy respectively. We first manually labeled a real dataset collected from an online debating forum. The dataset includes 45 disputing argument pairs. The annotation s...