Out-of-Core Functional Programming with Type-Based Primitives

Authors:
Tyng-Ruey Chuang;Shin-Cheng Mu
Affiliations:
-;-
Venue:
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
Year:
2000

Citing 10
Cited 1

Data structures and network algorithms

Data structures and network algorithms
Functional programming with bananas, lenses, envelopes and barbed wire

Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Monad transformers and modular interpreters

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantic Lego

Semantic Lego
Algebra of programming

Algebra of programming
Rolling your own mutable ADT—a connection between linear types and monads

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PolyP—a polytypic programming language extension

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Polytypic Compact Printing and Parsing

ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Monads for Functional Programming

Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
Merging Monads and Folds for Functional Programming

Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text

Generic storage in Haskell

Proceedings of the 6th ACM SIGPLAN workshop on Generic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We formulate and experiment with type-based primitives (such as fold and unfold operations) for out-of-core processing of functional data structures. We follow the view that recursive data types are fixed points of polynomial type constructors. This view leads to a clear separation of the semantics and the implementations of recursive data types. We provide monadic implementations of the type-based primitives so that the intermediate data structures used for the executions of the primitives can be placed in out-of-core storage. The parametric module facility of Objective Caml is further used to package the out-of-core implementations. The resulting out-of-core user code retains the same program structure of the in-core user code and can be as elegant.