Article

Free access

Bananas in space: extending fold and unfold to exponential types

Authors:

FPCA '95: Proceedings of the seventh international conference on Functional programming languages and computer architecture

Pages 324 - 333

https://doi.org/10.1145/224164.224225

Published: 01 October 1995 Publication History

PDF eReader

References

[1]

Samson Abramsky. The lazy lambda calculus. In David Turner, editor, Research Topics ~n Functional Programm,ng, pages 65-116. Addison-Wesley, 1990.

Digital Library

Google Scholar

[2]

Lennart Augustsson. The Haskell B. compiler. Chalmers University of Technology, 1994.

Google Scholar

[3]

Roland Backhouse, Ed Voermans, and Jaap van der Woude. A relational theory of datatypes. In preparation, 1994.

Google Scholar

[4]

Henk Barendregt. The Lambda Calculus - it's Syntax and Semantzcs. North-Holland, 1984. Revised edition.

Google Scholar

[5]

Hans Beki~. Programming Languages and their Defintwn, volume 177 of LNCS. Springer-Verlag, 1984.

Digital Library

Google Scholar

[6]

Richard Bird. Constructive functional programming. In Proc. Marktoberdorf International Summer School on Constructive Methods 2n Computer Science. Springer- Verlag, 1989.

Google Scholar

[7]

Richard Bird and Oege de Moor. The algebra of programming, in preparation, 1994.

Digital Library

Google Scholar

[8]

Richard Bird and Philip WadIer. An Introduction to FunctzonaI Programming. Prentice Hall, 1988.

Digital Library

Google Scholar

[9]

Gert Florijn. Modelling office processes with functional parsers. University of Utrecht, The Netherlands, 1994.

Google Scholar

[10]

Maarten Fokkinga. Law and Order ~n Algor~thm~cs. PhD thesis, University of Twente, March 1992.

Google Scholar

[11]

Peter Freyd. Algebraically complete categories. In A. Carboni et al, editor, Proc. 1990 Como Category Theory Conference, volume 1488 of Lecture Notes 2n Math, pages 95-104. Springer-Verlag, Berlin, 1990.

Google Scholar

[12]

Peter Freyd. Recursive types reduced to inductive types. In Proc. LICS 90. IEEE Computer Society Press, 1990.

Google Scholar

[13]

Jeremy Gibbons. Algebras for Tree Algorithms. PhD thesis, Oxford University, September 1991.

Digital Library

Google Scholar

[14]

T. Hagino. Category Theoretic Approach to Data Types PhD thesis, University of Edinburgh, 1987.

Google Scholar

[15]

Graham Hutton. Higher-order functions for parsing. Journal of Functional Programming, 2(3):323-343, July 1992.

Crossref

Google Scholar

[16]

Mark Jones. Gofer 2.28 release notes. February 1993.

Google Scholar

[17]

Mark Jones. A system of constructor classes: overloading and implicit higher-order polymorphism. In ?roc. FPCA 93. Springer, 1993.

Digital Library

Google Scholar

[18]

Mark Jones Personal communication, May 1994.

Google Scholar

[19]

Mark Jones and Erik Meijer. Gofer goes bananas. In preparation, 1994.

Google Scholar

[20]

Grant Malcolm. Algebraic data types and program transformation. Science of Computer Programming, 14(2-3):255-280, September 1990.

Digital Library

Google Scholar

[21]

E.G. Manes and M.A. Arbib. Algebrmc Approaches to Program Semantics. Texts and Monographs in Computer Science. Springer-Verlag, 1986.

Digital Library

Google Scholar

[22]

Lambert Meertens. Algorithmics: Towards programming as a mathematicM activity. In Proc. CWI Symposium, Centre for Mathematics and Computer Science, Amsterdam, November 1983.

Google Scholar

[23]

Lambert Meertens. Paramorphisms. Formal Aspects of Computing, 4(5):413-425, 1992.

Crossref

Google Scholar

[24]

Erik Meijer. Calculating Compilers. PhD thesis, Nijmegen University, February 1992.

Google Scholar

[25]

Erik Meijer. More advice on proving a compiler correct: Improve a correct compiler. Submitted for Publication, September 1994.

Google Scholar

[26]

Erik Meijer. Type classes for better free theorems. In preparation, 1994.

Google Scholar

[27]

Erik Meijer, Maarten Fokkinga, and Ross Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In John Hughes, editor, Proceedings FPCA 91, number 523 in LNCS. Springer- Verlag, 1991.

Digital Library

Google Scholar

[28]

Ross Paterson. Control structures from types. Submitted for publication, 1994.

Google Scholar

[29]

Andrew M. Pitts. Relational properties of recursively defined domains. In Proc. LiCS 93. IEEE Computer Society Press, 1993.

Google Scholar

[30]

John C. Reynolds. On the relation between direct and continuation semantics. In Jacques Loeckx, editor, Proc. 2nd Colloquium on Automata, Languages and Programming, number 14 in LNCS, pages 141-156. Springer-Verlag, 1974.

Crossref

Google Scholar

[31]

John C. Reynolds. Types, abstraction and parametric polymorphism. Informat,on Processing, 83:513-523, 1983.

Google Scholar

[32]

David A. Schmidt. Denotational Semantics: A Methodology for Language Development. Allyn and Bacon, Inc., 1986.

Digital Library

Google Scholar

[33]

Tim Sheard and Leonidas Fegaras. A folci for all seasons. In Proc. FPCA 93. Springer, 1993.

Google Scholar

[34]

Mike B. Smyth and Gordon D. Plotkin. The category theoretic solution of recursive domain equations. SiAM Journal of Computing, pages 761-783, 1982.

Google Scholar

[35]

Doaitse Swierstra and Oege de Moor. Virtual data structures. Technical Report RUU-CS-92-16, Utrecht University, The Netherlands, 1992.

Google Scholar

[36]

Philip Wadler. Theorems for free} In Proc. FPCA 89. Springer, 1989.

Digital Library

Google Scholar

[37]

Philip Wadler. Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science, 73:231-248, 1990.

Digital Library

Google Scholar

Cited By

View all

Haeri SKeir P(2019)Solving the Expression Problem in C++, á la LMSTheoretical Aspects of Computing – ICTAC 201910.1007/978-3-030-32505-3_20(353-371)Online publication date: 22-Oct-2019
https://doi.org/10.1007/978-3-030-32505-3_20
Thiry LZhao HHassenforder M(2018)Categories for (Big) Data models and optimizationJournal of Big Data10.1186/s40537-018-0132-95:1Online publication date: 7-Jul-2018
https://doi.org/10.1186/s40537-018-0132-9
Chasins SBodik R(2017)Skip blocks: reusing execution history to accelerate web scriptsProceedings of the ACM on Programming Languages10.1145/31338751:OOPSLA(1-28)Online publication date: 12-Oct-2017
https://dl.acm.org/doi/10.1145/3133875
Show More Cited By

Index Terms

Bananas in space: extending fold and unfold to exponential types

Recommendations

Structural space of intramolecular peptide disulfides

Display Omitted General equation was derived to predict distinct cysteine patterns for given even number of cysteine residues in a sequence.Structural space of intramolecular peptide disulfides was deduced using combination of cysteine patterns and ...
Exploring sequence-structure relationships in the tyrosine kinome space

Motivation: Evolutionary and structural conservation patterns shared by more than 500 of identified protein kinases have led to complex sequence-structure relationships of cross-reactivity for kinase inhibitors. Understanding the molecular basis of ...
Chiral Polyhedra in Ordinary Space, I

Chiral polyhedra in ordinary euclidean space E3 are nearly regular polyhedra; their geometric symmetry groups have two orbits on the flags, such that adjacent flags are in distinct orbits. This paper completely enumerates the discrete infinite chiral ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

FPCA '95: Proceedings of the seventh international conference on Functional programming languages and computer architecture

October 1995

333 pages

ISBN:0897917197

DOI:10.1145/224164

Chairman:
John Williams
IBM Almaden Research Centre

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 October 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

FPCA95

Sponsor:

SIGPLAN
IFIP WG 2.8
SIGARCH

FPCA95: Conference on Functional Programming Languages & Computer Architecture

June 26 - 28, 1995

California, La Jolla, USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

88
Total Citations
View Citations
862
Total Downloads

Downloads (Last 12 months)97
Downloads (Last 6 weeks)11

Reflects downloads up to 12 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Haeri SKeir P(2019)Solving the Expression Problem in C++, á la LMSTheoretical Aspects of Computing – ICTAC 201910.1007/978-3-030-32505-3_20(353-371)Online publication date: 22-Oct-2019
https://doi.org/10.1007/978-3-030-32505-3_20
Thiry LZhao HHassenforder M(2018)Categories for (Big) Data models and optimizationJournal of Big Data10.1186/s40537-018-0132-95:1Online publication date: 7-Jul-2018
https://doi.org/10.1186/s40537-018-0132-9
Chasins SBodik R(2017)Skip blocks: reusing execution history to accelerate web scriptsProceedings of the ACM on Programming Languages10.1145/31338751:OOPSLA(1-28)Online publication date: 12-Oct-2017
https://dl.acm.org/doi/10.1145/3133875
Fischer LHanenberg S(2015)An empirical investigation of the effects of type systems and code completion on API usability using TypeScript and JavaScript in MS visual studioACM SIGPLAN Notices10.1145/2936313.281672051:2(154-167)Online publication date: 21-Oct-2015
https://dl.acm.org/doi/10.1145/2936313.2816720
Pape TFelgentreff THirschfeld RGulenko ABolz C(2015)Language-independent storage strategies for tracing-JIT-based virtual machinesACM SIGPLAN Notices10.1145/2936313.281671651:2(104-113)Online publication date: 21-Oct-2015
https://dl.acm.org/doi/10.1145/2936313.2816716
Leopoldseder DStadler LWimmer CMössenböck H(2015)Java-to-JavaScript translation via structured control flow reconstruction of compiler IRACM SIGPLAN Notices10.1145/2936313.281671551:2(91-103)Online publication date: 21-Oct-2015
https://dl.acm.org/doi/10.1145/2936313.2816715
Ernst EMøller ASchwarz MStrocco F(2015)Message safety in DartACM SIGPLAN Notices10.1145/2936313.281671151:2(41-53)Online publication date: 21-Oct-2015
https://dl.acm.org/doi/10.1145/2936313.2816711
Homer MJones TNoble J(2015)From APIs to languages: generalising method namesACM SIGPLAN Notices10.1145/2936313.281670851:2(1-12)Online publication date: 21-Oct-2015
https://dl.acm.org/doi/10.1145/2936313.2816708
Leather SJeuring JLöh ASchuur BChin WHage J(2014)Type-changing rewriting and semantics-preserving transformationProceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation10.1145/2543728.2543734(109-120)Online publication date: 11-Jan-2014
https://dl.acm.org/doi/10.1145/2543728.2543734
Day LHutton GPlasmeijer R(2013)Compilation à la CarteProceedings of the 25th symposium on Implementation and Application of Functional Languages10.1145/2620678.2620680(13-24)Online publication date: 28-Aug-2013
https://dl.acm.org/doi/10.1145/2620678.2620680
Show More Cited By

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.

Cited By

Index Terms

Recommendations

Structural space of intramolecular peptide disulfides

Exploring sequence-structure relationships in the tyrosine kinome space

Chiral Polyhedra in Ordinary Space, I