Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Origin  





2 Formulation  





3 Examples  





4 See also  





5 Notes  





6 References  





7 External links  














Principle of least astonishment






العربية
Čeština
Deutsch
Español
Français

Latina
Magyar

Русский
Slovenščina
Svenska
Українська
Tiếng Vit
 

Edit links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 


Inuser interface design and software design,[1] the principle of least astonishment (POLA), also known as principle of least surprise,[a] proposes that a component of a system should behave in a way that most users will expect it to behave, and therefore not astonish or surprise users. The following is a corollary of the principle: "If a necessary feature has a high astonishment factor, it may be necessary to redesign the feature."[4]

The principle has been in use in relation to computer interaction since at least the 1970s. Although first formalized in the field of computer technology, the principle can be applied broadly in other fields. For example, in writing, a cross-reference to another part of the work or a hyperlink should be phrased in a way that accurately tells the reader what to expect.

Origin

[edit]

An early reference to the "Law of Least Astonishment" appeared in the PL/I Bulletin in 1967 (PL/I is a programming language released by IBM in 1966).[5] By the late 1960s, PL/I had become infamous for violating the law,[6] for example because, due to PL/I's precision conversion rules,[7] the expressions 25 + 1/3 and 1/3 + 25 would either produce a fatal error, or, if errors were suppressed, 5.33333333333 instead of the correct 25.33333333333.[8]

The law appeared written out in full in 1972:

For those parts of the system which cannot be adjusted to the peculiarities of the user, the designers of a systems programming language should obey the “Law of Least Astonishment.” In short, this law states that every construct in the system should behave exactly as its syntax suggests. Widely accepted conventions should be followed whenever possible, and exceptions to previously established rules of the language should be minimal.[9]

Formulation

[edit]

A textbook formulation is: "People are part of the system. The design should match the user's experience, expectations, and mental models."[10]

The principle aims to leverage the existing knowledge of users to minimize the learning curve, for instance by designing interfaces that borrow heavily from "functionally similar or analogous programs with which your users are likely to be familiar".[2] User expectations in this respect may be closely related to a particular computing platformortradition. For example, Unix command line programs are expected to follow certain conventions with respect to switches,[2] and widgetsofMicrosoft Windows programs are expected to follow certain conventions with respect to keyboard shortcuts.[11] In more abstract settings like an API, the expectation that function or method names intuitively match their behavior is another example.[12] This practice also involves the application of sensible defaults.[4]

When two elements of an interface conflict, or are ambiguous, the behavior should be that which will least surprise the user; in particular a programmer should try to think of the behavior that will least surprise someone who uses the program, rather than that behavior that is natural from knowing the inner workings of the program.[4]

The choice of "least surprising" behavior can depend on the expected audience (for example, end users, programmers, or system administrators).[2]

Examples

[edit]

Websites offering keyboard shortcuts often allow pressing ? to see the available shortcuts. Examples include Gmail,[13] YouTube,[14] and Jira.[15]

InWindows operating systems and some desktop environments for Linux, the F1 function key typically opens the help program for an application. A similar keyboard shortcut in macOSisCommand+⇧ Shift+/. Users expect a help windoworcontext menu when they press the usual help shortcut key(s). Software that instead uses this shortcut for another feature is likely to cause astonishment if no help appears.[16]

Aprogramming language's standard library usually provides a function similar to the pseudocode ParseInteger(string, radix), which creates a machine-readable integer from a string of human-readable digits. The radix conventionally defaults to 10, meaning the string is interpreted as decimal (base 10). This function usually supports other bases, like binary (base 2) and octal (base 8), but only when they are specified explicitly. In a departure from this convention, JavaScript originally defaulted to base 8 for strings beginning with "0", causing developer confusion and software bugs.[17] This was discouraged in ECMAScript 3 and dropped in ECMAScript 5.[18]

Some development communities like FreeBSD[19] use POLA as one of the guidelines for what makes an unsurprising user experience.

See also

[edit]

Notes

[edit]
  1. ^ Alternatively a law of least surpriseorrule of least surprise.[2][3]

References

[edit]
  1. ^ Seebach, Peter (2001-08-01). "The Principle of Least Astonishment". The cranky user. IBM DeveloperWorks. Retrieved 2014-01-23.
  • ^ a b c d Raymond, Eric Steven (2003). "Applying the Rule of Least Surprise". The Art of Unix Programming. faqs.org. p. 20. ISBN 978-0-13-142901-7. Retrieved 2020-08-23.
  • ^ James, Geoffrey (1987). The Tao of Programming. InfoBooks. 4.1. ISBN 0-931137-07-1. Retrieved 2014-02-05.
  • ^ a b c Cowlishaw, M. F. (1984). "The design of the REXX language" (PDF). IBM Systems Journal. 23 (4): 333. doi:10.1147/sj.234.0326. Retrieved 2014-01-23. Could there be a high astonishment factor associated with the new feature? If a feature is accidentally misapplied by the user and causes what appears to him to be an unpredictable result, that feature has a high astonishment factor and is therefore undesirable. If a necessary feature has a high astonishment factor, it may be necessary to redesign the feature.
  • ^ Southworth, R. N. (December 1967). Southworth, R. N. (ed.). "Proposal for PL/I Pseudo-name". ACM SIGPLAN Notices. 2 (12) (PL/I Bulletin no. 5 ed.): 6. doi:10.1145/1139502.1139504. ISSN 0362-1340. S2CID 12180929.
  • ^ Date, C. J. (11 February 2022). Database Dreaming Volume I: Relational Writings Revised and Revived. Technics Publications. Ch.2, Reference 36. ISBN 978-1-63462-984-3. As a friend of mine once remarked to me—this must have been sometime in the late 1960s—whatever else you might say about it, there's one thing that PL/I is most definitely not, and that's 'the language of least astonishment.'
  • ^ Tremblay, Jean-Paul; Sorenson, Paul G. (1985). The theory and practice of compiler writing. New York: McGraw-Hill. ISBN 9780070651616. PL/I is the major bad example here; it is strewn with constructs which do not do what the programmer thinks, as exemplified with FIXED division.
  • ^ Multiple sources:
    • Holt, Richard C. (May 1973). "Teaching the fatal disease: (or) introductory computer programming using PL/I". ACM SIGPLAN Notices. 8 (5): 8–23. doi:10.1145/986948.986950. unfortunately, the expression '25 + 1/3' yields 5.33333333333333
    • Golden, Donald (October 1980). "A plea for friendly software". ACM SIGSOFT Software Engineering Notes. 5 (4): 4–5. doi:10.1145/1010884.1010885. Lest the non-PL/I programmer come to the erroneous conclusion that PL/I is without flaws, consider the following examples of PL/I's hostility. The rules for type conversion in PL/I are enough to give programmers ulcers. What other language would produce a fatal error when evaluating the expression (25 + 1/3)? (Just as bad, if you suppress the error checking, the result of evaluating the expression is 5.3333...)
    • Stansifer, Ryan D. (1995). The Study of Programming Languages. Englewood Cliffs, N.J. : Prentice Hall. p. 123. ISBN 978-0-13-726936-5. PL/I is infamous in this regard, as it converts nearly any type into any other type, sometimes with surprising results. Consider the expression 1/3 + 25. In PL/I this expression has the value 5.33333333333. Why? One-third is computed to 15 digits of precision, 14 to the right of the decimal point. Then 25 is coerced to the same precision, losing the most significant digit 2! This does raise an error in PL/I, but the default is to ignore it. This first appeared in print in Barron 1968, where it is given as a violation of a folk law of language design: 'the law of least astonishment.'
    • "Enterprise PL/I for z/OS 5.3 - Language Reference" (PDF). IBM. March 2021. pp. 57–62. Consider the following expression: 25+1/3. The result of evaluating this expression is undefined and the FIXEDOVERFLOW condition is raised because FIXED division results in a value of maximum implementation defined precision. [...] The results of the two evaluations are reached as shown in Table 29.
  • ^ Bergeron, R.D.; Gannon, J.D.; Shecter, D.P.; Tompa, F.W.; Dam, A. Van (1972). "Systems Programming Languages". Advances in Computers. 12: 175–284. doi:10.1016/s0065-2458(08)60510-0. ISBN 9780120121120.
  • ^ Saltzer, J. H.; Kaashoek, Frans (2009). Principles of computer system design: an introduction. Morgan Kaufmann. p. 85. ISBN 978-0-12-374957-4.
  • ^ Petroutsos, Evangelos (2010). Mastering Microsoft Visual Basic 2010. Wiley. p. 133. ISBN 978-0-470-53287-4.
  • ^ Bloch, Joshua (2006). "How to design a good API and why it matters". Proceeding OOPSLA '06 Companion to the 21st ACM SIGPLAN symposium on Object-oriented programming systems, languages, and applications. Association for Computing Machinery. pp. 506–7. doi:10.1145/1176617.1176622. ISBN 1-59593-491-X. S2CID 27230400.
  • ^ Vivian (2013-06-21). "Keyboard shortcuts for Gmail". Google Inc. Retrieved 2013-07-27.
  • ^ "Keyboard shortcuts for YouTube - YouTube Help". support.google.com. Retrieved 2022-08-16.
  • ^ "Using Keyboard Shortcuts". Atlassian. Retrieved 2013-07-27.
  • ^ Keizer, G. (1 March 2010). "Microsoft: Don't press F1 key in Windows XP". Computerworld. Retrieved 10 Nov 2019.
  • ^ "Why does the radix for JavaScript's parseInt default to 8?". Stack Overflow. 8 April 2011.
  • ^ "parseInt()", Mozilla Developer Network (MDN), 15 March 2024, If the input string begins with "0" (a zero), radix is assumed to be 8 (octal) or 10 (decimal). Exactly which radix is chosen is implementation-dependent. ECMAScript 5 clarifies that 10 (decimal) should be used, but not all browsers support this yet.
  • ^ "Frequently Asked Questions for FreeBSD 2.X, 3.X and 4.X". FreeBSD. 2002-06-11. Retrieved 2023-02-15.
  • [edit]
    Retrieved from "https://en.wikipedia.org/w/index.php?title=Principle_of_least_astonishment&oldid=1235483062"

    Categories: 
    Heuristics
    Ergonomics
    Humancomputer interaction
    Programming principles
    Hidden categories: 
    Articles with short description
    Short description matches Wikidata
     



    This page was last edited on 19 July 2024, at 13:48 (UTC).

    Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



    Privacy policy

    About Wikipedia

    Disclaimers

    Contact Wikipedia

    Code of Conduct

    Developers

    Statistics

    Cookie statement

    Mobile view



    Wikimedia Foundation
    Powered by MediaWiki