Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherForgotten Books
ISBN-101332196020
ISBN-139781332196029
eBay Product ID (ePID)246700586
Product Key Features
Book TitleSimple Lambda-Calculus Model of Programming Languages (Classic Reprint)
Number of Pages66 Pages
LanguageEnglish
Publication Year2015
TopicGeneral, Calculus
IllustratorYes
GenreMathematics, History
AuthorS. Kamal Abdali
FormatTrade Paperback
Dimensions
Item Height0.1 in
Item Weight3.5 Oz
Item Length9 in
Item Width6 in
Additional Product Features
Intended AudienceTrade
TitleLeadingA
SynopsisExcerpt from A Simple Lambda-Calculus Model of Programming Languages Identity of le's is indicated by the symbol which is also used as a definition symbol. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works., Excerpt from A Simple Lambda-Calculus Model of Programming Languages We present a simple correspondence between a large subset of Algol 60 language and lambda-calculus. With the aid of this correspondence, a program can be translated into a single lambda-expression. In general, the representation of a program is specified by means of a system of simultaneous conversion relations among the representations of the program constituents. High-level programming language features are treated directly, not in terms of the representations of machine-level operations. The model includes input-output in such a way that when the representation of a (convergent) program is applied to the input item representations, the resulting combination reduces to a tuple of the representations of the output items. This model does not introduce any imperative notions into the calculus; the descriptive programming constructs, such as expressions, and the imperative ones, such as assignments and jumps, are translated alike into pure lambda-expressions. The applicability of the model to the problems of proving program equivalence and correctness is illustrated by means of simple examples. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.