Excerpt from Polymorphic Type Inference and Semi-Unification
Most programming languages provide the notion of types as their most fundamental abstraction from the unstructured universe of basic computer structures. Ivhile some languages perform type checking checking for type consistent usage of program objects at run-time lisp, prolog, apl), others do it at compile-time (pascal, Ada, ML, Doing it at compile time has the advantage that type errors, a common form of errors, are detected before the program is run. This usually comes at the price of cumbersome explicit type, variable and other declarations. Recently languages such as ML [32] have been designed that try to combine the safety of compile-time type checking with the flexibility of declaration-less programming by inferring type information from the program rather than insisting on extensive declarations. Ml''s type discipline allows for definition and use of (parametric) polymorphic functions; that is, functions that operate uniformly on arguments that may range over a variety of_ types.
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
This book was originally published prior to 1923, and represents a reproduction of an important historical work, maintaining the same format as the original work. While some publishers have opted to apply OCR (optical character recognition) technology to the process, we believe this leads to sub-optimal results (frequent typographical errors, strange characters and confusing formatting) and does not adequately preserve the historical character of the original artifact. We believe this work is culturally important in its original archival form. While we strive to adequately clean and digitally enhance the original work, there are occasionally instances where imperfections such as blurred or missing pages, poor pictures or errant marks may have been introduced due to either the quality of the original work or the scanning process itself. Despite these occasional imperfections, we have brought it back into print as part of our ongoing global book preservation commitment, providing customers with access to the best possible historical reprints. We appreciate your understanding of these occasional imperfections, and sincerely hope you enjoy seeing the book in a format as close as possible to that intended by the original publisher.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : 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. N° de réf. du vendeur 9781334016257_0
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781334016257
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781334016257
Quantité disponible : 15 disponible(s)