Qualified types: theory and practice
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 exte...
Saved in:
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
1994
|
| Series: | Distinguished dissertations in computer science
|
| Links: | https://doi.org/10.1017/CBO9780511663086 |
| Summary: | 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. |
| Physical Description: | 1 Online-Ressource (xii, 157 Seiten) |
| ISBN: | 9780511663086 |
Staff View
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9780511663086 | ||
| 003 | UkCbUP | ||
| 005 | 20151005020622.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 091215s1994||||enk o ||1 0|eng|d | ||
| 020 | |a 9780511663086 | ||
| 100 | 1 | |a Jones, Mark P. | |
| 245 | 1 | 0 | |a Qualified types |b theory and practice |c Mark P. Jones |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1994 | |
| 300 | |a 1 Online-Ressource (xii, 157 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 490 | 1 | |a Distinguished dissertations in computer science | |
| 520 | |a 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. | ||
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521472531 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521543262 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9780511663086 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Record in the Search Index
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9780511663086 |
|---|---|
| _version_ | 1827038448647667714 |
| adam_text | |
| any_adam_object | |
| author | Jones, Mark P. |
| author_facet | Jones, Mark P. |
| author_role | |
| author_sort | Jones, Mark P. |
| author_variant | m p j mp mpj |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01829nam a2200265 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9780511663086</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20151005020622.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">091215s1994||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511663086</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jones, Mark P.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Qualified types</subfield><subfield code="b">theory and practice</subfield><subfield code="c">Mark P. Jones</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xii, 157 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Distinguished dissertations in computer science</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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. </subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521472531</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521543262</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9780511663086</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9780511663086 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-19T15:54:03Z |
| institution | BVB |
| isbn | 9780511663086 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xii, 157 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Distinguished dissertations in computer science |
| spelling | Jones, Mark P. Qualified types theory and practice Mark P. Jones Cambridge Cambridge University Press 1994 1 Online-Ressource (xii, 157 Seiten) txt c cr Distinguished dissertations in computer science 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. Erscheint auch als Druck-Ausgabe 9780521472531 Erscheint auch als Druck-Ausgabe 9780521543262 |
| spellingShingle | Jones, Mark P. Qualified types theory and practice |
| title | Qualified types theory and practice |
| title_auth | Qualified types theory and practice |
| title_exact_search | Qualified types theory and practice |
| title_full | Qualified types theory and practice Mark P. Jones |
| title_fullStr | Qualified types theory and practice Mark P. Jones |
| title_full_unstemmed | Qualified types theory and practice Mark P. Jones |
| title_short | Qualified types |
| title_sort | qualified types theory and practice |
| title_sub | theory and practice |
| work_keys_str_mv | AT jonesmarkp qualifiedtypestheoryandpractice |