Excerpt from Recursive Data Types in Setl: Automatic Determination, Data Language Description, and Efficient Implementation
The semantic level of a programming language is characterized by the degree to which a programmer must pay attention to implementation details: the higher level the language, the less need be supplied and the more natural the expressibn of the algorithm. In order to facili tate the natural expression of algorithms, many high level languages free the programmer from the burden of statically typing program variables through declarative statements. In addition, data types far removed from those actually implementable via the hardware are pro vided, again to mask questions of implementation. Thus, compare the classical concordance program written in pl/i, where table handling is the programmer's responsibility, and in.
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.
"synopsis" may belong to another edition of this title.
Shipping:
FREE
From United Kingdom to U.S.A.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. Print on Demand. This book delves into the fascinating world of programming languages, specifically exploring the challenges and opportunities presented by recursive data types. These complex data structures, which can reference themselves within their own definition, have long posed a significant challenge for compilers and interpreters of high-level languages. The author, building upon previous work by Tenenbaum and others, presents a novel approach to the automated type determination of such structures, showcasing its potential to unlock a new level of efficiency and clarity in programming. The book explores the challenges inherent in programming languages lacking explicit type declarations, highlighting the need for algorithms that can infer type information from program structure. The author meticulously outlines the shortcomings of existing typending algorithms, particularly their inability to handle the intricate nature of recursive data types. The book then presents a compelling solution, proposing a new algorithm that effectively identifies and types these structures, ultimately enabling the generation of more efficient machine code and leading to more robust and reliable programs. The book's insights on this critical area of computer science offer a valuable contribution to the ongoing quest for more expressive and efficient programming languages. 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. Seller Inventory # 9781332185740_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332185740
Quantity: 15 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332185740
Quantity: 15 available