Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!wuarchive!rex!spool.mu.edu!munnari.oz.au!yoyo.aarnet.edu.au!sirius.ucs.adelaide.edu.au!levels!xtbjh From: xtbjh@levels.sait.edu.au (behoffski) Newsgroups: comp.software-eng Subject: Re: AvAaA: Try APL descendant "J" Message-ID: <16348.2833a96e@levels.sait.edu.au> Date: 17 May 91 00:29:10 GMT References: <16281.281f708f@levels.sait.edu.au> <16309.282b0e06@levels.sait.edu.au> Organization: University of South Australia Lines: 29 In article , wdr@wang.com (William Ricker) writes: > > The J dictionary describes nouns (arrays), verbs (functions), adverbs > (monadic operators), and conjunctions (dyadic operators). The new > terminology is readily understandable by a wider audience, and has also > been helpful in suggesting concepts from natural languages which are > fruitful for investigation. > [...] Thanks for this discussion. I'll download the PC version and see if my ideas can be mapped onto J. How close does J get to adjectives, e.g. "all positive elements of array" or "all diagonal elements"? How would you go about implementing a binary tree, and how would you then operate on the "leaf nodes"? How many primitives do you need to specify to implement "leaf nodes"? How easy is it to change the implementation of an operation without changing the original program specification? > ----------------------------------------------------------------- > Roger Hui > Iverson Software Inc., 33 Major Street, Toronto, Ontario M5S 2K9 > (416) 925 6096 > -- Brenton Hoff (behoffski) | Senior Software Engineer | My opinions are mine xtbjh@Levels.UniSA.edu.au | AWA Transponder | (and they're weird).