Type classes and overloading resolution via order-sorted unification:
Abstract: "We present a type inference algorithm for a Haskell- like language based on order-sorted unification. The language features polymorphism, overloading, type classes and multiple inheritance. Class and instance declarations give rise to an order-sorted algebra of types; overloading res...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cambridge
1990
|
| Series: | Computer Laboratory <Cambridge>: Technical report
200 |
| Subjects: | |
| Summary: | Abstract: "We present a type inference algorithm for a Haskell- like language based on order-sorted unification. The language features polymorphism, overloading, type classes and multiple inheritance. Class and instance declarations give rise to an order-sorted algebra of types; overloading resolution is based on unification in this algebra. The semantics of the language is given by a translation into ordinary [lambda]- calculus, and we prove the correctness of our algorithm with respect to this semantics. In contrast to earlier work, our typing scheme is simpler, more general, and immediately leads to a typing algorithm." |
| Physical Description: | 16 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010411352 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951006s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)24313713 | ||
| 035 | |a (DE-599)BVBBV010411352 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Nipkow, Tobias |d 1958- |e Verfasser |0 (DE-588)17275660X |4 aut | |
| 245 | 1 | 0 | |a Type classes and overloading resolution via order-sorted unification |c by Tobias Nipkow and Gregor Snelting |
| 264 | 1 | |a Cambridge |c 1990 | |
| 300 | |a 16 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Computer Laboratory <Cambridge>: Technical report |v 200 | |
| 520 | 3 | |a Abstract: "We present a type inference algorithm for a Haskell- like language based on order-sorted unification. The language features polymorphism, overloading, type classes and multiple inheritance. Class and instance declarations give rise to an order-sorted algebra of types; overloading resolution is based on unification in this algebra. The semantics of the language is given by a translation into ordinary [lambda]- calculus, and we prove the correctness of our algorithm with respect to this semantics. In contrast to earlier work, our typing scheme is simpler, more general, and immediately leads to a typing algorithm." | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Lambda calculus | |
| 700 | 1 | |a Snelting, Gregor |e Verfasser |4 aut | |
| 830 | 0 | |a Computer Laboratory <Cambridge>: Technical report |v 200 |w (DE-604)BV004055605 |9 200 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006933310 | ||
Record in the Search Index
| _version_ | 1804124839646068736 |
|---|---|
| any_adam_object | |
| author | Nipkow, Tobias 1958- Snelting, Gregor |
| author_GND | (DE-588)17275660X |
| author_facet | Nipkow, Tobias 1958- Snelting, Gregor |
| author_role | aut aut |
| author_sort | Nipkow, Tobias 1958- |
| author_variant | t n tn g s gs |
| building | Verbundindex |
| bvnumber | BV010411352 |
| ctrlnum | (OCoLC)24313713 (DE-599)BVBBV010411352 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01712nam a2200337 cb4500</leader><controlfield tag="001">BV010411352</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951006s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24313713</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010411352</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nipkow, Tobias</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)17275660X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Type classes and overloading resolution via order-sorted unification</subfield><subfield code="c">by Tobias Nipkow and Gregor Snelting</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">200</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a type inference algorithm for a Haskell- like language based on order-sorted unification. The language features polymorphism, overloading, type classes and multiple inheritance. Class and instance declarations give rise to an order-sorted algebra of types; overloading resolution is based on unification in this algebra. The semantics of the language is given by a translation into ordinary [lambda]- calculus, and we prove the correctness of our algorithm with respect to this semantics. In contrast to earlier work, our typing scheme is simpler, more general, and immediately leads to a typing algorithm."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lambda calculus</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Snelting, Gregor</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">200</subfield><subfield code="w">(DE-604)BV004055605</subfield><subfield code="9">200</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006933310</subfield></datafield></record></collection> |
| id | DE-604.BV010411352 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:03Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006933310 |
| oclc_num | 24313713 |
| open_access_boolean | |
| physical | 16 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Computer Laboratory <Cambridge>: Technical report |
| series2 | Computer Laboratory <Cambridge>: Technical report |
| spelling | Nipkow, Tobias 1958- Verfasser (DE-588)17275660X aut Type classes and overloading resolution via order-sorted unification by Tobias Nipkow and Gregor Snelting Cambridge 1990 16 S. txt rdacontent n rdamedia nc rdacarrier Computer Laboratory <Cambridge>: Technical report 200 Abstract: "We present a type inference algorithm for a Haskell- like language based on order-sorted unification. The language features polymorphism, overloading, type classes and multiple inheritance. Class and instance declarations give rise to an order-sorted algebra of types; overloading resolution is based on unification in this algebra. The semantics of the language is given by a translation into ordinary [lambda]- calculus, and we prove the correctness of our algorithm with respect to this semantics. In contrast to earlier work, our typing scheme is simpler, more general, and immediately leads to a typing algorithm." Computer software sigle Mathematics sigle Mathematik Algorithms Lambda calculus Snelting, Gregor Verfasser aut Computer Laboratory <Cambridge>: Technical report 200 (DE-604)BV004055605 200 |
| spellingShingle | Nipkow, Tobias 1958- Snelting, Gregor Type classes and overloading resolution via order-sorted unification Computer Laboratory <Cambridge>: Technical report Computer software sigle Mathematics sigle Mathematik Algorithms Lambda calculus |
| title | Type classes and overloading resolution via order-sorted unification |
| title_auth | Type classes and overloading resolution via order-sorted unification |
| title_exact_search | Type classes and overloading resolution via order-sorted unification |
| title_full | Type classes and overloading resolution via order-sorted unification by Tobias Nipkow and Gregor Snelting |
| title_fullStr | Type classes and overloading resolution via order-sorted unification by Tobias Nipkow and Gregor Snelting |
| title_full_unstemmed | Type classes and overloading resolution via order-sorted unification by Tobias Nipkow and Gregor Snelting |
| title_short | Type classes and overloading resolution via order-sorted unification |
| title_sort | type classes and overloading resolution via order sorted unification |
| topic | Computer software sigle Mathematics sigle Mathematik Algorithms Lambda calculus |
| topic_facet | Computer software Mathematics Mathematik Algorithms Lambda calculus |
| volume_link | (DE-604)BV004055605 |
| work_keys_str_mv | AT nipkowtobias typeclassesandoverloadingresolutionviaordersortedunification AT sneltinggregor typeclassesandoverloadingresolutionviaordersortedunification |