article

Free access

Lazy functional state threads

Authors:

John Launchbury,

Simon L. Peyton JonesAuthors Info & Claims

ACM SIGPLAN Notices, Volume 29, Issue 6

Pages 24 - 35

https://doi.org/10.1145/773473.178246

Published: 01 June 1994 Publication History

Abstract

Some algorithms make critical internal use of updatable state, even though their external specification is purely functional. Based on earlier work on monads, we present a way of securely encapsulating stateful computations that manipulate multiple, named, mutable objects, in the context of a non-strict, purely-functional language.

The security of the encapsulation is assured by the type system, using parametricity. Intriguingly, this parametricity requires the provision of a (single) constant with a rank-2 polymorphic type.

References

[1]

E Barendsen L~ JEW Smetsers {Dec 1993}, "Conventional and uniqueness typing in graph rewrite systems," in Proc 13th Conference on the Foundations of Software Technology and Theoretical Computer Science, Springer Verlag LNCS.

Digital Library

[2]

DK Gifford & JM Lucassen {Aug 1986}, "Integrating functional and imperative programming,'" in A CM Conference on Lisp and Functional Programming, MIT, ACM, 28-38.

Digital Library

[3]

J Launchbury{June 1993}, "Lazy imperative programming,' in Proc A CM Sigplan Workshop on State in Programming Languages, Copenhagen (available as YALEU/DCS/RR- 968, Yale University), pp46-56.

[4]

J Launchbury Lc SL Peyton Jones{Feb 1994}, "Lazy functional state threads," Technical report FP- 94-05, Department of Computing Science, University of Glasgow (FTP:ftp. dcs. glasgow, ac. uk: pub/glasgow-fp/tech-report s / FP-94-05: sta~e, ps. Z).

[5]

NJ McCracken {June 1984}, "The typechecking of programs with implicit type structure," in Semantics of data types, Springer Verlag LNCS 173, 301-315.

Digital Library

[6]

JC Mitchell & AR Meyer {1985}, "Second-order logical relations," in Logics of Programs, R Parikh, ed., Springer Verlag LNCS 193.

Digital Library

[7]

Rishiyur Nikhil{March 1988}, "Id Reference Manual," Lab for Computer Sci, MIT.

[8]

M Odersky, D Rabin & P Hudak{Jan 1993}, "Call by name, assignment, and the lambda calculus," in 20th A CM Symposium on Principles of Programming Languages, Charleston, ACM, 43- 56.

Digital Library

[9]

LC Paulson {1991}, ML for the working programmer, Cambridge University Press.

Digital Library

[10]

SL Peyton Jones L~ J Launchbury{Sept 1991}, "Unboxed values as first class citizens," in Functional Programming Languages and Computer Architecture, Boston, Hughes, ed., LNCS 523, Springer Verlag, 636-666.

Digital Library

[11]

SL Peyton Jones & PL Wadler {Jan 1993}, "Imperative functional programming," in 20th A CM Symposium on Principles of Programming Languages, Charleston, ACM, 71-84.

Digital Library

[12]

CG Ponder, PC McOeer & A P-C Ng {June 1988}, "Are applicative languages inefficient?," $iGPLAN Notices 23, 135-139.

Digital Library

[13]

DA Schmidt {Apr 1985}, "Detecting global variables in denotational specifications," TOPLAS 7, 299- 310.

Digital Library

[14]

V Swarup, US Reddy & E Ireland{Sept 1991}, "As~ signments for applicative languages," in Functional Programming Languages and Computer Architecture, Boston, Hughes, ed., LNCS 523, Springer Verlag, 192-214.

Digital Library

[15]

M Tofte{Nov 1990}, "Type inference for polymorphic references," information and Computation 89.

Digital Library

Cited By

Willis JWu NPickering M(2020)Staged selective parser combinatorsProceedings of the ACM on Programming Languages10.1145/34090024:ICFP(1-30)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3409002
Abrahamsson OHo SKanabar HKumar RMyreen MNorrish MTan Y(2020)Proof-Producing Synthesis of CakeML from Monadic HOL FunctionsJournal of Automated Reasoning10.1007/s10817-020-09559-8Online publication date: 6-Jun-2020
https://doi.org/10.1007/s10817-020-09559-8
Höck SRiedl R(2019)CyBy2: a strongly typed, purely functional framework for chemical data managementJournal of Cheminformatics10.1186/s13321-019-0403-211:1Online publication date: 30-Dec-2019
https://doi.org/10.1186/s13321-019-0403-2
Show More Cited By

Index Terms

Lazy functional state threads

Recommendations

Lazy functional state threads
PLDI '94: Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation

Some algorithms make critical internal use of updatable state, even though their external specification is purely functional. Based on earlier work on monads, we present a way of securely encapsulating stateful computations that manipulate multiple, ...
Automatic amortised analysis of dynamic memory allocation for lazy functional programs
ICFP '12: Proceedings of the 17th ACM SIGPLAN international conference on Functional programming

This paper describes the first successful attempt, of which we are aware, to define an automatic, type-based static analysis of resource bounds for lazy functional programs. Our analysis uses the automatic amortisation approach developed by Hofmann and ...
A Lazy Language Needs a Lazy Type System: Introducing Polymorphic Contexts
IFL 2016: Proceedings of the 28th Symposium on the Implementation and Application of Functional Programming Languages

Most type systems that support polymorphic functions are based on a version of System-F. We argue that this limits useful programming paradigms for languages with lazy evaluation. We motivate an extension of System-F alleviating this limitation.

First, ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 29, Issue 6

June 1994

360 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/773473

Guest Editor:
Brent T. Hailpern

Issue’s Table of Contents

PLDI '94: Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
August 1994
360 pages
ISBN:089791662X
DOI:10.1145/178243
Chairmen:
Vivek Sarkar
IBM Santa Teresa Lab.
,
Barbara Ryder
Rutgers Univ., New Brunswick, NJ
,
Mary Lou Soffa
Univ. of Pittsburgh, Pittsburgh, PA

Copyright © 1994 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1994

Published in SIGPLAN Volume 29, Issue 6

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

202
Total Citations
View Citations
1,557
Total Downloads

Downloads (Last 12 months)317
Downloads (Last 6 weeks)65

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Willis JWu NPickering M(2020)Staged selective parser combinatorsProceedings of the ACM on Programming Languages10.1145/34090024:ICFP(1-30)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3409002
Abrahamsson OHo SKanabar HKumar RMyreen MNorrish MTan Y(2020)Proof-Producing Synthesis of CakeML from Monadic HOL FunctionsJournal of Automated Reasoning10.1007/s10817-020-09559-8Online publication date: 6-Jun-2020
https://doi.org/10.1007/s10817-020-09559-8
Höck SRiedl R(2019)CyBy2: a strongly typed, purely functional framework for chemical data managementJournal of Cheminformatics10.1186/s13321-019-0403-211:1Online publication date: 30-Dec-2019
https://doi.org/10.1186/s13321-019-0403-2
Sakaguchi K(2019)Program extraction for mutable arraysScience of Computer Programming10.1016/j.scico.2019.102372(102372)Online publication date: Dec-2019
https://doi.org/10.1016/j.scico.2019.102372
Noonan M(2018)Ghosts of departed proofs (functional pearl)ACM SIGPLAN Notices10.1145/3299711.324275553:7(119-131)Online publication date: 17-Sep-2018
https://dl.acm.org/doi/10.1145/3299711.3242755
Noonan MWu N(2018)Ghosts of departed proofs (functional pearl)Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell10.1145/3242744.3242755(119-131)Online publication date: 17-Sep-2018
https://dl.acm.org/doi/10.1145/3242744.3242755
Mokhov A(2017)Algebraic graphs with class (functional pearl)ACM SIGPLAN Notices10.1145/3156695.312295652:10(2-13)Online publication date: 7-Sep-2017
https://dl.acm.org/doi/10.1145/3156695.3122956
Mokhov ADiatchki I(2017)Algebraic graphs with class (functional pearl)Proceedings of the 10th ACM SIGPLAN International Symposium on Haskell10.1145/3122955.3122956(2-13)Online publication date: 7-Sep-2017
https://dl.acm.org/doi/10.1145/3122955.3122956
Yallop JLiu H(2016)Causal commutative arrows revisitedACM SIGPLAN Notices10.1145/3241625.297601951:12(21-32)Online publication date: 8-Sep-2016
https://dl.acm.org/doi/10.1145/3241625.2976019
Newton RAğacan ÖFogg PTobin-Hochstadt S(2016)Parallel type-checking with haskell using saturating LVars and stream generatorsACM SIGPLAN Notices10.1145/3016078.285114251:8(1-12)Online publication date: 27-Feb-2016
https://dl.acm.org/doi/10.1145/3016078.2851142
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents