Excerpt 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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Excerpt 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.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 0,76 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoLibrería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332196029
Cantidad disponible: 15 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332196029
Cantidad disponible: 15 disponibles
Librería: Forgotten Books, London, Reino Unido
Paperback. Condición: New. Print on Demand. This book explores programming languages through the lens of lambda calculus, a foundational mathematical system for computation. The author argues that lambda calculus provides a simple yet powerful framework for understanding the structure and behavior of programming languages. The book covers a wide range of topics, including: - The representation of programs as lambda expressions - The interpretation of lambda expressions as functions - The use of lambda calculus to model programming language features such as variables, constants, expressions, assignments, and control structures - The application of lambda calculus to the problems of proving program equivalence and correctness This book is a valuable resource for anyone interested in the foundations of programming languages or the use of lambda calculus in computer science. The author's clear and concise exposition makes this book accessible to readers with a variety of backgrounds, from students to experienced researchers. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Nº de ref. del artículo: 9781332196029_0
Cantidad disponible: Más de 20 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 66 pages. 9.00x6.00x0.15 inches. In Stock. Nº de ref. del artículo: __1332196020
Cantidad disponible: 1 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 66 pages. 9.00x6.00x0.15 inches. This item is printed on demand. Nº de ref. del artículo: zk1332196020
Cantidad disponible: 1 disponibles