research-article

Open access

A strict functional language with cyclic recursive data

Author:

Susumu NishimuraAuthors Info & Claims

Formal Aspects of Computing, Volume 9, Issue 1

Pages 78 - 97

https://doi.org/10.1007/BF01212526

Published: 01 January 1997 Publication History

PDF eReader

Abstract

The paper proposes a strict functional language to program with cyclic recursive data structures. In the language, each recursive datum is represented by a system of equations. Cyclic structures are naturally expressed by this representation, and the language provides a general mechanism that transforms several such systems of equations into a single new system of equations. An operational semantics and a polymorphic type system for the language are given, and a type soundness proof is sketched. Finally, it is also shown that the language can be implemented in a data-parallel fashion.

References

[1]

Allison L. Circular programs and self-referential structures Software-Practice and Experience 1989 19 2 99-109

Digital Library

Google Scholar

[2]

Bird R. S. Using circular programs to eliminate multiple traversais of data Acta Informatica 1984 21 239-250

Digital Library

Google Scholar

[3]

Damas, L. and Milner, R.: Principal type schemes for functional programs. InProceedings of ACM Symposium on the Principles of Programming Languages, pages 207–212, 1982.

Google Scholar

[4]

Jájá, J.:An Introduction to Parallel Algorithm. Addison-Wesley, 1992.

Google Scholar

[5]

Kahn, G.: Natural semantics. InProc. Symposium on Theoretical Aspects of Computer Science(LNCS 247), pages 22-39. Springer Verlag, 1987.

Google Scholar

[6]

Karp, A.: Programming for parallelism.IEEE Computer, pages 43–57, May 1987.

Google Scholar

[7]

Leighton, F. T.:Introduction to Parallel Algorithms and Architectures: Arrays-Trees.Hypercubes. Morgan Kaufmann, 1991.

Google Scholar

[8]

Leroy, Xavier.: Polymorphic typing of an algorithmic language. Ph.D. thesis RR-1778, INRIA, 1992.

Google Scholar

[9]

Milner, R., Tofte, M. and Harper, R.:The Definition of Standard ML. The MIT Press, 1990.

Google Scholar

[10]

Nishimura, S. and Ohori, A.: A calculus for exploiting data parallelism on recursively defined data (preliminary report). InInternational Workshop on Theory and Practice on Parallel Programming (LNCS 907), pages 413–432, 1995.

Google Scholar

[11]

Tofte, M.: Operational semantics and polymorphic type inference. Ph.D. thesis CST-52-88, Department of Computer Science, Edinburgh University, 1988.

Google Scholar

Index Terms

A strict functional language with cyclic recursive data
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
      2. Language types
        Functional languages
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
    2. Program semantics

Index terms have been assigned to the content through auto-classification.

Recommendations

Compiling a functional language
LFP '84: Proceedings of the 1984 ACM Symposium on LISP and functional programming

This paper summarizes my experience in implementing a compiler for a functional language. The language is ML(1) [Milner 84] and the compiler was first implemented in 1980 as a personal project when I was a postgraduate student at the University of ...
Making collection operations optimal with aggressive JIT compilation
SCALA 2017: Proceedings of the 8th ACM SIGPLAN International Symposium on Scala

Functional collection combinators are a neat and widely accepted data processing abstraction. However, their generic nature results in high abstraction overheads -- Scala collections are known to be notoriously slow for typical tasks. We show that ...
Pycket: a tracing JIT for a functional language
ICFP '15

We present Pycket, a high-performance tracing JIT compiler for Racket. Pycket supports a wide variety of the sophisticated features in Racket such as contracts, continuations, classes, structures, dynamic binding, and more. On average, over a standard ...

Comments

Information & Contributors

Information

Published In

Formal Aspects of Computing Volume 9, Issue 1

Jan 1997

118 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 January 1997

Published in FAC Volume 9, Issue 1

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
40
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)5

Reflects downloads up to 03 Feb 2025

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Abstract

References

References

Index Terms

Recommendations

Compiling a functional language

Making collection operations optimal with aggressive JIT compilation

Pycket: a tracing JIT for a functional language

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations