Results 1 
3 of
3
For more information about Current Contents on Diskette”’, telephone tollfree 8003364474. Outside the US and Canada, call 2153860100, ext. 1483, or contact the nearest ISI@ representative listed on the inside front cover of thk issue of Current Conte
 Proceedings of TACAS’98
, 1998
"... Proceedings ..."
Extending Partial Combinatory Algebras
, 1999
"... Introduction Consider a structure A = hA; s; k; \Deltai, where A is some set containing the distinguished elements s; k, equipped with a binary operation \Delta on A, called application, which may be partial. Notation 1.1. 1 Instead of a \Delta b we write ab; and in writing applicative expression ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Introduction Consider a structure A = hA; s; k; \Deltai, where A is some set containing the distinguished elements s; k, equipped with a binary operation \Delta on A, called application, which may be partial. Notation 1.1. 1 Instead of a \Delta b we write ab; and in writing applicative expressions, the usual convention of association to the left is employed. So for elements a; b; c 2 A, the expression aba(ac) is short for ((a \Delta b) \Delta a) \Delta (a \Delta c). 2 ab # will mean that ab is defined; ab " means that ab is not defined. Obviously, an applicative expression
A lambdatoCL Translation for Strong Normalization
, 1997
"... . We introduce a simple translation from calculus to combinatory logic (cl) such that: A is an sn term iff the translation result of A is an sn term of cl (the reductions are fireduction in calculus and weak reduction in cl). None of the conventional translations from calculus to cl satisfy t ..."
Abstract
 Add to MetaCart
. We introduce a simple translation from calculus to combinatory logic (cl) such that: A is an sn term iff the translation result of A is an sn term of cl (the reductions are fireduction in calculus and weak reduction in cl). None of the conventional translations from calculus to cl satisfy the above property. Our translation provides a simpler sn proof of Godel's calculus by the ordinal number assignment method. By using our translation, we construct a homomorphism from a conditionally partial combinatory algebra which arises over sn terms to a partial combinatory algebra which arises over sn clterms. 1 Introduction We often find some translations from calculus to combinatory logic (cl) provide a pleasing viewpoint in the study of calculus. The most typical example can be found in the study of the equational theories and the model theories of calculus. The translations from calculus to cl have been investigated comprehensively by Curry school [8], and we come to know ...