Journal article icon

Journal article

Programming with ornaments

Abstract:

Dependently typed programming advocates the use of various indexed versions of the same shape of data, but the formal relationship amongst these structurally similar datatypes usually needs to be established manually and tediously. Ornaments have been proposed as a formal mechanism to manage the relationships between such datatype variants. In this paper, we conduct a case study under an ornament framework; the case study concerns programming binomial heaps and their operations — including in...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1017/S0956796816000307

Authors


More by this author
Department:
Kellogg College
Clarendon Fund More from this funder
More from this funder
Grant:
Reusability and Dependent Types (EP/G034516/1)
Publisher:
Cambridge University Press Publisher's website
Journal:
Journal of Functional Programming Journal website
Volume:
27
Pages:
Article: e2
Publication date:
2016-12-12
Acceptance date:
2016-10-28
DOI:
EISSN:
1469-7653
ISSN:
0956-7968
Pubs id:
pubs:665817
URN:
uri:f0476871-2b2f-48d6-9cbe-645e186cafd7
UUID:
uuid:f0476871-2b2f-48d6-9cbe-645e186cafd7
Local pid:
pubs:665817

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP