This book delves into the intricate world of type inference, a crucial concept in the development of programming languages. The author explores the computational implications of different type systems, comparing and contrasting the capabilities of various approaches like the Hindley Calculus, the Milner Calculus, and the Milner-Mycroft Calculus. This book traces the evolution of type inference from its roots in the Curry-Hindley Calculus to its more sophisticated forms, highlighting the challenges and advancements in the field. The book examines the relationship between type inference and a problem called semi-unification, a complex mathematical challenge that involves solving inequalities between terms. This connection illuminates the underlying logic and complexity of type inference, offering a new perspective on the practical and theoretical limitations of this essential programming language feature. The author's insightful analysis of semi-unification helps explain the apparent paradox of type inference being both theoretically intractable and practically successful in many programming languages. This book provides a comprehensive exploration of type inference, its theoretical underpinnings, and its practical applications, offering valuable insights for computer scientists, programmers, and anyone interested in the evolution of programming languages.
"synopsis" may belong to another edition of this title.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. Print on Demand. This book delves into the intricate world of type inference, a crucial concept in the development of programming languages. The author explores the computational implications of different type systems, comparing and contrasting the capabilities of various approaches like the Hindley Calculus, the Milner Calculus, and the Milner-Mycroft Calculus. This book traces the evolution of type inference from its roots in the Curry-Hindley Calculus to its more sophisticated forms, highlighting the challenges and advancements in the field. The book examines the relationship between type inference and a problem called semi-unification, a complex mathematical challenge that involves solving inequalities between terms. This connection illuminates the underlying logic and complexity of type inference, offering a new perspective on the practical and theoretical limitations of this essential programming language feature. The author's insightful analysis of semi-unification helps explain the apparent paradox of type inference being both theoretically intractable and practically successful in many programming languages. This book provides a comprehensive exploration of type inference, its theoretical underpinnings, and its practical applications, offering valuable insights for computer scientists, programmers, and anyone interested in the evolution of 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 # 9781334016257_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-9781334016257
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781334016257
Quantity: 15 available