![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
APL 1993: Toronto, Ontario, Canada
- Elena M. Anzalone:
Proceedings of the International Conference on APL 1993, Toronto, Ontario, Canada, August 15-19, 1993. ACM 1993, ISBN 0-89791-612-3 - Jake Ansell, Mulhim Al-Doori:
ARDA: Expert System for Reliability Data Analysis. 1-5 - Robert Bernecky:
Array Morphology. 6-16 - Robert Bernecky:
The Role of APL and J in High-Performance Computation. 17-32 - Hanspeter Bieri, Felix Grimm:
Approaching Classical Algorithms in APL2. 33-40 - James A. Brown, Brent Hawks, Ray Trimble:
Extending the APL Character Set. 41-46 - Tien Chi Chen:
SCARFS, an Efficient Polynomial Zero-Finder System. 47-54 - Wai-Mee Ching, Alexander Katz:
The Testing of an APL Compiler. 55-62 - Pierre Deslauriers:
APL Helps the Deaf to Hear Again. 63-68 - David S. Eastwood:
Structuring Functions with Operators. 69-77 - Murray Eisenberg, Howard A. Peelle:
Confessions of two APL Educators Learning J. 78-87 - Richard R. N. Eller:
A Modern APL Windows User Interface with DOS Downwards Compatibility: the Solution for two Years Onwards. 88-96 - Jochen Frey, Dinu Scheppelmann, Gerald-P. Glombitza, Hans-Peter Meinzer:
A Parallel Topological Feature Map in APL. 97-103 - Steven J. Halasz, Andrei V. Kondrashev:
Talking with an APL via DDE: Teaching an Old Dog New Tricks. 104-111 - Dennis Holmes, John E. Howland:
APROL: a Hybrid Language. 112-123 - Thomas Kolarik:
Extending the Two-Partner Shared Variable Protocol to n Partners. 124-133 - Gérard A. Langlet:
Building the APL atlas of natural shapes. 134-147 - Pavel Luksha:
Modern Algebra Self-Taught Through APL. 148-153 - Stephen M. Mansour:
Using Defined Operators and Function Arrays to Solve Non-Linear Equations in APL2. 154-158 - Duncan McArthur:
An Introduction to log-linear Analysis and Implementing the Newton-Raphson Algorithm in APL2. 159-163 - Johann Mitlöhner:
Distributed Computing in the Workstation Environment. 164-169 - Trenchard More Jr.:
Transfinite Nesting in Array-Theoretic Figures, Changes, Rigs, and Arms, Part I. 170-184 - Peter Naeve, Bernhard Strohmeier, Hans Peter Wolf:
APL Programming without Tears: It is Time for a Change. 185-189 - Frank C. Ripley:
Efficient Maximum Likelihood Estimation of Linear Models with APL. 190-199 - Jack G. Rudd:
Roles of APL in Satellite Surveillance. 200-208 - David Selby:
Extending APL2 to Include Program Control Structures. 209-213 - Ralph G. Selfridge:
Solving Two or Three Polynomials in Two or Three Variables. 214-218 - Alexander O. Skomorokhov:
Adaptive Learning Networks in APL2. 219-229 - Alexei N. Skurikhin, Alvin J. Surkan:
Identification of Parallelism in Neural Networks by Simulation with Language J.. 230-237 - Keith W. Smillie:
Rolling Dice: Some Notes on J and Teaching Probability. 238-243 - Adrian Smith:
Co-operative Programming with Windows DDE. 244-250 - David G. Smith, Joey K. Tuttle:
JVOX. 251-258 - Walter G. Spunde:
Point-Wise Calculus. 259-266 - David H. Steinbrook, Eugene E. McDonnell:
From Trees into Boxes. 267-276 - Thomas W. Stroud, Alan M. Sykes, Alan D. Mayer:
Bayesian Methods in APL. 277-285 - Rexford H. Swain, Daniel F. Jonusz:
The Workspace Manager: A Change Control System for APL. 286-294 - Norman D. Thomson:
Understanding ANOVA the APL way. 295-303 - Robert G. Willhoft:
Structured APL: A Proposal for Block Structured Control Flow in APL. 304-315 - Richard M. Levine:
Recent Work on the Toronto Toolkit. 316
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.