This book explores a powerful new algorithm that allows computer code to infer the types of data structures used in a program. This can greatly increase the efficiency of the code, as the need to check types at runtime is eliminated. The algorithm is based on the idea of recursive data types, which are structures that contain references to themselves. These types of structures are commonly used in computer programming, but traditional type-checking algorithms are unable to handle them. The author?s algorithm overcomes this limitation and allows for the first time the accurate typing of recursive data structures. The book provides a detailed explanation of the algorithm and its implementation. It also discusses the implications of the algorithm for the design of programming languages and compilers. This book is a valuable resource for computer scientists and programmers interested in improving the efficiency of their code. It provides a comprehensive overview of the state-of-the-art in type checking and offers a new algorithm that has the potential to revolutionize the way that compilers are designed.
"synopsis" may belong to another edition of this title.
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9780265439371
Quantity: 15 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9780265439371
Quantity: 15 available