Add to ORKGThis paper introduces a sequence of lambda-expressions, modelling the binaryexpansion of integers. We derive expressions computing the testfor zero, the successor function, and the predecessor function, therebyshowing the sequence to be an adequate numeral system. These functionscan be computed efficiently. Their complexity is independent ofthe order of evaluation.Keywords: Programming calculi, lambda-calculus, functional programming
In the first part, we introduce binary representations of both lambda calculus and combinatory logic...
AbstractAn implementation oriented modification of lambda-calculus is presented together with some a...
U ovom završnom radu prikazane su osnovne karakteristike lambda računa kao formalnog sustava za izra...
This paper introduces a sequence of lambda-expressions modelling the binary expansion of integers. W...
Abstract: : In this work, we present preliminary study of Lambda Calculus in the field of computabil...
The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathemati...
International audienceIn a paper entitled Binary lambda calculus and combinatory logic, John Tromp p...
Abstract. We argue that a compact right-associated binary number representation gives simpler operat...
Lambda-calculus is a language introduced by Church in 1930 aiming to build a logical basis for mathe...
We investigate numeral systems in the lambda calculus; specifically in the linear lambda calculus wh...
The lambda calculus has frequently been used as an intermediate representation for programming langu...
In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way o...
abstract: Natural Language Processing is a subject that combines computer science and linguistics, a...
Abstract. In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a si...
AbstractLambda-SF-calculus can represent programs as closed normal forms. In turn, all closed normal...
In the first part, we introduce binary representations of both lambda calculus and combinatory logic...
AbstractAn implementation oriented modification of lambda-calculus is presented together with some a...
U ovom završnom radu prikazane su osnovne karakteristike lambda računa kao formalnog sustava za izra...
This paper introduces a sequence of lambda-expressions modelling the binary expansion of integers. W...
Abstract: : In this work, we present preliminary study of Lambda Calculus in the field of computabil...
The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathemati...
International audienceIn a paper entitled Binary lambda calculus and combinatory logic, John Tromp p...
Abstract. We argue that a compact right-associated binary number representation gives simpler operat...
Lambda-calculus is a language introduced by Church in 1930 aiming to build a logical basis for mathe...
We investigate numeral systems in the lambda calculus; specifically in the linear lambda calculus wh...
The lambda calculus has frequently been used as an intermediate representation for programming langu...
In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way o...
abstract: Natural Language Processing is a subject that combines computer science and linguistics, a...
Abstract. In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a si...
AbstractLambda-SF-calculus can represent programs as closed normal forms. In turn, all closed normal...
In the first part, we introduce binary representations of both lambda calculus and combinatory logic...
AbstractAn implementation oriented modification of lambda-calculus is presented together with some a...
U ovom završnom radu prikazane su osnovne karakteristike lambda računa kao formalnog sustava za izra...