Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/99370.99383acmconferencesArticle/Chapter ViewAbstractPublication PagesfpcaConference Proceedingsconference-collections
Article
Free access

Retrieving re-usable software components by polymorphic type

Published: 01 November 1989 Publication History
First page of PDF

References

[1]
R. Milner, "A theory of type polymorphism in programming", Journal of Computer and System Sciences 17(3) (1978).
[2]
R. Burstall, D. MacQueen and D. Sannella, "HOPE: an experimental applicative language", pp. 136-143 in Record of the LISP Conference, Association of Computing Machinery (1980).
[3]
D. A. Turner, "Miranda: A Non-Strict Functional Language with Polymorphic Types", pp. 1-16 in Functional Programming Languages and Computer Architecture, ed. Jean-Pierre Jouannaud, Springer-Verlag LNCS 201 (September 1985).
[4]
R. MiMer, "A proposal for Standard ML", pp. 184-197 in ACM Symposium on LISP and Functional Programming, Austin, Texas (1984).
[5]
L. Cardelli, "Basic Polymoxphic Typechecking", Polymorphism 2(1 ) (January 1985).
[6]
S. L. Peyton Jones, The Implementation of Functional Programming Languages, Prentiee-HaU (1987).
[7]
I. Toyn, A. Dix and C. Runciman, "Performance Polymorphism", pp. 325-346 in Functional Programming Languages and Computer Architecture, Springer-Verlag LNCS 274 (1987).
[8]
C. Runciman and i. Toyn, Notes for Glide users (4th edition), Department of Computer Science, University of York (January 1989).
[9]
L. Augustsson and T. Johnsson, "LML Users' Manual", PMG Report, Department of Computer Science, Chalmers University of Technology, Goteborg (1987).
[10]
P. Wadlcr, Q. Millur and M. Raskovsky, The OL Manual, Oxford University Computing Laboratory (1986).
[11]
N. Wixth, "Program l~velopment by Stepwise Refinement (Reprint)", Cammunications of the ACM 26(1), pp. 70-74 (January 1983).
[12]
E.W. DijIcstra, A discipline of programming, Prentice-Hall (1976).
[13]
J. Darlington, "A synthesis of several sorting algorithms", Acta lnformatica 11, pp. 1-30 (1978).
[14]
A. Martelli and U. Montanari, "An Efficient Unification Algorithm", ACM Transactions on Programming Lansuases and Systems 4(2), pp. 258-282 (April 1982).
[15]
D. H. D. Warren, "Implementing Prolog- Compiling Predicate Logic Programs", Research Reports 39 & 40, Department of Anific-ial Intelligence, University of Edinburgh (1977).
[16]
H. /. Komorowski, "'QL(~ - the programming environment for Prolog in LISP", in Logic Programming, ed. K. L. Clark and S. -A. Tamlund, Academic Press (1982).
[17]
J. Conklin, "Hypertext: an Introduction and Survey", IEEE Computer 20(9) (1987).
[18]
i. Toyn, "Explorawry Environments' for Functional Programming", DPhil Thesis YCST 87/02, Department of Computer Science, University of York (April 1987).
[19]
M. Rittri, "Using Types as Search Keys in Function Libraries", in Proc. Conf. Functional Programming Languages and Computer Architecture, ACM Press, London (September 1989).
[20]
J. Faixbaim, "A new ty~-checker for a functional language", Science of Computer Programming 6, pp. 273- 290 (1986).
[21]
L. A, Jategaonkar and J. C. Mitchell, "ML with Extended Pattern Matching and Subtypes", pp. 198-211 in ACM Conference on LiSP and Functional Programming, Snowbird, Utah (July 1988).
[22]
D. E. Knuth, "Literate Programming", BCS Computer Journal 27(2), pp. 9%111 (May 1984).

Cited By

View all
  • (2023)A text-based syntax completion method using LR parsing and its evaluationScience of Computer Programming10.1016/j.scico.2023.102957228:COnline publication date: 5-Jun-2023
  • (2021)A text-based syntax completion method using LR parsingProceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation10.1145/3441296.3441395(32-43)Online publication date: 18-Jan-2021
  • (2021)Finding Substitutable Binary Code By Synthesizing AdaptersIEEE Transactions on Software Engineering10.1109/TSE.2019.293100047:8(1626-1643)Online publication date: 1-Aug-2021
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
FPCA '89: Proceedings of the fourth international conference on Functional programming languages and computer architecture
November 1989
395 pages
ISBN:0897913280
DOI:10.1145/99370
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1989

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

FPCA89
Sponsor:

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)31
  • Downloads (Last 6 weeks)4
Reflects downloads up to 14 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2023)A text-based syntax completion method using LR parsing and its evaluationScience of Computer Programming10.1016/j.scico.2023.102957228:COnline publication date: 5-Jun-2023
  • (2021)A text-based syntax completion method using LR parsingProceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation10.1145/3441296.3441395(32-43)Online publication date: 18-Jan-2021
  • (2021)Finding Substitutable Binary Code By Synthesizing AdaptersIEEE Transactions on Software Engineering10.1109/TSE.2019.293100047:8(1626-1643)Online publication date: 1-Aug-2021
  • (2020)Semantic code search via equational reasoningProceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3385412.3386001(1066-1082)Online publication date: 11-Jun-2020
  • (2020)An approach to generate text-based IDEs for syntax completion based on syntax specificationProceedings of the 2020 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation10.1145/3372884.3373158(38-44)Online publication date: 20-Jan-2020
  • (2014)Seeking the user interfaceProceedings of the 29th ACM/IEEE International Conference on Automated Software Engineering10.1145/2642937.2642976(103-114)Online publication date: 15-Sep-2014
  • (2012)An approach to completing variable names for implicitly typed functional languagesProceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation10.1145/2103746.2103771(131-140)Online publication date: 23-Jan-2012
  • (2012)An approach to completing variable names for implicitly typed functional languagesHigher-Order and Symbolic Computation10.1007/s10990-013-9095-x25:1(127-163)Online publication date: 1-Mar-2012
  • (2009)Semantics-based code searchProceedings of the 31st International Conference on Software Engineering10.1109/ICSE.2009.5070525(243-253)Online publication date: 16-May-2009
  • (2008)Using types as search keys in function librariesJournal of Functional Programming10.1017/S095679680000006X1:01(71-89)Online publication date: 7-Nov-2008
  • 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

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media