article

An efficiency comparison of some representations of purely functional arrays

Authors:

A. Aasa,

Sören Holmström,

Christina NilssonAuthors Info & Claims

BIT, Volume 28, Issue 3

Pages 490 - 503

Published: 01 July 1988 Publication History

Abstract

No abstract available.

Cited By

View all

Kumar ABlelloch GHarper R(2017)Parallel functional arraysACM SIGPLAN Notices10.1145/3093333.300986952:1(706-718)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3093333.3009869
Kumar ABlelloch GHarper RCastagna GGordon A(2017)Parallel functional arraysProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009869(706-718)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3009837.3009869
Castagna GGordon A(2017)Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming LanguagesundefinedOnline publication date: 1-Jan-2017
Show More Cited By

Index Terms

An efficiency comparison of some representations of purely functional arrays
1. Information systems
  1. Information storage systems
    1. Record storage systems
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Functional languages

Recommendations

An efficiency comparison of some representations of purely functional arrays
Abstract
We describe an efficient representation of purely functional arrays suggested by Holmström and Hughes, here calledversion tree arrays orv-arrays. A collection of arrays is represented by aversion tree where the root array is stored in contiguous ...
Purely Functional Representations of Catenable Sorted Lists
Purely functional lazy nondeterministic programming
Dedicated to ICFP 2009

Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (nonstrict evaluation with sharing of the results) with nondeterminism. Yet these benefits are seldom enjoyed in functional programming ...

Comments

Information & Contributors

Information

Published In

BIT Volume 28, Issue 3

Sep 1988

374 pages

ISSN:0006-3835

Issue’s Table of Contents

Publisher

BIT Computer Science and Numerical Mathematics

United States

Publication History

Published: 01 July 1988

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kumar ABlelloch GHarper R(2017)Parallel functional arraysACM SIGPLAN Notices10.1145/3093333.300986952:1(706-718)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3093333.3009869
Kumar ABlelloch GHarper RCastagna GGordon A(2017)Parallel functional arraysProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009869(706-718)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3009837.3009869
Castagna GGordon A(2017)Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming LanguagesundefinedOnline publication date: 1-Jan-2017
Tozawa ATatsubori MOnodera TMinamide Y(2009)Copy-on-write in the PHP languageACM SIGPLAN Notices10.1145/1594834.148090844:1(200-212)Online publication date: 21-Jan-2009
https://dl.acm.org/doi/10.1145/1594834.1480908
Tozawa ATatsubori MOnodera TMinamide YShao ZPierce B(2009)Copy-on-write in the PHP languageProceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1480881.1480908(200-212)Online publication date: 21-Jan-2009
https://dl.acm.org/doi/10.1145/1480881.1480908
Hinze R(2002)Bootstrapping one-sided flexible arraysACM SIGPLAN Notices10.1145/583852.58148037:9(2-13)Online publication date: 17-Sep-2002
https://dl.acm.org/doi/10.1145/583852.581480
Hinze RWand MPeyton Jones S(2002)Bootstrapping one-sided flexible arraysProceedings of the seventh ACM SIGPLAN international conference on Functional programming10.1145/581478.581480(2-13)Online publication date: 4-Oct-2002
https://dl.acm.org/doi/10.1145/581478.581480
Erwig M(2001)Inductive graphs and functional graph algorithmsJournal of Functional Programming10.1017/S095679680100407511:5(467-492)Online publication date: 1-Sep-2001
https://dl.acm.org/doi/10.1017/S0956796801004075
Erwig M(1997)Functional programming with graphsACM SIGPLAN Notices10.1145/258949.25895532:8(52-65)Online publication date: 1-Aug-1997
https://dl.acm.org/doi/10.1145/258949.258955
Erwig MJones STofte M(1997)Functional programming with graphsProceedings of the second ACM SIGPLAN international conference on Functional programming10.1145/258948.258955(52-65)Online publication date: 1-Aug-1997
https://dl.acm.org/doi/10.1145/258948.258955
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

An efficiency comparison of some representations of purely functional arrays

Purely Functional Representations of Catenable Sorted Lists

Purely functional lazy nondeterministic programming

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations