Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
Reseña del editor
Excerpt from Polymorphic Type Inference and Semi-Unification
Mycroft that treats recursively defined functions equally and uniformly inside and outside their bodies.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Weitere beliebte Ausgaben desselben Titels
Suchergebnisse für Polymorphic Type Inference and Semi-Unification (Classic...
Foto des Verkäufers
Polymorphic Type Inference and Semi-Unification (Classic Reprint)
Print-on-DemandAnbieter: Forgotten Books, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9781334016257_0
Neu kaufen
EUR 16,34
Versand gratis
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Polymorphic Type Inference and Semi-Unification (Classic Reprint)
Anbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781334016257
Beispielbild für diese ISBN
Polymorphic Type Inference and Semi-Unification (Classic Reprint)
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781334016257
Neu kaufen
EUR 21,62
EUR 3,77 shipping
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 15 verfügbar