ABSTRACT Cost Recurrences for DML Programs ∗
cost recurrence describes an upper bound for the running time of a program in terms of the size of its input. Finding cost recurrences is a frequent intermediate step in complexity analysis, and this step requires an abstraction from data to data size. In this article, we use information contained i...
Other Authors: | |
---|---|
Format: | Text |
Language: | English |
Subjects: | |
Online Access: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.6494 http://www.brics.dk/~grobauer/papers/cost_dml/crec_for_dml.pdf.gz |
id |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.71.6494 |
---|---|
record_format |
openpolar |
spelling |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.71.6494 2023-05-15T16:01:09+02:00 ABSTRACT Cost Recurrences for DML Programs ∗ The Pennsylvania State University CiteSeerX Archives application/pdf http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.6494 http://www.brics.dk/~grobauer/papers/cost_dml/crec_for_dml.pdf.gz en eng http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.6494 http://www.brics.dk/~grobauer/papers/cost_dml/crec_for_dml.pdf.gz Metadata may be used without restrictions as long as the oai identifier remains attached to it. http://www.brics.dk/~grobauer/papers/cost_dml/crec_for_dml.pdf.gz text ftciteseerx 2016-01-08T18:54:53Z cost recurrence describes an upper bound for the running time of a program in terms of the size of its input. Finding cost recurrences is a frequent intermediate step in complexity analysis, and this step requires an abstraction from data to data size. In this article, we use information contained in dependent types to achieve such an abstraction: Dependent ML (DML), a conservative extension of ML, provides dependent types that can be used to associate data with size information, thus describing a possible abstraction. We automatically extract cost recurrences from first-order DML programs, guiding the abstraction from data to data size with information contained in DML type derivations. 1. Text DML Unknown |
institution |
Open Polar |
collection |
Unknown |
op_collection_id |
ftciteseerx |
language |
English |
description |
cost recurrence describes an upper bound for the running time of a program in terms of the size of its input. Finding cost recurrences is a frequent intermediate step in complexity analysis, and this step requires an abstraction from data to data size. In this article, we use information contained in dependent types to achieve such an abstraction: Dependent ML (DML), a conservative extension of ML, provides dependent types that can be used to associate data with size information, thus describing a possible abstraction. We automatically extract cost recurrences from first-order DML programs, guiding the abstraction from data to data size with information contained in DML type derivations. 1. |
author2 |
The Pennsylvania State University CiteSeerX Archives |
format |
Text |
title |
ABSTRACT Cost Recurrences for DML Programs ∗ |
spellingShingle |
ABSTRACT Cost Recurrences for DML Programs ∗ |
title_short |
ABSTRACT Cost Recurrences for DML Programs ∗ |
title_full |
ABSTRACT Cost Recurrences for DML Programs ∗ |
title_fullStr |
ABSTRACT Cost Recurrences for DML Programs ∗ |
title_full_unstemmed |
ABSTRACT Cost Recurrences for DML Programs ∗ |
title_sort |
abstract cost recurrences for dml programs ∗ |
url |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.6494 http://www.brics.dk/~grobauer/papers/cost_dml/crec_for_dml.pdf.gz |
genre |
DML |
genre_facet |
DML |
op_source |
http://www.brics.dk/~grobauer/papers/cost_dml/crec_for_dml.pdf.gz |
op_relation |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.6494 http://www.brics.dk/~grobauer/papers/cost_dml/crec_for_dml.pdf.gz |
op_rights |
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
_version_ |
1766397131870961664 |