2,954
edits
(Dyalog user meetings) |
(→APL conferences: 2010 talk) |
||
(7 intermediate revisions by 2 users not shown) | |||
Line 1: | Line 1: | ||
Robert (Bob) Bernecky is | '''Robert (Bob) Bernecky''' is an APL designer and implementer notable for significant contributions to [[SHARP APL]] and developing an APL compiler, [[APEX]]. | ||
Bernecky | Bernecky first began working with APL at [[I.P. Sharp Associates]] in 1971. His first APL-related publication, in 1973, described performance improvements to SHARP's [[Index-Of]] and [[Membership]] implementations. In addition to his implementation work, Bernecky contributed to the design of [[comparison tolerance]], [[Replicate]] (extending [[Compress]]), and the [[Rank operator]] in [[SHARP APL]]. He remained at IPSA for three years after it was acquired by Reuters in 1987, leaving in 1990 to found his current company Snake Island Research and work on the [[APEX]] APL compiler. While at Snake Island Research he enrolled in graduate studies at the [[wikipedia:University of Toronto|University of Toronto]]; he obtained a Master of Science degree in 1997 with a thesis titled "APEX: The APL Parallel Executor". | ||
== Publications == | |||
=== SHARP APL Technical Notes === | |||
* SATN-22: APL Worspace Transfer (with Mike Symes). 1979-01-01. | |||
* SATN-23: [https://www.jsoftware.com/papers/satn23.htm Comparison Tolerance]. 1977-06-10. | |||
* SATN-34: [[Replicate|Replication]]. 1980-08-15. | |||
* SATN-45: [https://www.jsoftware.com/papers/satn45.htm Language Extensions of May 1983] (with [[Ken Iverson]], [[Eugene McDonnell]], Robert Metzger, and J. Henri Schueler). 1983-05-02. | |||
== | === APL conferences === | ||
<div style="column-width:30em"> | |||
* [[APL73]]: Speeding up Dyadic Iota and Dyadic Epsilon. | |||
* [[APL80]]: Operators and Enclosed Arrays ([https://www.jsoftware.com/papers/opea.htm web]). With [[Ken Iverson]]. | |||
* [[APL81]]: [https://doi.org/10.1145/800142.805333 Representations for enclosed arrays]. | |||
* [[APL84]]: [https://doi.org/10.1145/800058.801075 Function arrays]. | |||
* [[APL85]]: [https://doi.org/10.1145/17701.255358 Writing interpreters (panel)]. With Geno Coschi, James Ryan, [[Bob Smith]], [[Philip Van Cleave|Philip A. Van Cleave]], and James Wheeler. | |||
* [[APL86]]: [https://doi.org/10.1145/22415.22039 APL: A prototyping language]. | |||
* [[APL87]]: [https://doi.org/10.1145/28315.28339 Component file systems and the APL standard]. With Maxine Hersch. | |||
* [[APL88]]: [https://doi.org/10.1145/55626.55632 An introduction to function rank]. | |||
* [[APL89]]: [https://doi.org/10.1145/328877.328879 Profiling, performance, and perfection (tutorial session)]. | |||
* [[APL90]]: [https://doi.org/10.1145/97808.97821 ACORN: APL to C on real numbers]. With [[Charles Brenner]], Stephen B. Jaffe, and George P. Moeckel. | |||
* [[APL91]]: [https://doi.org/10.1145/114054.114059 Gerunds and representations]. With [[Roger Hui|Roger K. W. Hui]]. | |||
* [[APL92]]: [https://doi.org/10.1145/144045.144069 Compiler tools in APL]. With Gert Osterburg. | |||
* [[APL93]]: [https://doi.org/10.1145/166197.166200 Array morphology]. | |||
* [[APL93]]: [https://doi.org/10.1145/166197.166201 The role of APL and J in high-performance computation]. | |||
* [[APL95]]: [https://doi.org/10.1145/206913.206949 The role of dynamic programming & control structures in performance]. | |||
* [[APL98]]: [https://doi.org/10.1145/327559.327603 EGREGION: a branch coverage tool for APL]. | |||
* [[APL98]]: [https://doi.org/10.1145/327559.327614 Reducing computational complexity with array predicates]. | |||
* [[APL03]]: [https://doi.org/10.1145/882067.882071 An SPMD/SIMD parallel tokenizer for APL]. | |||
* [[APL03]]: [https://doi.org/10.1145/882067.882072 Bitslice: representation without taxation]. With Peter Wooster. | |||
* [[APL2010]]: Mask and Mesh Revisited. | |||
</div> | |||
=== Dyalog user meetings === | === Dyalog user meetings === |