R. M. Burstall, D. B. MacQueen, D. T. Sannella  Home/Search
Context Related
Links: DBLP | dcs.ed.ac.uk/pub/dts/hope.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcs.ed.ac.uk/home/dt...SannellaDT (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Context of citations to this paper: More
...OCCS consists of four equations, which exhaust all possible inputs. This is reminiscent of programming in Prolog [8] or HOPE [6], and has become standard LCF style [9] Burstall recommended it long ago, in his still timely discourse on how to formulate and prove theorems by...
.... Milner type systems [35] have most commonly been incorporated into functional languages like Standard ML(SML) 36] Miranda[58] Hope[11] and Haskell[24] There is considerable anecdotal evidence that polymorphic type checking greatly reduces semantic errors in programs....
Cited by: More
Type Checking Type Classes - Nipkow, Prehofer (1993) (Correct)
Decidability of Bounded Higher-Order Unification - Schmidt-Schauß, Schulz (2002) (Correct)
Improving Polymorphic Type Explanations - Yang (2001) (Correct)
Active bibliography (related documents): More All
0.5: A Verified Implementation of an Applicative Language with Dynamic .. - Flatau (1992) (Correct)
0.3: Resource Management for the Tagged Token Dataflow Architecture - Culler (1985) (Correct)
0.3: A Compiler Approach to Scalable Concurrent Program Design - Foster, Taylor (1992) (Correct)
Similar documents based on text: More All
0.1: The Impact of Distribution on Object-Oriented. . . - Blair, al. (1992) (Correct)
0.1: Appendix A - Voda (Correct)
0.1: The definition of Extended ML: a gentle introduction - Kahrs, Sannella, Tarlecki (1995) (Correct)
Related documents from co-citation: More All
37: Miranda: A non-strict functional language with polymorphic types (context) - Turner - 1985
35: A theory of type polymorphism in programming (context) - Milner - 1978
20: The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
BibTeX entry: (Update)
Burstall, R.M., D.B. MacQueen and D.T. Sanella (1980). Hope: An experimental applicative language, Proc. of The 1980 LISP Conference, pp. 136--143. http://citeseer.ist.psu.edu/burstall80hope.html More
@inproceedings{ burstall80hope,
author = "R. M. Burstall and D. B. MacQueen and D. T. Sannella",
title = "{Hope: An Experimental Applicative Language}",
booktitle = "{Conference Record of the 1980 {LISP} Conference}",
publisher = "ACM Press",
address = "Stanford University, Stanford, California, August 25--27",
pages = "136--143",
year = "1980",
url = "citeseer.ist.psu.edu/burstall80hope.html" }
Citations (may not include all citations):109 Putting Theories Together to Make Specifications (context) - Burstall, Goguen - 1977
71 Structured Programming (context) - Dahl, Hoare - 1972
53 The SIMULA 67 Common Base Language (context) - Dahl, Nygaard - 1970
8 as Exemplified by the SETL Representation Sublanguage (context) - Dewar, Grand et al.
7 Design Considerations for a Functional Programming Language (context) - Burstall - 1977
3 Can Programming Be Liberated from the yon Neumann Style (context) - Backus - 1978
2 Strategies for Mechanizing Structural Induction (context) - Aubin - 1977 DBLP
1 on Mathematical Foundations of Computer Science (context) - Burstall - 1980
1 A Transformation System for Developing Reoursive Programs (context) - Burstall, Darlington - 1977
1 Prorammin Technicue (context) - Burge - 1975
1 HOPE User's Manual (context) - Burstall, Sannella
1 A Comoutational Logic (context) - Boyer, Moore - 1980
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.dcs.ed.ac.uk/home/dts/pub/SannellaDT.html): More
Pre-logical Relations - Honsell, Sannella (1999) (Correct)
Essential Concepts of Algebraic Specification and Program.. - Sannella, Tarlecki (1996) (Correct)
A Compositional Generalisation of Logical Relations - Plotkin, Power, Sannella (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC