Dependent Types in Practical Programming (Extended Abstract)

We present an approach to enriching the type system of ML with a restricted form of dependent types, where type index objects are drawn from a constraint domain C, leading to the DML(C) language schema. This allows specification and inference of significantly more precise type information, facilitat...

Full description

Bibliographic Details
Main Authors: Hongwei Xi, Frank Pfenning
Other Authors: The Pennsylvania State University CiteSeerX Archives
Format: Text
Language:English
Published: 1999
Subjects:
DML
Online Access:http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.228
http://www.ececs.uc.edu/~hwxi/academic/papers/popl99.ps
id ftciteseerx:oai:CiteSeerX.psu:10.1.1.42.228
record_format openpolar
spelling ftciteseerx:oai:CiteSeerX.psu:10.1.1.42.228 2023-05-15T16:01:16+02:00 Dependent Types in Practical Programming (Extended Abstract) Hongwei Xi Frank Pfenning The Pennsylvania State University CiteSeerX Archives 1999 application/postscript http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.228 http://www.ececs.uc.edu/~hwxi/academic/papers/popl99.ps en eng http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.228 http://www.ececs.uc.edu/~hwxi/academic/papers/popl99.ps Metadata may be used without restrictions as long as the oai identifier remains attached to it. http://www.ececs.uc.edu/~hwxi/academic/papers/popl99.ps text 1999 ftciteseerx 2016-01-08T03:55:28Z We present an approach to enriching the type system of ML with a restricted form of dependent types, where type index objects are drawn from a constraint domain C, leading to the DML(C) language schema. This allows specification and inference of significantly more precise type information, facilitating program error detection and compiler optimization. A major complication resulting from introducing dependent types is that pure type inference for the enriched system is no longer possible, but we show that type-checking a sufficiently annotated program in DML(C) can be reduced to constraint satisfaction in the constraint domain C. We exhibit the unobtrusiveness of our approach through practical examples and prove that DML(C) is conservative over ML. The main . Text DML Unknown
institution Open Polar
collection Unknown
op_collection_id ftciteseerx
language English
description We present an approach to enriching the type system of ML with a restricted form of dependent types, where type index objects are drawn from a constraint domain C, leading to the DML(C) language schema. This allows specification and inference of significantly more precise type information, facilitating program error detection and compiler optimization. A major complication resulting from introducing dependent types is that pure type inference for the enriched system is no longer possible, but we show that type-checking a sufficiently annotated program in DML(C) can be reduced to constraint satisfaction in the constraint domain C. We exhibit the unobtrusiveness of our approach through practical examples and prove that DML(C) is conservative over ML. The main .
author2 The Pennsylvania State University CiteSeerX Archives
format Text
author Hongwei Xi
Frank Pfenning
spellingShingle Hongwei Xi
Frank Pfenning
Dependent Types in Practical Programming (Extended Abstract)
author_facet Hongwei Xi
Frank Pfenning
author_sort Hongwei Xi
title Dependent Types in Practical Programming (Extended Abstract)
title_short Dependent Types in Practical Programming (Extended Abstract)
title_full Dependent Types in Practical Programming (Extended Abstract)
title_fullStr Dependent Types in Practical Programming (Extended Abstract)
title_full_unstemmed Dependent Types in Practical Programming (Extended Abstract)
title_sort dependent types in practical programming (extended abstract)
publishDate 1999
url http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.228
http://www.ececs.uc.edu/~hwxi/academic/papers/popl99.ps
genre DML
genre_facet DML
op_source http://www.ececs.uc.edu/~hwxi/academic/papers/popl99.ps
op_relation http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.228
http://www.ececs.uc.edu/~hwxi/academic/papers/popl99.ps
op_rights Metadata may be used without restrictions as long as the oai identifier remains attached to it.
_version_ 1766397205666594816