Programming with concrete data structures and sequential algorithms

Authors:
G. Berry
Affiliations:
Centre de Mathematiques Appliquées, Ecole Nationale Supgrieure des Mines de Paris, Sophia-Antipolis, 06560 VALBONNE - FRANCE
Venue:
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Year:
1981

Citing 1
Cited 1

Abstract data types and software validation

Communications of the ACM

Sequential algorithms, deterministic parallelism, and intensional expressiveness

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe the data definition facilities of a new applicative language called CDS, which is based on Kahn-Plotkin's theory of concrete data structures and on Berry-Curien's theory of sequential algorithms. CDS is together an higher-order applicative language in the style of Milner's ML language and a coroutine system in the style of Kahn-Mac Queen's one. Instead of exchanging values only through streams, the CDS coroutines may exchange pieces of arbitrarily complex data structures, including functional and infinite ones. All expressions are evaluated in a lazy way, even those of functional type.