Andere Kunden interessierten sich auch für
![Learn Java Fundamentals]( "Learn Java Fundamentals")
Learn Java Fundamentals46,99 €![Pascal at Work and Play]( "Pascal at Work and Play")
Pascal at Work and Play73,99 €![Deploying .Net Applications]( "Deploying .Net Applications")
Deploying .Net Applications35,99 €![ECOOP 2003 - Object-Oriented Programming]( "ECOOP 2003 - Object-Oriented Programming")
ECOOP 2003 - Object-Oriented Programming83,99 €![Data Types and Persistence]( "Data Types and Persistence")
Data Types and Persistence83,99 €![Practical .Net for Financial Markets]( "Practical .Net for Financial Markets")
Practical .Net for Financial Markets102,99 €![Practical .NET for Financial Markets]( "Practical .NET for Financial Markets")
Practical .NET for Financial Markets53,99 €
Functional programming; Haskell, Gofer; type theory.
This book describes the use of qualified types to provide a general framework for the combination of polymorphism and overloading. For example, qualified types can be viewed as a generalization of type classes in the functional language Haskell and the theorem prover Isabelle. These in turn are extensions of equality types in Standard ML. Other applications of qualified types include extensible records and subtyping. Using a general formulation of qualified types, the author extends the Damas/Milner type inference algorithm to support qualified types, which in turn specifies the set of all possible types for any term. In addition, he describes a new technique for establishing suitable coherence conditions that guarantee the same semantics for all possible translations of a given term. Practical issues that arise in concrete implementations are also discussed, concentrating in particular on the implementation of overloading in Haskell and Gofer, a small functional programming system developed by the author.
Table of content:
1. Introduction; 2. Predicates; 3. Type inference for qualified types; 4. Evidence; 5. Semantics and coherence; 6. Theory into practice; 7. Type classes in Haskell; 8. Type classes in Gofer; 9. Summary and future work; 10. Epilogue; Appendix; References; Index.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
This book describes the use of qualified types to provide a general framework for the combination of polymorphism and overloading. For example, qualified types can be viewed as a generalization of type classes in the functional language Haskell and the theorem prover Isabelle. These in turn are extensions of equality types in Standard ML. Other applications of qualified types include extensible records and subtyping. Using a general formulation of qualified types, the author extends the Damas/Milner type inference algorithm to support qualified types, which in turn specifies the set of all possible types for any term. In addition, he describes a new technique for establishing suitable coherence conditions that guarantee the same semantics for all possible translations of a given term. Practical issues that arise in concrete implementations are also discussed, concentrating in particular on the implementation of overloading in Haskell and Gofer, a small functional programming system developed by the author.
Table of content:
1. Introduction; 2. Predicates; 3. Type inference for qualified types; 4. Evidence; 5. Semantics and coherence; 6. Theory into practice; 7. Type classes in Haskell; 8. Type classes in Gofer; 9. Summary and future work; 10. Epilogue; Appendix; References; Index.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.