More Web Proxy on the site http://driver.im/

Article

Free access

HOPE: An experimental applicative language

Authors:

R. M. Burstall,

D. B. MacQueen,

D. T. SannellaAuthors Info & Claims

LFP '80: Proceedings of the 1980 ACM conference on LISP and functional programming

Pages 136 - 143

https://doi.org/10.1145/800087.802799

Published: 25 August 1980 Publication History

Abstract

An applicative language called HOPE is described and discussed. The underlying goal of the design and implementation effort was to produce a very simple programming language which encourages the construction of clear and manipulable programs. HOPE does not include an assignment statement; this is felt to be an important simplification. The user may freely define his own data types, without the need to devise a complicated encoding in terms of low-level types. The language is very strongly typed, and as implemented it incorporates a typechecker which handles polymorphic types and overloaded operators. Functions are defined by a set of recursion equations; the left-hand side of each equation includes a pattern used to determine which equation to use for a given argument. The availability of arbitrary higher-order types allows functions to be defined which 'package' recursion. Lazily-evaluated lists are provided, allowing the use of infinite lists which could be used to provide interactive input/output and concurrency. HOPE also includes a simple modularisation facility which may be used to protect the implementation of an abstract data type.

References

[1]

Aubin, R. Strategies for Mechanizing Structural Induction. Proc. 5th Int. Joint Conf. on Artificial Intelligence, Cambridge, Massachusetts, August, 1977, pp. 363-369.

Digital Library

[2]

Backus, J. Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs. Comm. ACM 21, 8 (August 1978), 613-641.

Digital Library

[3]

Boyer, R.S. and Moore, J.S. A Computational Logic. Academic Press, 1980.

[4]

Burge, W.H. Recursive Programming Techniques. Addison-Wesley, 1975.

[5]

Burstall, R.M. Design Considerations for a Functional Programming Language. Infotech State of the Art Conference: The Software Revolution, Copenhagen, October, 1977.

[6]

Burstall, R.M. Electronic Category Theory. Proc. 9th Int. Symp. on Mathematical Foundations of Computer Science, Rydzyna, Poland, September, 1980.

Digital Library

[7]

Burstall, R.M. and Darlington, J. A Transformation System for Developing Recursive Programs. J. ACM 24, 1 (January 1977), 44-67.

Digital Library

[8]

Burstall, R.M. and Goguen, J.A. Putting Theories Together to Make Specifications. Proc. 5th Int. Joint Conf. on Artificial Intelligence, Cambridge, Massachusetts, August, 1977, pp. 1045-1058.

[9]

Burstall, R.M. and Sannella, D.T. HOPE User's Manual. In preparation.

[10]

Dahl, O-J., Dijkstra, E.W. and Hoare C.A.R. Structured Programming. Academic Press, 1972.

Digital Library

[11]

Dahl, O-J., Myhrhaug, B. and Nygaard, K. The SIMULA 67 Common Base Language. Publication S22, Norwegian Computing Centre, Oslo, 1970.

[12]

Dewar, R.B.K., Grand, A., Liu, S-C. and Schwartz, J.T. Programming by Refinement, as Exemplified by the SETL Representation Sublanguage. ACM Trans. Programming Languages and Systems 1, 1 (July 1979), 27-49.

Digital Library

[13]

Feather, M.S. A System for Developing Programs by Transformation. Ph.D. Th., University of Edinburgh, 1979.

[14]

Goguen, J.A. and Burstall, R.M. CAT, a System for the Structured Elaboration of Correct Programs from Structured Specifications. In preparation.

[15]

Goguen, J.A. and Tardo, J.J. An Introduction to OBJ: A Language for Writing and Testing Formal Algebraic Program Specifications. Specifications of Reliable Software Conf. Proc., Cambridge, Massachusetts, April, 1979.

[16]

Gordon, M.J.C. The Denotational Description of Programming Languages. Springer-Verlag, 1979.

Digital Library

[17]

Gordon, M.J.C., Milner, A.J.R.G., Morris, L., Newey, M. and Wadsworth, C. A Metalanguage for Interactive Proof in LCF. Proc. 5th ACM Symp. on Principles of Programming Languages, Tucson, Arizona, 1978.

Digital Library

[18]

Henderson, P. and Morris, J. A Lazy Evaluator. Proc. 3rd ACM Symp. on Principles of Programming Languages, Atlanta, Georgia, 1976, pp. 95-103.

Digital Library

[19]

Henderson, P. and Snowdon, R. An Experiment in Structured Programming. BIT 12, 1 (1972), 38-53.

[20]

Ichbiah, J.D. et al. Preliminary ADA Reference Manual. SIGPLAN Notices 14, 6A (June 1979).

Digital Library

[21]

Iverson, K. A Programming Language. John Wiley and Sons, 1962.

Digital Library

[22]

Jenks, R.D. The SCRATCHPAD Language. Proc. Symp. on Very High Level Languages, April, 1974.

Digital Library

[23]

Kernighan, B.W. and Plauger, P.J. Software Tools. Addison-Wesley, 1976.

Digital Library

[24]

Landin, P.J. The Next 700 Programming Languages. Comm. ACM 9, 3 (March 1966), 157-166.

Digital Library

[25]

Liskov, B., Snyder, A., Atkinson, R. and Schaffert, C. Abstraction Mechanisms in CLU. Comm. ACM 20, 8 (August 1977), 564-576.

Digital Library

[26]

Milne, G. and Milner, R. Concurrent Processes and Their Syntax. J. ACM 26, 2 (April 1979), 302-321.

Digital Library

[27]

Milner, R. A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences 17, 3 (December 1978), 348-375.

[28]

Turner, D.A. SASL Language Manual. University of St. Andrews, 1979.

[29]

Wadsworth, C.P. Semantics and Pragmatics of the Lambda Calculus. Ph.D. Th., Programming Research Unit, Oxford University, 1971.

[30]

Warren, D.H.D, Pereira, L.M. and Pereira, F.C.N. PROLOG—The Language and Its Implementation Compared With LISP. Proc. ACM Symp. on Artificial Intelligence and Programming Languages, Rochester, New York, August, 1977.

Digital Library

[31]

Wulf, W.A., London, R.L. and Shaw, M. An Introduction to the Construction and Verification of Alphard Programs. IEEE Trans. on Software Eng. SE-2, 4 (December 1976), 253-265.

Digital Library

Cited By

Naish L(2024)A Brief Overview of the Pawns Programming LanguageSoftware10.3390/software30400233:4(473-497)Online publication date: 19-Nov-2024
https://doi.org/10.3390/software3040023
Cheng LParreaux L(2024)The Ultimate Conditional SyntaxProceedings of the ACM on Programming Languages10.1145/36897468:OOPSLA2(988-1017)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689746
Baudon TRadanne GGonnord L(2023)Bit-Stealing Made Legal: Compilation for Custom Memory Representations of Algebraic Data TypesProceedings of the ACM on Programming Languages10.1145/36078587:ICFP(813-846)Online publication date: 31-Aug-2023
https://dl.acm.org/doi/10.1145/3607858
Show More Cited By

Index Terms

HOPE: An experimental applicative language
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Abstract data types
      2. Language types

Recommendations

Faith, hope, and love: an essay on software science's neglect of human factors
OOPSLA '10: Proceedings of the ACM international conference on Object oriented programming systems languages and applications

Research in the area of programming languages has different facets -- from formal reasoning about new programming language constructs (such as type soundness proofs for new type systems) over inventions of new abstractions, up to performance ...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12: Proceedings of the 2012 Haskell Symposium

Programmers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12

Programmers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

LFP '80: Proceedings of the 1980 ACM conference on LISP and functional programming

August 1980

247 pages

ISBN:9781450373968

DOI:10.1145/800087

Copyright © 1980 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]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 August 1980

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 30 of 109 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

209
Total Citations
View Citations
1,640
Total Downloads

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

Reflects downloads up to 12 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Naish L(2024)A Brief Overview of the Pawns Programming LanguageSoftware10.3390/software30400233:4(473-497)Online publication date: 19-Nov-2024
https://doi.org/10.3390/software3040023
Cheng LParreaux L(2024)The Ultimate Conditional SyntaxProceedings of the ACM on Programming Languages10.1145/36897468:OOPSLA2(988-1017)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689746
Baudon TRadanne GGonnord L(2023)Bit-Stealing Made Legal: Compilation for Custom Memory Representations of Algebraic Data TypesProceedings of the ACM on Programming Languages10.1145/36078587:ICFP(813-846)Online publication date: 31-Aug-2023
https://dl.acm.org/doi/10.1145/3607858
Apriyadi RMasuhara HCong YGonzalez Boix EScholliers C(2023)Program State Visualizer with User-Defined Representation Conversion (WIP)Proceedings of the 1st ACM International Workshop on Future Debugging Techniques10.1145/3605155.3605863(5-10)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.1145/3605155.3605863
Mordido ASpaderna JThiemann PVasconcelos V(2023)Parameterized Algebraic ProtocolsProceedings of the ACM on Programming Languages10.1145/35912777:PLDI(1389-1413)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591277
Yuan YGuest SGriffis EPotter HMoon DOmar C(2023)Live Pattern Matching with Typed HolesProceedings of the ACM on Programming Languages10.1145/35860487:OOPSLA1(609-635)Online publication date: 6-Apr-2023
https://dl.acm.org/doi/10.1145/3586048
DANVY O(2023)Folding left and right matters: Direct style, accumulators, and continuationsJournal of Functional Programming10.1017/S095679682200015633Online publication date: 14-Feb-2023
https://doi.org/10.1017/S0956796822000156
Smits JHartman TCockx JFischer BBurgueño LCazzola W(2022)Optimising First-Class Pattern MatchingProceedings of the 15th ACM SIGPLAN International Conference on Software Language Engineering10.1145/3567512.3567519(74-83)Online publication date: 29-Nov-2022
https://dl.acm.org/doi/10.1145/3567512.3567519
Pettorossi A(2020)A Historical Account of My Early Research InterestsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.320.1320(1-28)Online publication date: 7-Aug-2020
https://doi.org/10.4204/EPTCS.320.1
Kohn Tvan Rossum GBucher II GTalin Levkivskyi I(2020)Dynamic pattern matching with PythonProceedings of the 16th ACM SIGPLAN International Symposium on Dynamic Languages10.1145/3426422.3426983(85-98)Online publication date: 17-Nov-2020
https://dl.acm.org/doi/10.1145/3426422.3426983
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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 Table of Contents