John Scholes

From APL Wiki
Revision as of 16:39, 23 September 2019 by 24.84.228.210 (talk)
Jump to navigation Jump to search

Template:Use dmy dates Template:Infobox scientist

John Morley Scholes (1948–2019) was a British computer scientist. His professional career was devoted to the development of the programming language APL. He was the designer and implementer of direct functions.

Personal

John Scholes was born on 24 April 1948 to Gerry and Amy Scholes. He grew up in Leamington Spa, Warwickshire, England, and attended Leamington College for Boys between 1960-1966. Between 1966-69 he attended the University of Manchester and received the B.Sc. (Hons) degree in Maths.[1]

Scholes enjoyed poetic and romantic qualities in his life. Apart from APL, he also found beauty in nature, the opera, the music of Tom Waits, the literature of James Joyce, the poetry of W.B. Yeats. He was a member of the Joyce society in Dublin. In 2013, he and his wife Flora Dowling went to Sligo to the W.B. Yeats Summer School and met the poet Seamus Heaney the summer before Heaney died.[1]

The APL side and the romantic side often met: The Depth-First Search video[2] (below) was recorded at dawn on the summer solstice of 2014, with birdsong in the air, while he and his wife were on a 21-day Zen retreat in France led by Thích Nhất Hạnh. Scholes was pleased with both the technical content and the circumstances of that work.[1]

Career

Scholes's first job was as a trainee computer programmer with ICL (1969-70) and from there he went on to the Operations Research Department of WS Atkins in Epsom, Surrey (1971-75) and then to the Sales Support Department in Warrington, Lancashire (1976-77). Between 1977 and 1978 he worked with the European Space Agency in Madrid, Spain as a programmer for the International Ultraviolet Explorer project. He then returned to ICL Dataskil working on APL for the VME/B Operating system (1978-82). In 1982 he started the Dyalog APL Project for Unix Machines and in 1988 became a Partner and Director of the Dyalog Company. In 2004 Scholes sold his shares in the Company, but continued as a consultant and, in his words, pursued his passionate interest in APL programming on various mathematical topics in general and functional programming in particular. Or "nerding", as he also called it.[1]

Direct functions (dfns)

Kenneth E. Iverson, the inventor of APL, was dissatisfied with the way user functions were defined. In 1974, he devised "formal function definition" or "direct definition" for use in exposition.[3] A direct definition has two or four parts, separated by colons: 

name : expr
name : expr0 : prop : expr1

Within a direct definition, ⍺ denotes the left argument and ⍵ the right argument. In the first instance, the result of expr is the result of the function; in the second instance, the result of the function is that of expr0 if prop evaluates to 0, or expr1 if it evaluates to 1. Assignments within a direct definition are dynamically local (accessible within called functions). Further examples of direct definition are found in the 1979 Turing Award Lecture[4] and in an application paper in 1987.[5][6]

Direct definition was too limited for use in larger systems. The ideas were further developed by multiple authors in multiple works[7][8][9][10][11][12][13] but the results were unwieldy. Of these, the "alternative APL function definition" of Bunda in 1987[12] came closest to current facilities, but is flawed in conflicts with existing symbols and in error handling which would have caused practical difficulties, and was never implemented. The main distillates from the different proposals were that (a) the function being defined is anonymous, with subsequent naming (if required) being effected by assignment; (b) the function is denoted by a symbol and thereby enables anonymous recursion.[6]

In 1996, Scholes invented direct functions or dfns (pronounced "dee funs"), a major distinguishing advance of current APL over previous versions.[14][15][16][17] Dfns are a unique combination of array programming, higher-order functions, and functional programming. The ideas originated in 1989 when he read a special issue of The Computer Journal on functional programming.[18] He then proceeded to study functional programming and became strongly motivated ("sick with desire", like Yeats) to bring these ideas to APL.[16][17] He initially operated in stealth because he was concerned the changes might be judged too radical and an unnecessary complication of the language; other observers say that he operated in stealth because Dyalog colleagues were not so enamored and thought he was wasting his time and causing trouble for people. Dfns were first presented at the APL '96 Conference in San Antonio and released in Dyalog APL in early 1997.[14] Acceptance and recognition were slow in coming. As late as 2008, in Dyalog at 25,[19] a publication celebrating the 25th anniversary of Dyalog Ltd, dfns were barely mentioned (mentioned twice as "dynamic functions" and without any elaboration). As of 2019, dfns are implemented in Dyalog APL, NARS2000[20] and NGNAPL[21]. They also play a key role in efforts to exploit the computational capabilities of a GPU.[22][6]

Dfns is illustrated here with an example. Much more extensive explanation and examples can be found in the direct functions article and in references[15][6][23].

Quicksort on an array ⍵ works by choosing a "pivot" at random among its major cells, then catenating the sorted major cells which strictly precede the pivot, the major cells equal to the pivot, and the sorted major cells which strictly follow the pivot, as determined by a comparison function ⍺⍺. Defined as a dop (direct operator) Q: 

   Q←{1≥≢⍵:⍵ ⋄ (∇ ⍵⌿⍨0>s)⍪(⍵⌿⍨0=s)⍪∇ ⍵⌿⍨0<s←⍵ ⍺⍺ ⍵⌷⍨?≢⍵}

   ⍝ precedes            ⍝ follows            ⍝ equals
   2 (×-) 8              8 (×-) 2             8 (×-) 8
¯1                    1                    0

   x← 2 19 3 8 3 6 9 4 19 7 0 10 15 14

   (×-) Q x
0 2 3 3 4 6 7 8 9 10 14 15 19 19

Q3 is a variant that catenates the three parts enclosed by the function ⊂ instead of the parts per se. The three parts generated at each recursive step are apparent in the structure of the final result. Applying the function derived from Q3 to the same argument multiple times gives different results because the pivots are chosen at random. In-order traversal of the results does yield the same sorted array. 

   Q3←{1≥≢⍵:⍵ ⋄ (⊂∇ ⍵⌿⍨0>s)⍪(⊂⍵⌿⍨0=s)⍪⊂∇ ⍵⌿⍨0<s←⍵ ⍺⍺ ⍵⌷⍨?≢⍵}

   (×-) Q3 x
┌────────────────────────────────────────────┬─────┬┐
│┌──────────────┬─┬─────────────────────────┐│19 19││
││┌──────┬───┬─┐│6│┌──────┬─┬──────────────┐││     ││
│││┌┬─┬─┐│3 3│4││ ││┌┬─┬─┐│9│┌┬──┬────────┐│││     ││
│││││0│2││   │ ││ ││││7│8││ │││10│┌──┬──┬┐││││     ││
│││└┴─┴─┘│   │ ││ ││└┴─┴─┘│ │││  ││14│15││││││     ││
││└──────┴───┴─┘│ ││      │ │││  │└──┴──┴┘││││     ││
││              │ ││      │ │└┴──┴────────┘│││     ││
││              │ │└──────┴─┴──────────────┘││     ││
│└──────────────┴─┴─────────────────────────┘│     ││
└────────────────────────────────────────────┴─────┴┘
   (×-) Q3 x
┌───────────────────────────┬─┬─────────────────────────────┐
│┌┬─┬──────────────────────┐│7│┌────────────────────┬─────┬┐│
│││0│┌┬─┬─────────────────┐││ ││┌──────┬──┬────────┐│19 19│││
│││ │││2│┌────────────┬─┬┐│││ │││┌┬─┬─┐│10│┌──┬──┬┐││     │││
│││ │││ ││┌───────┬─┬┐│6│││││ │││││8│9││  ││14│15││││     │││
│││ │││ │││┌┬───┬┐│4│││ │││││ │││└┴─┴─┘│  │└──┴──┴┘││     │││
│││ │││ │││││3 3│││ │││ │││││ ││└──────┴──┴────────┘│     │││
│││ │││ │││└┴───┴┘│ │││ │││││ │└────────────────────┴─────┴┘│
│││ │││ ││└───────┴─┴┘│ │││││ │                             │
│││ │││ │└────────────┴─┴┘│││ │                             │
│││ │└┴─┴─────────────────┘││ │                             │
│└┴─┴──────────────────────┘│ │                             │
└───────────────────────────┴─┴─────────────────────────────┘

The above formulation is not new; see for example Figure 3.7 of the classic The Design and Analysis of Computer Algorithms.[24] However, unlike the pidgin ALGOL program in Figure 3.7, Q is executable, and the partial order used in the sorting is an operand, the (×-) the examples above.[6]

Articles and presentations

Template:Div col

  • 1985 Operators & Nested Arrays[25]
  • 1989 ⎕sm: A Full-Screen Manager for Dyalog APL[26]
  • 1990 Workshop on Defined Operators[27]
  • 1990 A New Development Environment in Dyalog APL[28]
  • 1994 Meeting: Dyalog APL Namespaces[29]
  • 1996 Direct Functions in Dyalog APL[14]
  • 1998 APL98 Workshop – Threads in Dyalog APL[30]
  • 1998 Threads: An Introduction to Multithreading[31]
  • 2001 D: A Functional Subset of Dyalog APL[32]
  • 2001 Letter: Localising the Effects of System Functions in D[33]
  • 2003 dfns@dyalog.com[34]
  • 2003 Hungarian Method Cost Assignment[35]
  • 2004 A Note on Graphs[36]
  • 2005 How to Write Computer Programs[37]
  • 2006 Language Extensions[38]
  • 2006 Functions as Results[39]
  • 2007 Version 11.1 Performance Enhancements[40]
  • 2007 An Investigation into Higher Level Operators[41]
  • 2008 Interpreter Performance[42]
  • 2008 Journaled Files (video)[43] (text)[44]
  • 2008: A Plea for Simplicity (video)[45]
  • 2009 Conway's Game of Life in APL (video)[46]
  • 2009 Introduction to D-functions (video1)[47] (video2)[48]
  • 2009 Session Whizbangs[49]
  • 2009: Complex Numbers (video)[50]
  • 2010 Workshop—Introduction to D-functions (video1)[51] (video2)[52]
  • 2011 Conference Edition Workshop[53]
  • 2011 Introducing the Dyalog '11 Conference Edition[54]
  • 2011 APL# (video)[55] (text)[56]
  • 2011 Function Trains for Dyalog APL[57]
  • 2011: What is Functional Programming? (video)[58]
  • 2011 Closures[59]
  • 2012 Potential Version 14.0 Language Features (video)[60] (text)[61]
  • 2012: State-Free Programming (video)[62]
  • 2012 A Sudoku Solver in APL (video)[63]
  • 2013 Train Spotting in Version 14.0 (video)[64] (text)[65]
  • 2013: Social Skills for Programmers (video)[66]
  • 2014 Depth-First Search in APL (video)[2]
  • 2014: Distractions (video)[67]
  • 2015 Dya(b)log (video)[68] (text)[69]
  • 2015 Future Operator Proposals: Cut, Under, and Merge (video)[70] (text)[71]
  • 2016 New Primitive Functions and Operators (video)[72] (text)[73] (script)[74]
  • 2016 Dyalog Implementation—The Early Years (video)[75]
  • 2017 A Case Study—Recoding from Procedural to Denotative Style (video)[76] (text)[77]
  • 2018 Dfns—Past, Present and Future (video)[16] (text)[17]

Template:Div col end

Wit

Scholes is well-known among colleagues for his wit, sense of humor, and comic timing. His "after dinner" presentations at Dyalog conferences were highly-anticipated events. A selection of them from the list above:

  • Dyalog '08: A Plea for Simplicity (video)[45]
  • Dyalog '09: Complex Numbers (video)[50]
  • Dyalog '11: What is Functional Programming? (video)[58]
  • Dyalog '12: State-Free Programming (video)[62]
  • Dyalog '12: Calling Alan Turing (extract of previous item)[78]
  • Dyalog '13: Social Skills for Programmers (video)[66]
  • Dyalog '14: Distractions (video)[67]

Other examples can be found in Scholisms.[79]

References

Template:Reflist

External links

Template:APL programming language Template:Authority control


APL community [edit]
Activities Conferences ∙ User groups and meetups ∙ Iverson Award ∙ Exercises
Chat rooms and forums APL Farm ∙ APL Orchard ∙ APL Wiki
People Phil Abrams ∙ Brian Becker ∙ Bob Bernecky ∙ Larry Breed ∙ Charles Brenner ∙ Jim Brown ∙ Adám Brudzewsky ∙ Gitte Christensen ∙ Peter Donnelly ∙ John Earnest ∙ Adin Falkoff ∙ Garth Foster ∙ Lib Gibson ∙ Aaron Hsu ∙ Roger Hui ∙ Ken Iverson ∙ Morten Kromberg ∙ Dick Lathwell ∙ Marshall Lochbaum ∙ Eugene McDonnell ∙ Roger Moore ∙ Trenchard More ∙ Alan Perlis ∙ Raghu Ranganathan ∙ Henry Rich ∙ Al Rose ∙ John Scholes ∙ Ian Sharp ∙ Bob Smith ∙ Geoff Streeter ∙ Joey Tuttle ∙ Arthur Whitney
Other APL Trust ∙ APL Quote Quad ∙ Blogs ∙ Books ∙ Case studies ∙ Famous APL users ∙ Humour ∙ Jobs ∙ Merchandise ∙ Papers ∙ Podcasts ∙ TryAPL ∙ Try It Online ∙ Video channels
  1. ↑ 1.0 1.1 1.2 1.3 {{{last}}}, {{{first}}} (4 March 2019), [{{{url}}} A Service to Celebrate the Life of John Morley Scholes]
  2. ↑ 2.0 2.1 Scholes, John (21 June 2014), Depth-First Search in APL (video)
  3. ↑ Iverson, Kenneth E. (1974), Elementary Functions
  4. ↑ Iverson, Kenneth E. (August 1980). "Notation as a Tool of Thought". Communications of the ACM. 23 (8]
  5. ↑ Hui, Roger (May 1987). "Some Uses of { and }". APL 87 Conference Proceedings. {{{volume}}} ({{{number}}}]
  6. ↑ 6.0 6.1 6.2 6.3 6.4 {{{last}}}, {{{first}}} (June 2020), [{{{url}}} APL Since 1978]
  7. ↑ Iverson, Kenneth E. (26 April 1978), Operators and Functions, §8
  8. ↑ Template:Citation journal
  9. ↑ Cheney, Carl M. (March 1981), APL*Plus Nested Array System Reference Manual, §4.17
  10. ↑ Iverson, Kenneth E. (6 January 1983), Rationalized APL
  11. ↑ Template:Citation journal
  12. ↑ 12.0 12.1 Template:Citation journal
  13. ↑ Template:Citation journal
  14. ↑ 14.0 14.1 14.2 Template:Citation journal
  15. ↑ 15.0 15.1 Scholes, John (1998-2019), Direct Functions Workspace
  16. ↑ 16.0 16.1 16.2 Scholes, John (31 October 2018), Dfns—Past, Present and Future (video)
  17. ↑ 17.0 17.1 17.2 Scholes, John (31 October 2018), Dfns—Past, Present and Future (text)
  18. ↑ Template:Citation journal
  19. ↑ Template:Citation journal
  20. ↑ Smith, Bob (2006-2019), NARS2000
  21. ↑ Template:Citation journal
  22. ↑ Template:Cite thesis
  23. ↑ Hui, Roger (26 November 2016), A History of APL in 50 Functions
  24. ↑ {{{last}}}, {{{first}}} (1974), [{{{url}}} The Design and Analysis of Computer Algorithms]
  25. ↑ Scholes, John (July 1985), [{{{url}}} Operators & Nested Arrays]
  26. ↑ Template:Citation journal
  27. ↑ Scholes, John (April 1990), [{{{url}}} Workshop on Defined Operators]
  28. ↑ Scholes, John (April 1990), [{{{url}}} A New Development Environment in Dyalog APL]
  29. ↑ Scholes, John (July 1994), Meeting: Dyalog APL Namespaces
  30. ↑ Scholes, John (October 1998), [{{{url}}} APL98 Workshop – Threads in Dyalog APL]
  31. ↑ Scholes, John (October 1998), [{{{url}}} Threads: An Introduction to Multithreading]
  32. ↑ Scholes, John (April 2001), D: A Functional Subset of Dyalog APL
  33. ↑ Scholes, John (July 2001), [{{{url}}} Localising the Effects of System Functions in D]
  34. ↑ Scholes, John (July 2003), [{{{url}}} dfns@dyalog.com]
  35. ↑ Scholes, John (July 2003), Hungarian Method Cost Assignment
  36. ↑ Scholes, John (April 2004), [{{{url}}} A Note on Graphs]
  37. ↑ Scholes, John (May 2005), How to Write Computer Programs
  38. ↑ Scholes, John (17 October 2006), [{{{url}}} Language Extensions]
  39. ↑ Scholes, John (17 October 2006), Functions as Results
  40. ↑ {{{last}}}, {{{first}}} (1 October 2007), [{{{url}}} Version 11.1 Performance Enhancements]
  41. ↑ Scholes, John (1 October 2007), [{{{url}}} An Investigation into Higher Level Operators]
  42. ↑ {{{last}}}, {{{first}}} (13 October 2008), [{{{url}}} Interpreter Performance]
  43. ↑ {{{last}}}, {{{first}}} (13 October 2008), Journaled Files (video)
  44. ↑ {{{last}}}, {{{first}}} (13 October 2008), Journaled Files (text)
  45. ↑ 45.0 45.1 Scholes, John (13 October 2018), A Plea for Simplicity
  46. ↑ Scholes, John (26 January 2009), Conway's Game of Life in APL (video)
  47. ↑ Scholes, John (13 September 2009), Introduction to D-functions (video1)
  48. ↑ Scholes, John (13 September 2009), Introduction to D-functions (video2)
  49. ↑ Scholes, John (13 September 2009), [{{{url}}} Session Whizbangs]
  50. ↑ 50.0 50.1 Scholes, John (14 September 2009), Complex Numbers
  51. ↑ Scholes, John (14 September 2010), Workshop—Introduction to D-functions (video1)
  52. ↑ Scholes, John (14 September 2010), Workshop—Introduction to D-functions (video2)
  53. ↑ {{{last}}}, {{{first}}} (2 October 2011), [{{{url}}} Conference Edition Workshop]
  54. ↑ {{{last}}}, {{{first}}} (3 October 2011), [{{{url}}} Introducing the Dyalog '11 Conference Edition]
  55. ↑ {{{last}}}, {{{first}}} (3 October 2011), APL# (video)
  56. ↑ {{{last}}}, {{{first}}} (3 October 2011), APL# (text)
  57. ↑ Scholes, John (3 October 2011), [{{{url}}} Function Trains for Dyalog APL]
  58. ↑ 58.0 58.1 {{{last}}}, {{{first}}} (3 October 2011), What is Functional Programming?
  59. ↑ Scholes, John (5 October 2011), [{{{url}}} Closures]
  60. ↑ {{{last}}}, {{{first}}} (15 October 2012), Potential Version 14.0 Language Features (video)
  61. ↑ {{{last}}}, {{{first}}} (15 October 2012), Potential Version 14.0 Language Features (text)
  62. ↑ 62.0 62.1 Scholes, John (15 October 2012), State-Free Programming
  63. ↑ Scholes, John (27 October 2012), A Sudoku Solver in APL (video)
  64. ↑ Scholes, John (22 October 2013), Train Spotting in Version 14.0
  65. ↑ Scholes, John (22 October 2013), Train Spotting in Version 14.0
  66. ↑ 66.0 66.1 Scholes, John (22 October 2013), Social Skills for Programmers
  67. ↑ 67.0 67.1 Scholes, John (22 September 2014), Distractions
  68. ↑ {{{last}}}, {{{first}}} (7 September 2015), Dya(b)log (video)
  69. ↑ {{{last}}}, {{{first}}} (7 September 2015), Dya(b)log (text)
  70. ↑ {{{last}}}, {{{first}}} (10 September 2015), Future Operator Proposals: Cut, Under, and Merge (video) (text)
  71. ↑ {{{last}}}, {{{first}}} (10 September 2015), Future Operator Proposals: Cut, Under, and Merge (text) (text)
  72. ↑ {{{last}}}, {{{first}}} (10 October 2016), New Primitive Functions and Operators (video)
  73. ↑ {{{last}}}, {{{first}}} (10 October 2016), New Primitive Functions and Operators (text)
  74. ↑ {{{last}}}, {{{first}}} (10 October 2016), New Primitive Functions and Operators (script)
  75. ↑ {{{last}}}, {{{first}}} (12 October 2016), Dyalog Implementation—The Early Years (video)
  76. ↑ Scholes, John (11 September 2017), A Case Study—Recoding from Procedural to Denotative Style
  77. ↑ Scholes, John (11 September 2017), A Case Study—Recoding from Procedural to Denotative Style
  78. ↑ Scholes, John (15 October 2012), Calling Alan Turing
  79. ↑ Scholes, John ({{{date}}}), Scholisms
Retrieved from ‘https://aplwiki.com/index.php?title=John_Scholes&oldid=1364’