Polymorphic dynamic typing: aspects of proof theory and inference
Abstract: "We study dynamic typing in continuation of Henglein's dynamically typed [lambda]-calculus, with particular regard to proof theoretic aspects and aspects of polymorphic completion inference. Dynamically typed [lambda]-calculus provides a formal framework within which we can reaso...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
København
DIKU
1995
|
| Schriftenreihe: | Datalogisk Institut <København>: DIKU-Rapport
1995,9 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We study dynamic typing in continuation of Henglein's dynamically typed [lambda]-calculus, with particular regard to proof theoretic aspects and aspects of polymorphic completion inference. Dynamically typed [lambda]-calculus provides a formal framework within which we can reason in a precise manner about properties of the process of completion for higher order programming languages. Completions arise from raw programs by insertion of type coercions which model run-time type operations of tagging and checking/untagging. Central among the problems studied in dynamic typing are the notions of minimization of run-time type coercions in completions and safety of completions. From the monomorphic framework of Henglein's system, we work towards a polymorphic generalization which eventually comprises Hindley-Milner style polymorphism, discriminative, tagged sum types, regular recursive types and so-called coercive types with a notion of coercion parameterization The resulting system can be seen as a form of polymorphic qualified type system which aims at a common generalization of dynamic typing and certain systems of soft typing. Starting from an equational presentation of categorical co-products, we develop a dynamic typing calculus within which we can reason about completion. We develop a generalized theory of conversion and reduction on coercions and completions. We establish fundamental proof theoretic properties of the calculus, including confluence of general completion reduction and existence and uniqueness of minimal completions in a pragmatically important class of completions. We also give a proof-theoretic treatment of a generalization of Thatte's quasi-static typing which arises naturally in the framework of dynamic typing. We study problems of automatic completion inference in our generalized setting, and we describe an implementation of a simple, global dynamic type analysis We investigate the problem of achieving modularity of inference, and we argue that safety and minimality are conflicting goals in a modular setting. It is suggested that the use of coercion parameters is an important ingredient in reconciling these goals. The problem of dynamic type inference for a realistic dynamically typed language is studied, with special reference to Scheme. Completion inference as a basis for static debugging tools and for a high-level translation of Scheme to ML is investigated. We identify major problems and suggest solutions to some of them. |
| Beschreibung: | VIII, 230 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035229144 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 081229s1995 m||| 00||| eng d | ||
| 035 | |a (OCoLC)38584679 | ||
| 035 | |a (DE-599)GBV268713790 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Rehof, Jakob |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Polymorphic dynamic typing |b aspects of proof theory and inference |c Jakob Rehof |
| 264 | 1 | |a København |b DIKU |c 1995 | |
| 300 | |a VIII, 230 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1995,9 | |
| 502 | |a Zugl.: Copenhagen, Univ., Diss., 1995 | ||
| 520 | 3 | |a Abstract: "We study dynamic typing in continuation of Henglein's dynamically typed [lambda]-calculus, with particular regard to proof theoretic aspects and aspects of polymorphic completion inference. Dynamically typed [lambda]-calculus provides a formal framework within which we can reason in a precise manner about properties of the process of completion for higher order programming languages. Completions arise from raw programs by insertion of type coercions which model run-time type operations of tagging and checking/untagging. Central among the problems studied in dynamic typing are the notions of minimization of run-time type coercions in completions and safety of completions. From the monomorphic framework of Henglein's system, we work towards a polymorphic generalization which eventually comprises Hindley-Milner style polymorphism, discriminative, tagged sum types, regular recursive types and so-called coercive types with a notion of coercion parameterization | |
| 520 | 3 | |a The resulting system can be seen as a form of polymorphic qualified type system which aims at a common generalization of dynamic typing and certain systems of soft typing. Starting from an equational presentation of categorical co-products, we develop a dynamic typing calculus within which we can reason about completion. We develop a generalized theory of conversion and reduction on coercions and completions. We establish fundamental proof theoretic properties of the calculus, including confluence of general completion reduction and existence and uniqueness of minimal completions in a pragmatically important class of completions. We also give a proof-theoretic treatment of a generalization of Thatte's quasi-static typing which arises naturally in the framework of dynamic typing. We study problems of automatic completion inference in our generalized setting, and we describe an implementation of a simple, global dynamic type analysis | |
| 520 | 3 | |a We investigate the problem of achieving modularity of inference, and we argue that safety and minimality are conflicting goals in a modular setting. It is suggested that the use of coercion parameters is an important ingredient in reconciling these goals. The problem of dynamic type inference for a realistic dynamically typed language is studied, with special reference to Scheme. Completion inference as a basis for static debugging tools and for a high-level translation of Scheme to ML is investigated. We identify major problems and suggest solutions to some of them. | |
| 650 | 4 | |a Inference | |
| 650 | 4 | |a Lambda calculus | |
| 650 | 4 | |a Proof theory | |
| 650 | 4 | |a Type theory | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 830 | 0 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1995,9 |w (DE-604)BV010011493 |9 95,9 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017035113 | ||
Datensatz im Suchindex
| _version_ | 1804138495783993344 |
|---|---|
| any_adam_object | |
| author | Rehof, Jakob |
| author_facet | Rehof, Jakob |
| author_role | aut |
| author_sort | Rehof, Jakob |
| author_variant | j r jr |
| building | Verbundindex |
| bvnumber | BV035229144 |
| ctrlnum | (OCoLC)38584679 (DE-599)GBV268713790 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03609nam a2200373 cb4500</leader><controlfield tag="001">BV035229144</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">081229s1995 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38584679</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV268713790</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rehof, Jakob</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Polymorphic dynamic typing</subfield><subfield code="b">aspects of proof theory and inference</subfield><subfield code="c">Jakob Rehof</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">København</subfield><subfield code="b">DIKU</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 230 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">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1995,9</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Copenhagen, Univ., Diss., 1995</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We study dynamic typing in continuation of Henglein's dynamically typed [lambda]-calculus, with particular regard to proof theoretic aspects and aspects of polymorphic completion inference. Dynamically typed [lambda]-calculus provides a formal framework within which we can reason in a precise manner about properties of the process of completion for higher order programming languages. Completions arise from raw programs by insertion of type coercions which model run-time type operations of tagging and checking/untagging. Central among the problems studied in dynamic typing are the notions of minimization of run-time type coercions in completions and safety of completions. From the monomorphic framework of Henglein's system, we work towards a polymorphic generalization which eventually comprises Hindley-Milner style polymorphism, discriminative, tagged sum types, regular recursive types and so-called coercive types with a notion of coercion parameterization</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The resulting system can be seen as a form of polymorphic qualified type system which aims at a common generalization of dynamic typing and certain systems of soft typing. Starting from an equational presentation of categorical co-products, we develop a dynamic typing calculus within which we can reason about completion. We develop a generalized theory of conversion and reduction on coercions and completions. We establish fundamental proof theoretic properties of the calculus, including confluence of general completion reduction and existence and uniqueness of minimal completions in a pragmatically important class of completions. We also give a proof-theoretic treatment of a generalization of Thatte's quasi-static typing which arises naturally in the framework of dynamic typing. We study problems of automatic completion inference in our generalized setting, and we describe an implementation of a simple, global dynamic type analysis</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We investigate the problem of achieving modularity of inference, and we argue that safety and minimality are conflicting goals in a modular setting. It is suggested that the use of coercion parameters is an important ingredient in reconciling these goals. The problem of dynamic type inference for a realistic dynamically typed language is studied, with special reference to Scheme. Completion inference as a basis for static debugging tools and for a high-level translation of Scheme to ML is investigated. We identify major problems and suggest solutions to some of them.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Inference</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lambda calculus</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Type theory</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1995,9</subfield><subfield code="w">(DE-604)BV010011493</subfield><subfield code="9">95,9</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017035113</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV035229144 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T21:29:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017035113 |
| oclc_num | 38584679 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | VIII, 230 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| publisher | DIKU |
| record_format | marc |
| series | Datalogisk Institut <København>: DIKU-Rapport |
| series2 | Datalogisk Institut <København>: DIKU-Rapport |
| spelling | Rehof, Jakob Verfasser aut Polymorphic dynamic typing aspects of proof theory and inference Jakob Rehof København DIKU 1995 VIII, 230 S. txt rdacontent n rdamedia nc rdacarrier Datalogisk Institut <København>: DIKU-Rapport 1995,9 Zugl.: Copenhagen, Univ., Diss., 1995 Abstract: "We study dynamic typing in continuation of Henglein's dynamically typed [lambda]-calculus, with particular regard to proof theoretic aspects and aspects of polymorphic completion inference. Dynamically typed [lambda]-calculus provides a formal framework within which we can reason in a precise manner about properties of the process of completion for higher order programming languages. Completions arise from raw programs by insertion of type coercions which model run-time type operations of tagging and checking/untagging. Central among the problems studied in dynamic typing are the notions of minimization of run-time type coercions in completions and safety of completions. From the monomorphic framework of Henglein's system, we work towards a polymorphic generalization which eventually comprises Hindley-Milner style polymorphism, discriminative, tagged sum types, regular recursive types and so-called coercive types with a notion of coercion parameterization The resulting system can be seen as a form of polymorphic qualified type system which aims at a common generalization of dynamic typing and certain systems of soft typing. Starting from an equational presentation of categorical co-products, we develop a dynamic typing calculus within which we can reason about completion. We develop a generalized theory of conversion and reduction on coercions and completions. We establish fundamental proof theoretic properties of the calculus, including confluence of general completion reduction and existence and uniqueness of minimal completions in a pragmatically important class of completions. We also give a proof-theoretic treatment of a generalization of Thatte's quasi-static typing which arises naturally in the framework of dynamic typing. We study problems of automatic completion inference in our generalized setting, and we describe an implementation of a simple, global dynamic type analysis We investigate the problem of achieving modularity of inference, and we argue that safety and minimality are conflicting goals in a modular setting. It is suggested that the use of coercion parameters is an important ingredient in reconciling these goals. The problem of dynamic type inference for a realistic dynamically typed language is studied, with special reference to Scheme. Completion inference as a basis for static debugging tools and for a high-level translation of Scheme to ML is investigated. We identify major problems and suggest solutions to some of them. Inference Lambda calculus Proof theory Type theory (DE-588)4113937-9 Hochschulschrift gnd-content Datalogisk Institut <København>: DIKU-Rapport 1995,9 (DE-604)BV010011493 95,9 |
| spellingShingle | Rehof, Jakob Polymorphic dynamic typing aspects of proof theory and inference Datalogisk Institut <København>: DIKU-Rapport Inference Lambda calculus Proof theory Type theory |
| subject_GND | (DE-588)4113937-9 |
| title | Polymorphic dynamic typing aspects of proof theory and inference |
| title_auth | Polymorphic dynamic typing aspects of proof theory and inference |
| title_exact_search | Polymorphic dynamic typing aspects of proof theory and inference |
| title_full | Polymorphic dynamic typing aspects of proof theory and inference Jakob Rehof |
| title_fullStr | Polymorphic dynamic typing aspects of proof theory and inference Jakob Rehof |
| title_full_unstemmed | Polymorphic dynamic typing aspects of proof theory and inference Jakob Rehof |
| title_short | Polymorphic dynamic typing |
| title_sort | polymorphic dynamic typing aspects of proof theory and inference |
| title_sub | aspects of proof theory and inference |
| topic | Inference Lambda calculus Proof theory Type theory |
| topic_facet | Inference Lambda calculus Proof theory Type theory Hochschulschrift |
| volume_link | (DE-604)BV010011493 |
| work_keys_str_mv | AT rehofjakob polymorphicdynamictypingaspectsofprooftheoryandinference |