hn-classics/_stories/2007/11698414.md

72 KiB
Raw Permalink Blame History

created_at title url author points story_text comment_text num_comments story_id story_title story_url parent_id created_at_i _tags objectID year
2016-05-14T22:49:26.000Z Whoever does not understand Lisp is doomed to reinvent it (2007) http://lambda-the-ultimate.org/node/2352 rlander 175 229 1463266166
story
author_rlander
story_11698414
11698414 2007

Source

Whoever does not understand LISP, is doomed to reinvent it. | Lambda the Ultimate

[Lambda the Ultimate][1]

![The Programming Languages Weblog][2]

   

| ----- | |

**

![][3]

[Home][4]

[Feedback][5]

[FAQ][6]

[Getting Started][7]

[Discussions][8]

[Site operation discussions][9]

[Recent Posts][10]

[(new topic)][11]

[Departments][12]

[Courses][13]

[Research Papers][14]

[Design Docs][15]

[Quotations][16]

[Genealogical Diagrams][17]

[Archives][18]

**


User login

Username:

Password:

  • [Create new account][19]
  • [Request new password][20]

Navigation

  • [recent posts][10]

|

[Home][1] » [forums][21] » [LtU Forum][8]

Whoever does not understand LISP, is doomed to reinvent it.

I am doing C# 2.0. Recently I'v struggled hardly with ORM ideas. Before that I was struggling with a add-in architecture. In last 2 years I'v tried to extend my views by digging into Ruby, Haskell, Erlang, ... and even JavaScript more deeply! In many many situations after a hard battle I came across with a "set of elements" idea. Imagine you'v had trapped in a dessert; you will only concentrate what is essential! I felt that and always some lights came to me! Not in form of an angle! In form of a list! Please tell me what's wrong here! I can even think more than this! Were we walking backward in last 20 years to reach lisp??!!

By [kaveh.shahbazian][22] at 2007-07-14 07:34 | [LtU Forum][23] | [previous forum topic][24] | [next forum topic][25] | [other blogs][26] | 67520 reads

Comment viewing options

Flat list - collapsed Flat list - expanded Threaded list - collapsed Threaded list - expanded Date - newest first Date - oldest first 10 comments per page 30 comments per page 50 comments per page 70 comments per page 90 comments per page 150 comments per page 200 comments per page

Select your preferred way to display the comments and click "Save settings" to activate your changes.

[Whoever does not understand LISP, is doomed to reinvent it!][27]

I must clear this sentence [Whoever does not understand LISP, is doomed to reinvent it!] is not mine! I'v just read it somewhere in a blog comments and it blows up my mind by reminding me of my current programming problems to solve. :)

By [kaveh.shahbazian][22] at Sat, 2007-07-14 15:46 | [login][28] or [register][29] to post comments

[Less Than Meets the Eye][30]

Because Lisp is relatively close to the untyped lambda calculus, the observation is almost a truism. The interesting question is whether the untyped lambda calculus is the most appropriate starting point for a programming language design today, and if not, how much the resulting language still resembles Lisp. if, as I tend to feel, "all languages eventually tend towards being Lisps" means little more than "all languages eventually tend towards having first-class functions," then I agree. If it means "all languages eventually tend towards being dynamically typed," then I disagree. If it means "all languages eventually tend towards having s-expression-based syntax," I laugh hysterically.

By [Paul Snively][31] at Sat, 2007-07-14 16:06 | [login][28] or [register][29] to post comments

[More than you think][32]

EVAL
Closures (Eiffel calles them Agents, C# has them, Java says Inner Classes)
Symbols (Ruby has it some how)
Macros
Late Binding
Garbage Collection
Runtime Dynamic Features (see Erlang)
Blend of imperative, functional and object-oriented features
Interactive Programming (REPL)
Runtime safety

Well, we might not have the prefix notation for programs, but we got lots of prefix notation for data and configurations. Called XML these days. It plays the same role. Where you had files with (person :name "foo" :age 40) you now have .... But it is not all data, it is also configuration. Where you had (define-window foo-window :title "foo" ...) you know have the configuration in XML as .... Same purpose.

By [Rainer Joswig][33] at Sat, 2007-07-14 21:38 | [login][28] or [register][29] to post comments

[Isomorphism != Identity][34]

OK, let's take this blow-by-blow, using [MetaOCaml][35] as our point of comparison:

  • EVAL: I'll claim that brackets, escape, and run serve this purpose nicely.
  • Closures: Check.
  • Symbols: No.
  • Macros: Check, via camlp4.
  • Late Binding: No.
  • Garbage collection: Check.
  • Runtime Dynamic Features: No.
  • Blend of imperative, functional and object-oriented features: Check, better than CL's
  • Interactive Programming (REPL): Check.
  • Runtime safety: Check.

And yes, we all understand that XML is often used to implement a non-Turing-complete language for configuration purposes, which s-expressions are also good for. But are you honestly going to tell me that MetaOCaml is a Lisp? Or are you going to tell me that you can't be a Lisp without symbols, late binding (which really needs defining), or dynamic runtime features? Then I think Smalltalk-80 would be a Lisp. It's interesting to note that, while searching around for good information on Ruby symbols, I came across a claim that Ruby is a Lisp-2, so the idea might not be as far-fetched as I think it is. But from my point of view, you're making my point for me: it isn't that other languages are becoming Lisps; it's that what it means to be a Lisp is becoming so watered-down as to be meaningless.

By [Paul Snively][31] at Sun, 2007-07-15 16:27 | [login][28] or [register][29] to post comments

[yet they try to replicate features][36]

MetaOCaml got backquote and comma? Wow. ;-)

MetaOCaml is sure no Lisp.

Lisp without symbols? No way. No late binding? No dynamic features? No, not really.

Smalltalk 80 is no Lisp in a narrow sense, but it comes very close. But that is not surprising, since Kay and others learned from Lisp and Lisp developers also learned from Smalltalk. InterLisp-D and Smalltalk 80 were developed at the same time next to each other. If there is one system that is like Smalltalk 80, it is InterLisp-D.

I don't think the essence of Lisp is that fuzzy that it is meaningless. Some feature set has been found almost 50 years ago. Some facilities have been added over the years. If you look at trends, I think it is observable that some new languages have a large amount of similar features which Lisp had for most of the last 50 years. There are also crucial Lisp features like symbolic expressions, runtime safety (without that interactive programming is no fun), program generation, reflection, introspection, garbage collection, interactive development that have been (partly) added to language families that have a distinct non-Lisp look and feel.

I don't think that other languages will morph over time into Lisp, but there are sure more features to be added to some of those languages - features that are thought as common in Lisp. Also there is some trend to more usage of dynamic languages.

By [Rainer Joswig][33] at Mon, 2007-07-16 00:43 | [login][28] or [register][29] to post comments

[runtime safety (without that][37]

runtime safety (without that interactive programming is no fun)

The Forth people will beg to differ.

By [Derek Elkins][38] at Mon, 2007-07-16 00:57 | [login][28] or [register][29] to post comments

[typeless interactive programming][39]

Good one. No rule without exception. ;-)

By [Rainer Joswig][33] at Mon, 2007-07-16 10:27 | [login][28] or [register][29] to post comments

[Tongue, Meet Cheek][40]

Of course, I didn't think you meant that MetaOCaml is a Lisp. Rather, my point is precisely that Lisp's influence is, indeed, felt far and wide without its successors necessarily themselves being Lisps, and that this isn't sufficient to rise to the level of failing to understand Lisp and, hence, reinvent it. On the contrary, I would say that many modern languages, including Ruby, OCaml, MetaOCaml, Haskell, Scala... understand Lisp extremely well and go beyond it in important ways. Consequently, I'm afraid that I'm having difficulty thinking of anything that, for example, any of the aforementioned languages would benefit from adding from, say, Common Lisp that they haven't already, albeit in the modified forms that makes those languages not-Lisps.

By [Paul Snively][31] at Mon, 2007-07-16 01:26 | [login][28] or [register][29] to post comments

[What to add from Common Lisp][41]

Macros?

By [James Riordan][42] at Wed, 2007-07-18 08:59 | [login][28] or [register][29] to post comments

[Macros?][43]

Has been investigated in the context of OCaml. Haskell might not need it that much.

By [Rainer Joswig][33] at Wed, 2007-07-18 10:51 | [login][28] or [register][29] to post comments

[Disconnect][44]

This is indeed what people most often say should be borrowed from Lisp, and it's a major reason that I maintain that the Lisp community is out of touch with the rest of the world. At the very least, OCaml has macros as the Lisp world understands the term: in compiling, the parsing phase is distinct from the other phases, and there is a tool, camlp4, with which you can modify, extend, or entirely replace OCaml's AST. OCaml even ships with two official syntaxes out of the box, camlp4o, "original" and camlp4r, "revised" syntax. There are some very useful syntax extensions out there, such as pa_monad, which adds monadic do-notation to OCaml. Graydon Hoare's excellent "One-Day Compilers" relies heavily on camlp4: his compiler basically transforms the AST of his language to the AST of an OCaml program that spits out the equivalent C, compiles the OCaml program, runs it, and compiles the resulting C program. Very slick.

So this is one of a few respects in which the appropriate response to Lispers saying "You should try X" is "We did. Good job, and thanks."

By [Paul Snively][31] at Wed, 2007-07-18 13:43 | [login][28] or [register][29] to post comments

[out of touch again][45]

I doubt that a Lisp user will care whether OCaml has macros or not. I strong suspect that the pre-parser for OCaml has been developed NOT by Lisp users. So, I really don't understand your remark.

By [Rainer Joswig][33] at Wed, 2007-07-18 15:36 | [login][28] or [register][29] to post comments

[Lisp users are out of touch][46]

Lisp users are out of touch in that they belive that macros are a thing thats exclusive to lisp. They belive that they have to use lisp to get macros, and in so doing there choice of lisp as language of choice is based on false premises.

By [Felicia Li Svilling][47] at Wed, 2007-07-18 16:15 | [login][28] or [register][29] to post comments

[I don't think this is true.][48]

I don't think this is true. But it is important to note that Lispers deny the value of other macro systems. And macro systems are indeed not rated very high in other languages ( they are more nice-to-have than being an essential feature ). The justification for s-expr syntax depends on the believe that any language with non-homogenous syntax makes code transformations either hard or do it in a broken C-like fashion using textual substitutions. One has to provide more arguments than just stating that language X has a macro system / AST based preprocessor. Lisp macros are straightforward in Lisp. It is not surprising that they are present and they are not only used for a few language oriented tools like refactoring browsers or DSL implementations. But then one cannot really learn anything from Lisp macros in order to transfer them across languages but just use Lisp or its derivatives instead i.e. adopt Lisp for programming in a Lispy fashion. A similar situation exists with Haskell and monads. Some language features resist to get transfered ( or they are getting transfered as toys or for demonstration purposes ), not because it would be technically impossible or even particularly difficult but it's just hard for other language communities to see the point.

By [Kay Schluehr][49] at Wed, 2007-07-18 20:49 | [login][28] or [register][29] to post comments

[Yes, I didn't mean to say][50]

Yes, I didn't mean to say that all lispers are out of touch or something like that. But more like explain how it is out of touch for a lisper to not know about campl4, just you are out of touch to belive that repl is a feature unique to lisp. And I have myself made these mistakes, comming from a C, pascal and basic background, I found Common Lisp and it was an amazing life changing experience, but the lisp community let me to belive that it was just lisp, that lisp was the only language that let me do these wonderfull things. That all other languages was way behind. And that is most definitly out of touch.

Having said that, I feel that the lisp macro systems are way more user friendly than campl4 or any other non-lisp macro system I have seen. But still I think reficating ASTs as lists and symbols is not the ultimate way to do macros eighter.

By [Felicia Li Svilling][47] at Wed, 2007-07-18 21:25 | [login][28] or [register][29] to post comments

[out of touch again][51]

You are making the same mistake like Paul Snively if you think Lisp users are out of touch. Especially the gross simplification about 'the Lisp community'. If you spoke to a few of them, I can tell you that there is a huge chance that you missed a lot of views. The 'Lisp community' for example consists of:

  • implementors of Common Lisp, Scheme, ...
  • implementors of commercial systems (Allegro CL, LispWorks, Chez Scheme, Corman Lisp, ...)
  • implementors of free Lisp systems (GPL and PD)
  • lovers of 'free software'
  • programmers in companies who develop tools and applications
  • users of embedded Lisps (AutoLisp, Emacs Lisp, Nyquist, ...)
  • hobbyists
  • lunatics
  • people working on standards (like R6RS)
  • scripting fans
  • academics
  • people working for government agencies
  • ex-Lisp users
  • Lisp-1 fans vs. Lisp-n fans
  • people who never post to c.l.l

anybody saying 'the Lisp community' is this or that makes a statement about thousands of very diverse people and several groups without knowing them or having asked them.

Many Lisp users are well aware about macros and other facilities in other programming languages. The Lisp community has a long tradition of research into that topic (macros) and there is/was a lot of discussion of the problems and various approaches. Some Lisp people have earned money helping the development of other languages (for example the macro system in Dylan).

Same for the REPL. Ever used Smalltalk? Prolog? APL? Anybody with some clue knows that REPLs are widely used. Though I would say that the most advanced one was the listener on the Symbolics Lisp Machine. ;-) But even in SLIME/Emacs it is getting better. Did you see that you can click on the returned data in the SLIME listener and that it is mouse sensitive? SLIME has simple presentations in Emacs. People are working on similar facilities in McCLIM where you can mix textual and graphical output in the REPL with mouse-sensitive objects. [Example][52]. REPLs which present you forms for commands, can complete over various data types for input, provide context-sensitive help, have clickable menus for error handling and so on. If you think that a simple emacs mode for an impoverished interaction loop is the same thing, then I have to ask who is out of touch with what??? Some people like to develop in vi and a simple terminal. That's fine. But please don't tell me it is the same as a Smalltalk IDE or the IDE of LispWorks. Press help in a Lisp Machine listener, and you see that there are hundred or more commands. Go in a break loop and press help again, there are a multitude of things you can do there. For example you can show the contents of a stack frame (a function call), edit the data in-place in the REPL, redefine the function and and reinvoke it.

ASTs as lists is definitely not the ultimate way to do macros. Though in CL there is a bit more to it. But generally everybody knows that it is only a pragmatic choice. Scheme has other macro systems.

If you believe what some people tell you how advanced the language is, that's nonsense. What is advanced about CAR, CDR and CONS? But something else is quite advanced. The implementations of a language that has a lot of design choices and trade-offs. Implementations like LispWorks or Allegro CL are the result of work of twenty years. These implementations also have lots of improvements over what is in the language standard (Unicode, Environments, Hierarchical Packages, Threads, Networking, Portable GUI toolkits, one-click application delivery, generation of shared libraries, graphical IDEs, Interface Builder, Rule Systems, embedded Prolog, FFIs, OS interfaces, extensible streams, Meta-Object protocol, shell-access, style checkers, cross referencing, source locator, saving of images, ...) Lots of people demanded these improvements and paid for them. These implementations had a lot of progress in the last years.

But that there is progress even in the Lisp world, doesn't mean there aren't others. Microsoft, Borland, IBM (Eclipse), Cincom (VisualWorks), SUN, BEA, Apple, Jetbrains (IntelliJ)... all are working on development tools.

Please stop telling 'the Lisp community' is this or that... What ever you say, some subgroup will protest (like I did here). ;-)

By [Rainer Joswig][33] at Wed, 2007-07-18 23:59 | [login][28] or [register][29] to post comments

[Smells like Russell's Paradox][53]

I don't think you can define the Lisp Community as including ex-Lisp users.

By [Jim Eberle][54] at Sun, 2007-07-22 19:46 | [login][28] or [register][29] to post comments

[Morphing to the end of the power hierarchy][55]

I don't think that other languages will morph over time into Lisp, but there are sure more features to be added to some of those languages - features that are thought as common in Lisp.

When a language, despite not supporting s-expr style syntax, implements an AST based macro system ( MetaLua, Converge, ... ), Lisp lawyers will sue the language designer for violating the intellectual property of the Lisp community. As a consequence the accused and convicted programmer has to undergo a therapy where the beauty, poetry, art, historical relevance, superiority and what not of Lisp is explained to him. He has to publically admit that he was at least "inspired" by Lisp ( well, it doesn't cost much ) and respects the prior art of any modern language contruct by the Lisp community. There is no escape from Lisp since Lisp owns all your ideas in advance. Everything converges to Lisp in the end which is the ready-made of the end of the power hierarchy ( only quantum computing may change this but then we come up with quantum-Lisp ). The only possibility to esacpe the depressive fact of lack of originality is to convert to the one true programming language.

A serious nutcase who continues to dismiss the merrits of homogenous syntax after all is advised a second therapy where the evolutionary model of the Lisp community is explained to him: with macros you are, as a language designer on the same level as an application programmer. When we don't like your language=application design, we shoot your ideas down. That's how the whole computing science progresses and so it will ever be.

By [Kay Schluehr][49] at Mon, 2007-07-16 06:01 | [login][28] or [register][29] to post comments

[Beautiful][56]

;-)

By [Rainer Joswig][33] at Mon, 2007-07-16 10:01 | [login][28] or [register][29] to post comments

[Fun stuff][57]

I'm not sure if this is a very popular way of talking about programming languages, but I'm pretty sympathetic to it, personally. This reminded me of [something I wrote][58] on the ll1 list some years ago:

If, on the other hand, the assertion is that any such basis must be Lisp, I disagree. In fact, a stronger statement is often made: any such basis will, de facto, be Lisp, whether the benighted OO people know it or not. This is the final major armament in the hands of position X, and it guarantees X's final unassailability (or so some believe): "Whatever you THINK you're doing, you're REALLY doing Lisp." Arguments of this form are enormously powerful and subversive, and at times they can serve to preserve power, and at times to undermine it.

By [Matt Hellige][59] at Mon, 2007-07-16 22:09 | [login][28] or [register][29] to post comments

[Smalltalk][60]

On the note of smalltalk, while I don't know it myself in pretty much every other community I've seen people always seem convinced that all languages are converging to smalltalk.

By [Magnum Opus][61] at Thu, 2007-07-19 02:52 | [login][28] or [register][29] to post comments

[Still something there][62]

I think there is still something compelling in LISP, both in the untyped lambda calculus aspect and in the uniform/heterogeneous (i.e., untyped) data structure of S-expressions (not just lists). After all, if you don't do anything that is actually wrong semantically in your programming, then there is great freedom available in the "untyped paradise". When you bite the apple and walk out into the typed world, you necessarily give up some expressiveness in return for guarantees about type safety (including even a guarantee of strong normalization in certain lambda calculi, though these are perhaps unrealistic for current programming practices).

I used to think that ever-increasingly sophisticated type systems were a poignant-but-productive (in the recursion theory sense) quest to regain the untyped paradise, and this sentiment is consonant with the "doomed reinvention" quote.

On the other hand, what we eventually see with type systems is that they become themselves a language in which we can think and program (even with lambda and data structures, etc., of their own). In this sense they give a concrete, linguistic realization to the looser patterns of thought that would have to have been lurking behind the improbable situation of "always getting it right" semantically.

Perhaps any time we give up unchained, pre-linguistic creative thought in favor of the clarity of concrete (esp. formal, rigorous) language, we will end up to some degree yearning for the former. But the clear light of morning often reveals that our perceived freedoms of thought were in need of some organization and clarification anyway: i.e., dynamic type errors will happen. (Your night-time dreams are compelling to you, but externalize them in language to a friend and they can seem quite absurd.)

Certainly in the case of data structure I think it's easy to see that a typed approach, with a suitably expressive language of types, provides a powerful medium in which to work. I find it hard to imagine that people working in pure LISP would come up with things like [ Launchbury, Krstic and Sauerwein's hyperfunctions][63] (solutions to  H a b = H b a -> a) or [ Bird and Paterson's nested datatype representation of deBruijn terms][64]. (Although I'm sure some LISPer will point to a late 1960's LISP paper which exhibits both of these and more ... :) .) Did continuations come first in a typed language of denotational semantics, or as an untyped notion? Wikipedia claims the latter ... .

Anyway, my point is that I understand Kaveh's sentiment (expressed by many others, too), and in a sense the untyped paradise is a goal to aspire to. But I also appreciate the fruits of a good, juicy type system. Maybe the real productivity (recursion theory sense again) is in the never-ending interplay between the two perspectives. (Insert yin-yang symbol and cue sappy music here. Hey, what can I say, I'm a "natural mediator" middle child :) .)

By [fruehr][65] at Sat, 2007-07-14 21:12 | [login][28] or [register][29] to post comments

[Well, yes.][66]

I'd hoped that my comment was more along the lines of "the observation is tautological" than "the observation is wrong." After all, the phenomenon of Lispers hearing of some "new" invention and pointing back to its formulation in Lisp decades before is a very real one, and there have been many times when I've been the Lisper in question.

But it is nevertheless also true that I keep hearing what, to my ears, sounds like at least the insinuation that you can't do creative, exploratory development in statically-typed languages—that this remains an ineluctable advantage of dynamically-typed languages. This is false, and to the extent that it might be part of what people are driving at when they say things like "Whoever does not understand Lisp is doomed to reinvent it," it calls the latter observation into question. But an even larger point that I was trying to make is that if you are among those who believe that Ruby or Python are "reinvented Lisps," then I submit that your definition of "Lisp" is so broad as to be nearly meaningless.

By [Paul Snively][31] at Sun, 2007-07-15 16:13 | [login][28] or [register][29] to post comments

[creative, exploratory development in statically-typed languages][67]

Can you give some examples of widely adopted practices and tools? Not a horse with stripes sold as a Zebra.

How does it compare to, say, a typical Smalltalk 80 environment?

By [Rainer Joswig][33] at Mon, 2007-07-16 00:49 | [login][28] or [register][29] to post comments

[REPLs][68]

I think the crucial point is that environments such as OCaml, Haskell, Scala, etc. took a leaf from the Lisp playbook and offer REPLs. In the case of OCaml and Tuareg Mode, I can be entering code into a source file to be compiled later, but I can evaluate it in the toploop interactively while I'm developing. When things are gelling sufficiently, I can use omake -P to automatically keep my build up-to-date every time I save the file. So I have an incremental development experience from blank page and a prompt to full standalone binary with no discontinuities. That is, using SBCL + SLIME and using OCaml + Tuareg Mode don't feel appreciably different to me, apart from the greater correctness guarantees from OCaml and, incidentally in my case, the better, and easier-to-deliver, resulting code.

By [Paul Snively][31] at Mon, 2007-07-16 01:33 | [login][28] or [register][29] to post comments

[REPLs][69]

So, would you say that OCaml + Tuareg + Emacs is the state of the art w.r.t. to interactive software development with static functional languages?

By [Rainer Joswig][33] at Mon, 2007-07-16 10:03 | [login][28] or [register][29] to post comments

[Probably Not][70]

First, I'm not even sure what "state of the art means" or why it matters. But even so, I would imagine that [Cameleon][71], [OcaIDE][72], [Visual Haskell][73], etc. would be quite a bit closer.

My only point is that I have essentially the same interactive flow in EMACS + Tuareg as I do in SLIME, which seems to be the preferred Common Lisp environment these days.

By [Paul Snively][31] at Mon, 2007-07-16 16:18 | [login][28] or [register][29] to post comments

[debugger][74]

It has a debugger in the REPL? Restarts? Break loops? Fix and continue?

By [Rainer Joswig][33] at Mon, 2007-07-16 16:55 | [login][28] or [register][29] to post comments

[[OT] Debugging OCaml][75]

OCaml has an excellent time-travel debugger for byte-compiled code that I highly recommend investigating. As much as I love to talk about OCaml, we're rather obviously OT at this point, so if you'd like, I recommend we continue via e-mail. You can reach me at psnively-at-mac-dot-com.

By [Paul Snively][31] at Mon, 2007-07-16 22:15 | [login][28] or [register][29] to post comments

[debugger and REPL][76]

so, the debugger is a separate tool and not in the REPL. you have to set up debugging by compiling to byte code and run the debugging session separately. But that is not the interactive development you get from Lisp or Smalltalk. There it does not matter much if the code is compiled or interpreted. When you develop there, the tools are all available. The facility you describe is similar what you can get from other static environments also. But it is far away from what you get, when you start Squeak, LispWorks, Allegro CL, VisualWorks or similar implementations.

Btw., is the way language tools work and their facilities off-topic here?

By [Rainer Joswig][33] at Tue, 2007-07-17 05:17 | [login][28] or [register][29] to post comments

[Trade-Offs][77]

Well, we're talking about one language and how it's used, and not informing the discussion much from the PLT point of view, except perhaps to the extent that OCaml is an existence proof that incremental, interactive development is quite possible in a modern, type-inferred, statically-typed language.

So as I've tried to make clear, I have both environments simultaneously: I have a toploop in which I can instantly, with a keystroke, evaluate an expression that I've just entered into a source file. Thanks to omake -P I can also keep a build that is literally as up-to-date as my last save of that buffer, which means that I can take advantage of ocamldebug at any time. The effect really is quite indistinguishable from that of an environment such as SLIME.

Incidentally, very few environments have time-travel debugging. Common Lisp and Smalltalk-80 certainly do not. Ironically, the only other such environments I've seen have either been even father-out (Prograph) or very forward-thinking C/C++ environments on extremely popular platforms (some versions of Borland's C/C++ tools, IIRC).

Really, at this point I don't know what else to say. Incremental, interactive development isn't a novel feature of Lisp or Smalltalk, and hasn't been for well over a decade now. The continued emphasis on it only serves to reinforce how dramatically out-of-touch the Lisp community is—and let me assure you, Rainer, as a technical reviewer for Peter Norvig's "Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp" and MacDTS' sole support engineer for Macintosh Common Lisp from 1989-1991, I take zero pleasure in the observation.

By [Paul Snively][31] at Tue, 2007-07-17 05:49 | [login][28] or [register][29] to post comments

[out of touch with type systems? could be...][78]

I'm not sure how much the Lisp community (is there one? or more? none?) is out-of-touch. I hear that sometimes. Though I have that feeling sometimes with the proponents of static functional languages (SFP), who develop ever more complicated languages with practical purpose for those complex facilities that gets ever smaller. The type systems are so complex and the machinery to work around them is even more complex. Little is done on making them useful for the application developer. MetaXYZ? Is that been used by anybody? All I get is an Emacs mode? What you describe as 'incremental, interactive programming' is certainly useful, but it is far from a developer experience you get with, say, VisualWorks or LispWorks.

It seems that Common Lisp is mostly driven by application development now and not adding even more complicated machinery is actually a good thing. Even an old implementation like GCL is being maintained, because it is used in applications for Computer Algebra (Axiom, Maxima) and Theorem Proving (ACL2).

As somebody with a Lisp background I can assure you that never in the last twenty years the applicability of that background has been greater than now. If you look around you would see lots of Ruby, Squeak, Python, Rebol, JavaScript and other stuff, where this background is directly applicable. Even though I'm personally interested in the dinosaurs (Lisp Machines), I don't feel that much out of touch.

He, even Apple adds garbage collection now and [[offset transformBezierPath:path] stroke] is an excerpt from Lisp code (a Cocoa interface for SBCL) I got from someone. ;-)

There was some time-travel debugging done in Lisp, but it never got very popular. See for example Lieberman's Zstep, developed with Macintosh Common Lisp.

By [Rainer Joswig][33] at Tue, 2007-07-17 07:15 | [login][28] or [register][29] to post comments

[That Whooshing Sound...][79]

...is the point flying by.

I'm not denying the advantage of having a Lisp background; I'm explicitly saying that having a Lisp background is a good thing, not only in the contexts that you enumerate (Ruby, Squeak, Python, Rebol, and JavaScript) but also in Standard ML, OCaml, Haskell, Scala...

It isn't the case that all you get with many statically-typed languages is an EMACS mode, although I don't quite see what would be wrong with that. It so happens that the most popular (I believe) EMACS mode for OCaml is quite good—good enough that a comparison with the most popular (I believe) EMACS mode for Common Lisp, SLIME, isn't ludicrous on its face. But even there, the only claim that I was making was that I have exactly as much interactive, incremental development "oomph" in EMACS + Tuareg Mode + OCaml as I do in EMACS + SLIME + SBCL, a claim that I haven't seen addressed here, let alone refuted.

I'm glad, too, that Common Lisp is relatively stable. But I would argue that the lack of a standard set of APIs for sockets and threads, among other things, hampers Common Lisp today. I'm also glad that Paul Graham and Peter Seibel have breathed new life into Common Lisp, but the pattern I see with Lisp investigation remains the same as it ever was: some folks are amazed by it and stay, a larger number are amazed by it and outgrow it, and far and away the largest number are repulsed by it. The Lisp community (yes, there are two, the Common Lisp community and the Scheme community; you're part of the CL one, as is my CTO, as am I) oscillates like a tiny crystal as it gains and sheds members—members who then take the concepts and ideals of Lisp with them, wherever they go.

Lisp has been around in one form or another since 1958, as you know. Scheme, arguably the cleanest, purest Lisp—the one that tends to be talked about in PLT circles—has been with us since 1975. Common Lisp was, of course, defined in 1984. Standard ML wasn't invented until 1975. The Curry-De Bruijn-Howard Isomorphism wasn't identified until 1980. Caml was first released in 1987, Caml Light in 1990, and Objective Caml in 1996. It should come as no surprise that there's more active research, and concomitantly less pragmatism (although, compared to Lisp, that's a highly debatable point) in the statically-typed functional language community. I'm ignoring Haskell here because its goals are explicitly research-oriented, although people are doing surprisingly practical things with it.

Finally, as I've done before, I'll refer to Scala and liftweb as an excellent intersection of theory and practice: a modern type-inferred statically-typed object-functional language targeting the JVM, complete with excellent Eclipse integration, and of course the requisite web application framework, which is being designed and implemented specifically in response to the shortcomings of Ruby on Rails, with which the author has a couple of years of experience under his belt. Update: There's a recent interview with Martin Odersky on Scala [here][80].

So once again, I have to say that you're making my point for me: Lisp is incredibly influential, and that's a good thing. But that doesn't mean that newer languages are reinventing Lisp, nor—more importantly—that designers and users of newer languages have failed to understand Lisp. Many of us understand Lisp quite well—could even be considered experts in it—and have chosen against it both for good technical as well as good social reasons.

By [Paul Snively][31] at Tue, 2007-07-17 14:18 | [login][28] or [register][29] to post comments

[okay, let's disagree and agree where possible ;-)][81]

I'm not that far away from what you write in your last paragraph, though I'm more optimistic when it comes to Lisp (its community, its usefulness, its differences that justify its existence) and much much more pessimistic when it comes to Statically typed FP in in general and its outlook.

  • Lisp is not 'relatively close to the untyped lambda calculus'. Which was your first point in this discussion. Which is especially true for Common Lisp, see the Pitman reference below.
  • OCAML's toplevel does not give you an interactive experience like Lisp or Smalltalk (even SBCL has the debugger built in, allows you code patching and resuming, has dynamic updates for data changes and so on). Wasn't even old MCL much more advanced?
  • Common Lisp with non-standard extensions is not worse than 10 incompatible static functional languages
  • I don't see Scheme as the 'cleaner' Lisp. I see Scheme as a cleaner programming language in general. But as a Lisp it is less a Lisp than Common Lisp or other dialects. Lisp is dirty. Ugly. Pragmatic. Full of warts. Scheme has to little of them. It even defines a syntax for the language (see R5RS). ;-)
  • most research in 'modern' type systems gives the application developer very little, the impact is not very high and the complication is enormous. I wonder when somebody will come up with a simplified FP language or if that is possible? The most interesting and innovative FP language that I have seen in the last years is Erlang. Erlang is not statically typed. Plus Erlang is driven by real applications.
  • The Lisp background does not give me much when I look at Haskell. Central ideas of Haskell (Type Classes, Monads, ...) are just not present in Lisp.
  • I don't think the 'Lisp community' is more out of touch now, compared to the past. There was always a bit 'crazyness'. It always attracted some people with unconventional thinking. That's also what I like. You can see a steady upswing in the last years. Comp.lang.lisp has more traffic than ever. Much more infrastructure is available for the community, several implementations are actively maintained, lot's of new libraries have appeared, ... and, no, it is not all because of Paul Graham (who, btw. actively hates CL ;-) ) and Peter Seibel. It is mostly because a young generation now takes over and seems to be quite active. If some of the prominent people are a bit silent the last months, I think it has to do that ITA has many of them working on their software (Airline Reservation System, ...).

If you say newer languages are not reinventing Lisp, then you are right (with some exceptions like Pico Lisp, newLISP, e7, Curl, L#, dotlisp, Arc, ...). Especially languages like Scala, Haskell, OCaml are completely different languages. Software written in those languages looks completely different, tools are different and the development process is also very different.

I think Kent Pitman's recent posting to comp.lang.lisp has nailed it down: [CL is not secretly Scheme with bad syntax][82]. ;-)

Side remark: If you read the Haskell community reports, you will find that they also struggle to be more practical. They also think about libraries, tools and applications. Plus Haskell got some traction with the Perl 6 'proof of concept' implementation.

Question: what are you doing with OCaml (if you are allowed to say that)?

By [Rainer Joswig][33] at Tue, 2007-07-17 17:25 | [login][28] or [register][29] to post comments

[My newbie experience][83]

(sounds like a good band name) but seriously folks,

I wonder when somebody will come up with a simplified FP language or if that is possible? The most interesting and innovative FP language that I have seen in the last years is Erlang.

is something I have to agree with (not that I'm anybody). I would love to get into Haskell and Scala but I'm frightened off by the patently (from the perspective of a Regular Joe, even tho I did SML in university) nutty over the top typing that goes on there. How am I really going to debug somebody else's library when they've gone crazy on the typing and I don't spend every waking moment thinking about those kinds of things? Maybe once you are into it it ain't so bad, but the learning curve seems pretty painful.

I was generally a static typing bigot, still probably mostly am, but reading about Dialyzer and Qi (and PLT has something, too, I think) has made me really start to appreciate the whole optional typing thing. I think. Haven't gotten to really use them yet, just toy around. Still stuck with Java and C++ at the moment. Have pity.

By [raould][84] at Tue, 2007-07-17 23:32 | [login][28] or [register][29] to post comments

[Moving Right Along][85]

As long-time readers know, I look forward to being able to decide at what stage I wish to prove the absence of undesirable properties in my code, and under what circumstances. That would involve something in between traditional static typing, dynamic typing, or even "optional static typing," which is itself an all-or-nothing affair. In the meantime, even relatively weak static type systems such as SML's, OCaml's, Haskell's, or Scala's seem helpful to me.

I think what you describe, though, is consistent with a lot of people's experience, including mine for many, many years: this stuff is intimidating to read about, and when the syntax of the language in question serves up its own impediments (coughHaskell, OCaml classiccough) the burden can simply be too much. Honestly, the way that I've learned most of what I know about OCaml is by writing, frankly, a tremendous amount of broken code—sometimes broken in the sense that it wouldn't compile, sometimes in the sense that it would compile and do the wrong thing, sometimes in the sense that it would compile but not be any safer than it would be if I'd written it in Java or Lisp. What I've come to appreciate, over time, is that as I've learned how to address the first and third cases, the number of second cases has gotten smaller and smaller and smaller—and not once have I had to jump through hoops to satisfy a finicky type system for no good reason.

OCaml could still use some good tutorials, but I'm curious: have you looked at any of the Scala tutorials? They seem remarkably high-quality to me, and certainly don't seem to make the type system seem complex (to me)! Scala seems like an excellent choice for those looking at all this typeful PLT stuff with a pragmatic eye, and if you're an Erlang fan you might find Scala's actors particularly interesting.

Having said that, it's very nice to see Erlang getting the respect it deserves, and I would, as always, add Oz to the list of dynamically-typed languages well worth learning.

By [Paul Snively][31] at Wed, 2007-07-18 03:28 | [login][28] or [register][29] to post comments

[How am I really going to][86]

How am I really going to debug somebody else's library when they've gone crazy on the typing and I don't spend every waking moment thinking about those kinds of things?

Which is what people say about Lisp macros and dynamic types.

By [Jeff Nowakowski][87] at Wed, 2007-07-18 12:21 | [login][28] or [register][29] to post comments

[true][88]

but what is the connection between those? None?

By [Rainer Joswig][33] at Wed, 2007-07-18 15:37 | [login][28] or [register][29] to post comments

[A worthwhile investment][89]

I'm frightened off by the patently (from the perspective of a Regular Joe, even tho I did SML in university) nutty over the top typing that goes on there.

I remember having a similar feeling several years ago (I know that I expressed it in the early days of LtU ;-) ). I remember getting a headache trying to sort out some complicated type, or type-inference failure, and wondering if this was worth it, or if it just got in the way, because after all I already knew how to program; what good was all this esoteric stuff?

Much like Paul's experience, sticking with the esoteric stuff and working through those "tricky cases" taught me that there was a LOT more to learn about programming and programs, and that understanding type systems deepened my understanding of how programs and programming really work, and which things are essential to them and which are just kruft that has accumulated based on the vagaries of slogging in the trenches.

Even if you end up using a language with less in-your-face typing, your understanding of it will be changed by the experience of understanding type systems.

Like a lot of things, including programming itself, when you start with it, it seems scary or difficult, but once you get the hang of it, it seems pretty straightforward, and you end up with an enriched arsenal of tools for thinking about problems and solutions.

A worthwhile investment, I'd say.

By [Marc Hamann][90] at Wed, 2007-07-18 13:01 | [login][28] or [register][29] to post comments

[Complications][91]

most research in 'modern' type systems gives the application developer very little, the impact is not very high and the complication is enormous.

I know I'd be interested in hearing more about any specific things/code-snippets which you've experienced that was complicated by types. It sounds like you gave Haskell a whirl. Was it the case that you couldn't write programs in the manner you liked? (either the algorithms, or because of some missing interactibility(?) of the REPL) Were the type error messages too daunting or obscure? Maybe it was harder to read other people's code? Problems using other's libraries/code? Too much academic literature, and not enough down to earth practical examples? Others points I'm missing? Were there other things (purity, laziness, type classes, etc.) about Haskell that you liked, if only you didn't have to contend with the static type system?

If you say newer languages are not reinventing Lisp, then you are right... languages like Scala, Haskell, OCaml are completely different languages.

Interestingly enough, [some people][92] think Haskell is a member of the Lisp family (the Preface, page v).

By [Greg Buchholz][93] at Wed, 2007-07-18 02:19 | [login][28] or [register][29] to post comments

[Closure(s) ;-)][94]

You make a lot of good points, and my sense has always been that we agree more than we disagree—at most, I think you see some things as essential to Lisp that I don't. That's fine; my desire is not to dissuade you, or anyone else, from using Lisp if that's what's appropriate and enjoyable.

My OCaml work isn't professional, and involves some fairly hairy noodling around with LablGL, the F-Rep approach to solid modeling, Oleg Kiselyov's delimited continuations and generic zipper, Chris King's FRP implementation, code reuse approaches inspired by solutions to the Expression Problem, and so on. My top-level goal has been to develop something akin to Tim Sweeney's UnrealEd. That's almost certainly too ambitious for a personal spare-time project, but it certainly has provided a large exploration space, and my day job being in Python these days provides a useful real-world contrast in the dynamic language space, although decades of experience with Lisp certainly provides that as well.

By [Paul Snively][31] at Wed, 2007-07-18 03:00 | [login][28] or [register][29] to post comments

[Erlang's history and design choices][95]

The most interesting and innovative FP language that I have seen in the last years is Erlang. Erlang is not statically typed. Plus Erlang is driven by real applications.

Armstrongs [thesis][96] (p. 3) talks about practical projects with Erlang in 1987:

_Towards the end of 1987 the first major experiment with Erlang startedâ€"a group of Ericsson engineers at Bollmora, led by Kerstin Ãdling, started work on a prototyping project. They chose Erlang to prototype something called “ACS/Dunder.” ACS was an architecture which was designed for implementing the Ericsson MD110 private automatic branch exchange (PABX).
_

I think we all can agree that type systems have made a lot of progress since then. Using Erlang which is 20+ years old as a motivation (?) for typelessness is not a very conclusive argument. People have even investigated Practical subtyping for Erlang.

By [Peter A Jonsson][97] at Wed, 2007-07-18 08:01 | [login][28] or [register][29] to post comments

[progress][98]

Can anybody give me an indication what this 'lot of progress' is and what impact it has for software development?

By [Rainer Joswig][33] at Wed, 2007-07-18 10:49 | [login][28] or [register][29] to post comments

[Progress][99]

I'd venture a guess and say that the main progress would be in terms of type inference, modules, type classes, and generic programming.

By [Chris Rathman][100] at Wed, 2007-07-18 19:06 | [login][28] or [register][29] to post comments

[And concurrency.][101]

And concurrency.

By [naasking][102] at Wed, 2007-07-18 19:33 | [login][28] or [register][29] to post comments

[sales][103]

if you have worked in sales, you would know that you need to present the arguments differently. A list of high-level buzzwords isn't something that convinces people. Start with a typical argumentation pattern:

  1. a sentence making a claim
  2. why is that?
  3. an example that supports the claim
  4. what advantage will it give me

If people here claim that so-called 'modern languages' (whatever that is) are 'better' (successors, more advanced, ...), I would think there should be some material that expands these claims and presents evidence.

Is there some material that descibes this progress in type inference, modules, type classes, and generic programming and presents advantages that are relevant for end-users (application developers)?

By [Rainer Joswig][33] at Thu, 2007-07-19 00:18 | [login][28] or [register][29] to post comments

[One possible case study][104]

Yaron Minsk's Caml Trading: Experiences in Functional Programming on Wall Street in [issue 7][105] of the Monad.Reader. ([LTU discussion][106])

By [Alexandre Richer][107] at Thu, 2007-07-19 01:05 | [login][28] or [register][29] to post comments

[My claim was that research][108]

My claim was that research on type systems had made a lot of progress since the mid 80's. This basically means that quite a few programs we could not directly express under a Hindley-Milner type system in the mid 80's are expressible with HM+extensions that are known today.

My impression is that you seem to disagree that static typing is a good thing, which is perfectly fine. However, under the assumption that the language is typed, people usually want an expressive type system with nice properties.

An example of a typed language with commercial success is Java.

By [Peter A Jonsson][97] at Thu, 2007-07-19 09:57 | [login][28] or [register][29] to post comments

[Fine ;-)][109]

Actually I agree with most what you say here.

I think static typing is very useful, expressive type systems are fine - unfortunately it leads to lots of complications in projects and I know only few people capable of working with them. I can easily imagine software areas where I would use it. 'Unfortunately' my personal thinking is kind of incompatible with it. Atleast that's what I believe. I'm not the 'bondage & discipline' (see Hacker's dictionary) kind of person when it comes to software development. I feel most comfortable with evolutionary, flexible software development, ... where the software is more like a dynamic environment.

Btw., my own experience with Java says, that once you got the code compiled you only have left 90% of the work to make it function correctly. The type system of Java does not contribute much to get working software. At least that was my experience working on several mildly large Java projects (largest was around 20 developers over two years). Once you got the software compiled, you could be sure that a few hours later it was broken again. Some team member checked in software and claimed that it was working for him. Continuous Integration, running the test suites, showed a different result then.

The most funny quote about Java was lately from Steve Jobs when he was asked why there is no Java on the iPhone. He said something like: “Java’s not worth building in. Nobody uses Java anymore. It’s this big heavyweight ball and chain.”. ;-)

By [Rainer Joswig][33] at Thu, 2007-07-19 12:30 | [login][28] or [register][29] to post comments

[Do you know which languages][110]

Do you know which languages are preferably used for iPhones application development?

By [Kay Schluehr][49] at Thu, 2007-07-19 12:58 | [login][28] or [register][29] to post comments

[languages for the iPhone][111]

A guess:

Apple uses C, Objective C and Javascript internally on the device.
The OS is C, the libraries/applications on top are Objective C, some of the UI probably is HTML/Javascript/CSS (this is a guess). If you look at the widgets, they look similar to what runs on the Mac, developed with Dashcode. Dashcode is a new fancy development environment for these kinds of applications. I would guess that there is a version of this development environment also available for the iPhone (also just a guess).

Externally people are currently left with the browser as a runtime platform. That means Javascript on the pages plus often some server developed in any language you like - since the server runs somewhere else. This follows the AJAX model. But I can imagine that a few selected companies are already allowed to work for the new platform using C/Objective C/C++.

By [Rainer Joswig][33] at Thu, 2007-07-19 14:15 | [login][28] or [register][29] to post comments

[Betting][112]

Rainer Joswig: But I can imagine that a few selected companies are already allowed to work for the new platform using C/Objective C/C++.

I'd be willing to bet a not insignificant sum of money that this is false. One of the major lessons learned from the PalmOS-on-phones and BREW experiences has been that C-derived languages targeting devices that absolutely must be reliable is an unmitigated disaster. Living within WebKit really is the right thing on the iPhone.

By [Paul Snively][31] at Thu, 2007-07-19 16:20 | [login][28] or [register][29] to post comments

[Betting against][113]

You mean, I don't get Ms. PAC-MAN for the iPhone??? Don't be so cruel. No iPod Quiz? No BEJEWELED???

I don't buy that for a moment. There is TONs of software for phones.
Google for phone and software. ;-)

Symbian has lots of apps without problems. The are sites on the net with lots of software for phones. I had a Sony Ericsson p800 and a Blackberry. Downloading and running software was no problem.

EA develops games for the iPod. There is no official software kit for the iPod, but still a few companies are writing code. There are 16 games for the iPod. I bet that there will be games for the iPhone. Nintendo was mentioned (though that is unlikely, but THAT would be cool). But EA makes perfect sense.

I think it would be totally stupid if Apple would not try to sell software for the phone running on the phone. Plus I think the same platform that runs the iPhone will be running the next iPods. There will be software for those.

Absolutely reliable? But why does Apple write in C-derived languages? I read about lots of crashing software on the iPhone in the reviews. Webkit alone is a huge risk with bugs and holes detected every other week.

By [Rainer Joswig][33] at Thu, 2007-07-19 18:04 | [login][28] or [register][29] to post comments

[It seems to me that this][114]

It seems to me that this thread is drifting fast from LtU related topics.

By [Ehud Lamm][115] at Thu, 2007-07-19 18:19 | [login][28] or [register][29] to post comments

[Javascript][116]

He, JavaScript on the phone has closures and eval. ;-)

By [Rainer Joswig][33] at Thu, 2007-07-19 18:33 | [login][28] or [register][29] to post comments

[And it occasionally gets accused...][117]

of being a Lisp.

By [Scott Johnson][118] at Thu, 2007-07-19 20:20 | [login][28] or [register][29] to post comments

[It's Not Just an Accusation][119]

My former colleague Waldemar Horwat, who is responsible for the JavaScript 2 spec, implemented the semantics of JavaScript in Common Lisp, and is (in)famous for observing that he believed that JavaScript was just a different surface syntax for Lisp. Of course, it's true in the best possible way for it to be true: by implementation.

Apparently there will be a sense in which [ECMAScript][120] will be a "different surface syntax" for Standard ML. ;-) Of course, folks familiar with the embedding process being used will understand the limits of such a claim.

By [Paul Snively][31] at Thu, 2007-07-19 20:57 | [login][28] or [register][29] to post comments

[Sales campaigns][121]

if you have worked in sales, you would know that you need to present the arguments differently. A list of high-level buzzwords isn't something that convinces people.

I don't recall trying to make a sales pitch nor using any buzzwords? And I don't care whether I was persuasive. I personally find the running argument of static/dynamic to be rather tiresome... So I'll let y'all decide this age-old question once and for all. But you really asked two questions. First, what is the nature of progress in programming languages with modern type systems? And second, what does that mean for the (mythical?) typical programmer? I simply opted to provide an incomplete (terse?) answer to the first question. I'll leave it to the advocates to spill wasted verbiage on the second.

Is there some material that descibes this progress in type inference, modules, type classes, and generic programming and presents advantages that are relevant for end-users (application developers)?

Again, these are two distinct questions. For the first one, there is ample material on LtU and elsewhere that describes the progress made in type systems - the threads on [Why Type Systems are Interesting][122] that are listed in [Getting Started][123] are as good a place as any to jump in. For the second, I'll leave it to promoters to amicably resolve the matter.

By [Chris Rathman][100] at Thu, 2007-07-19 15:09 | [login][28] or [register][29] to post comments

[tech stuff is on topic][124]

Rainer Joswig: Is the way language tools work and their facilities off-topic here?

I like to hear about them, and there's a lot of latitude around here to discuss different aspects of programming language context, as long as the language part is in the picture. It could go off topic by emphasizing generic tool qualities not specific to any language per se, or by getting far from the original post. Tools and support specific to Lisp — emphasizing how Lisp works — seem on topic, especially when touching the original post's thesis of re-finding Lisp.

Language advocacy is off topic (unless you can be as stylish and funny as Kay Schluehr managed to be earlier :-). It's best to focus on what's technically interesting about a language. Or on general observations about what constraints aren't necessary that sometimes folks assume — like you mentioned compilation shouldn't be necessary for a debug support. We often don't talk about the software stack as a whole much, and that's both interesting and good place to mention upsides to a Lisp approach.

The original post had some style elements and punctuation that might normally get a thread like this tagged as bait of some kind, or just innocent zeal, but it's since gotten respectable enough. The clever, mature tack you take reads well, and I hope folks draw you out a little more. But since I'm pro Lisp, it would read like a staged promotion if I took part much myself.

By [Rys McCusker][125] at Tue, 2007-07-17 05:52 | [login][28] or [register][29] to post comments

[I'm a bit confused. I would ][126]

I'm a bit confused. I would never implement as "set of elements" ( what else? ) as a list. So I might fail to see the light ... the list.

By [Kay Schluehr][49] at Sun, 2007-07-15 18:20 | [login][28] or [register][29] to post comments

[Actually sorted lists do][127]

Actually sorted lists do make a reasonably decent implementation of sets, but somehow I don't think this is what was intended...

By [Derek Elkins][38] at Sun, 2007-07-15 18:40 | [login][28] or [register][29] to post comments

[Java+XSLT software stack][128]

I'm working on a project one component of which involves Java and the XML/XSLT software stack. Suddenly it hit me: garbage collection through Java, code as data, functional expressions, language extension... the XML software stack reimplements much of lisp the long, enterprisey way around!

Of course, it's much more enterprisey and mandates Unicode support, so it's going to see more widespread deployment than Lisp will...

By [bitwize][129] at Sun, 2007-07-15 21:54 | [login][28] or [register][29] to post comments

[It gets better...][130]

XSLT is, in fact, a Turing-complete purely-functional language.

By [Paul Snively][31] at Sun, 2007-07-15 22:45 | [login][28] or [register][29] to post comments

[I'm aware of that; and while][131]

I'm aware of that; and while it is useful for a certain class of applications it doesn't make it nearly as flexible or fun to develop in as Lisp, though.

By [bitwize][129] at Tue, 2007-07-17 12:00 | [login][28] or [register][29] to post comments

[More Tongue in Cheek][132]

Of course—the occasions upon which one would want to take advantage of XSLT's Turing-completeness are minimal, and the results sufficiently byzantine to suggest reimplementation using another tool. I should have added a :-) above.

By [Paul Snively][31] at Tue, 2007-07-17 13:53 | [login][28] or [register][29] to post comments

[Java][133]

The Java project I was working had all that, too. Java application servers have the feature of deploying code in a running system. The software engineers didn't really get it working though - so there was some productivity advantage unrealized...

By [Rainer Joswig][33] at Mon, 2007-07-16 00:56 | [login][28] or [register][29] to post comments


Logs: [Hack The Planet][134] ; [JavaLobby][135] ; [Daily Python-URL][136] ; [Daily WTF][137] ; [PHP everywhere][138] ; [(more)][139]
Wikis: [WikiWiki][140] ; [Erlang][141] ; [Common Lisp][142] ; [Haskell][143] ; [Squeak][1] ; [Tcl][144] ; [Program Transformation][145]

|

Browse archives

[«][146] February 2018   | Su | Mo | Tu | We | Th | Fr | Sa |
|   |   |   |   | 1 | 2 | 3 | | | | | [4][147] | 5 | 6 | [7][148] | [8][149] | 9 | 10 |
| 11 | 12 | 13 | 14 | 15 | 16 | [17][150] |
| [18][151] | 19 | 20 | 21 | [22][152] | 23 | 24 |
| 25 | 26 | 27 | 28 |   |   |   |

Active forum topics

  • [Bottom][153]
  • [Are Monads a Waste of Time?][154]
  • [Generics and Reverse Generics for Dynamic Languages][155]
  • [An impure solution to the problem of matching fans][156]
  • [Site migration][157]

[more][158]

New forum topics

  • [Bottom][153]
  • [Generics and Reverse Generics for Dynamic Languages][155]
  • [Are Monads a Waste of Time?][154]
  • [Type systems for acyclic terms][159]
  • [Mark A simple and unified notation for both object and markup data][160]

[more][158]

Recent comments

  • [Confused][161]
    2 hours 17 min ago
  • [You claim your analogy has][162]
    7 hours 49 min ago
  • [Your analogy relies on][163]
    9 hours 2 min ago
  • [IO impure][164]
    9 hours 33 min ago
  • [Monads aren't a waste of][165]
    11 hours 26 min ago
  • [Your analogy relies on][166]
    15 hours 31 min ago
  • [There is no concept][167]
    16 hours 31 min ago
  • [Sic et non][168]
    17 hours 58 min ago
  • [Not directly][169]
    18 hours 10 min ago
  • [Relational Algebra][170]
    19 hours 2 min ago

|

[1]: [2]: http://lambda-the-ultimate.org/themes/chameleon/ltu/tagline.png [3]: http://lambda-the-ultimate.org/misc/xml.gif [4]: http://lambda-the-ultimate.org/ [5]: http://lambda-the-ultimate.org/node/view/34 [6]: http://lambda-the-ultimate.org/node/view/40 [7]: http://lambda-the-ultimate.org/node/view/492 [8]: http://lambda-the-ultimate.org/forum/1 [9]: http://lambda-the-ultimate.org/forum/2 [10]: http://lambda-the-ultimate.org/tracker [11]: http://lambda-the-ultimate.org/node/add/forum/1 [12]: http://lambda-the-ultimate.org/node/view/49 [13]: http://lambda-the-ultimate.org/node/view/2 [14]: http://lambda-the-ultimate.org/node/view/4 [15]: http://lambda-the-ultimate.org/node/view/3 [16]: http://lambda-the-ultimate.org/node/view/5 [17]: http://lambda-the-ultimate.org/node/view/7 [18]: http://lambda-the-ultimate.org/classic/lambda-archive1.html [19]: http://lambda-the-ultimate.org/user/register "Create a new user account." [20]: http://lambda-the-ultimate.org/user/password "Request new password via e-mail." [21]: http://lambda-the-ultimate.org/forum [22]: http://lambda-the-ultimate.org/user/3161 "View user profile." [23]: http://lambda-the-ultimate.org/taxonomy/term/1 [24]: http://lambda-the-ultimate.org/node/2358 "Questions on an improved CPS mechanism for JavaScript" [25]: http://lambda-the-ultimate.org/node/2347 "Type inference for free?" [26]: http://www.technorati.com/search/lambda-the-ultimate.org/node/2352 "Technorati search of other blogs commenting on this post." [27]: http://lambda-the-ultimate.org/node/2352#comment-35070 [28]: http://lambda-the-ultimate.org/user/login [29]: http://lambda-the-ultimate.org/user/register [30]: http://lambda-the-ultimate.org/node/2352#comment-35071 [31]: http://lambda-the-ultimate.org/user/289 "View user profile." [32]: http://lambda-the-ultimate.org/node/2352#comment-35077 [33]: http://lambda-the-ultimate.org/user/1620 "View user profile." [34]: http://lambda-the-ultimate.org/node/2352#comment-35079 [35]: http://metaocaml.org [36]: http://lambda-the-ultimate.org/node/2352#comment-35088 [37]: http://lambda-the-ultimate.org/node/2352#comment-35091 [38]: http://lambda-the-ultimate.org/user/1510 "View user profile." [39]: http://lambda-the-ultimate.org/node/2352#comment-35102 [40]: http://lambda-the-ultimate.org/node/2352#comment-35092 [41]: http://lambda-the-ultimate.org/node/2352#comment-35139 [42]: http://lambda-the-ultimate.org/user/2930 "View user profile." [43]: http://lambda-the-ultimate.org/node/2352#comment-35141 [44]: http://lambda-the-ultimate.org/node/2352#comment-35144 [45]: http://lambda-the-ultimate.org/node/2352#comment-35145 [46]: http://lambda-the-ultimate.org/node/2352#comment-35147 [47]: http://lambda-the-ultimate.org/user/2160 "View user profile." [48]: http://lambda-the-ultimate.org/node/2352#comment-35152 [49]: http://lambda-the-ultimate.org/user/2128 "View user profile." [50]: http://lambda-the-ultimate.org/node/2352#comment-35153 [51]: http://lambda-the-ultimate.org/node/2352#comment-35155 [52]: http://userpages.umbc.edu/~hefner1/listener.png [53]: http://lambda-the-ultimate.org/node/2352#comment-35251 [54]: http://lambda-the-ultimate.org/user/4287 "View user profile." [55]: http://lambda-the-ultimate.org/node/2352#comment-35098 [56]: http://lambda-the-ultimate.org/node/2352#comment-35100 [57]: http://lambda-the-ultimate.org/node/2352#comment-35114 [58]: http://people.csail.mit.edu/gregs/ll1-discuss-archive-html/msg03591.html [59]: http://lambda-the-ultimate.org/user/431 "View user profile." [60]: http://lambda-the-ultimate.org/node/2352#comment-35159 [61]: http://lambda-the-ultimate.org/user/3907 "View user profile." [62]: http://lambda-the-ultimate.org/node/2352#comment-35074 [63]: http://citeseer.ist.psu.edu/launchbury00zip.html [64]: http://citeseer.ist.psu.edu/bird98de.html [65]: http://lambda-the-ultimate.org/user/1235 "View user profile." [66]: http://lambda-the-ultimate.org/node/2352#comment-35078 [67]: http://lambda-the-ultimate.org/node/2352#comment-35089 [68]: http://lambda-the-ultimate.org/node/2352#comment-35093 [69]: http://lambda-the-ultimate.org/node/2352#comment-35101 [70]: http://lambda-the-ultimate.org/node/2352#comment-35108 [71]: http://pauillac.inria.fr/~guesdon/Tools/cameleon/cameleon.html [72]: http://ocaml.eclipse.ortsa.com:8480/ocaide/ [73]: http://www.haskell.org/visualhaskell/ [74]: http://lambda-the-ultimate.org/node/2352#comment-35110 [75]: http://lambda-the-ultimate.org/node/2352#comment-35115 [76]: http://lambda-the-ultimate.org/node/2352#comment-35118 [77]: http://lambda-the-ultimate.org/node/2352#comment-35119 [78]: http://lambda-the-ultimate.org/node/2352#comment-35121 [79]: http://lambda-the-ultimate.org/node/2352#comment-35128 [80]: http://www.se-radio.net/index.php?post_id=226313 [81]: http://lambda-the-ultimate.org/node/2352#comment-35131 [82]: http://groups.google.com/group/comp.lang.lisp/msg/43090ddeeb50051c [83]: http://lambda-the-ultimate.org/node/2352#comment-35132 [84]: http://lambda-the-ultimate.org/user/2292 "View user profile." [85]: http://lambda-the-ultimate.org/node/2352#comment-35135 [86]: http://lambda-the-ultimate.org/node/2352#comment-35142 [87]: http://lambda-the-ultimate.org/user/2472 "View user profile." [88]: http://lambda-the-ultimate.org/node/2352#comment-35146 [89]: http://lambda-the-ultimate.org/node/2352#comment-35143 [90]: http://lambda-the-ultimate.org/user/4 "View user profile." [91]: http://lambda-the-ultimate.org/node/2352#comment-35133 [92]: http://homepages.cwi.nl/~jve/HR/ [93]: http://lambda-the-ultimate.org/user/1296 "View user profile." [94]: http://lambda-the-ultimate.org/node/2352#comment-35134 [95]: http://lambda-the-ultimate.org/node/2352#comment-35138 [96]: http://www.sics.se/~joe/thesis/armstrong_thesis_2003.pdf [97]: http://lambda-the-ultimate.org/user/2050 "View user profile." [98]: http://lambda-the-ultimate.org/node/2352#comment-35140 [99]: http://lambda-the-ultimate.org/node/2352#comment-35150 [100]: http://lambda-the-ultimate.org/user/3 "View user profile." [101]: http://lambda-the-ultimate.org/node/2352#comment-35151 [102]: http://lambda-the-ultimate.org/user/2352 "View user profile." [103]: http://lambda-the-ultimate.org/node/2352#comment-35156 [104]: http://lambda-the-ultimate.org/node/2352#comment-35157 [105]: http://haskell.cs.yale.edu/sitewiki/images/0/03/TMR-Issue7.pdf [106]: http://lambda-the-ultimate.org/node/2216 [107]: http://lambda-the-ultimate.org/user/1112 "View user profile." [108]: http://lambda-the-ultimate.org/node/2352#comment-35162 [109]: http://lambda-the-ultimate.org/node/2352#comment-35164 [110]: http://lambda-the-ultimate.org/node/2352#comment-35167 [111]: http://lambda-the-ultimate.org/node/2352#comment-35183 [112]: http://lambda-the-ultimate.org/node/2352#comment-35186 [113]: http://lambda-the-ultimate.org/node/2352#comment-35188 [114]: http://lambda-the-ultimate.org/node/2352#comment-35189 [115]: http://lambda-the-ultimate.org/user/1 "View user profile." [116]: http://lambda-the-ultimate.org/node/2352#comment-35190 [117]: http://lambda-the-ultimate.org/node/2352#comment-35196 [118]: http://lambda-the-ultimate.org/user/176 "View user profile." [119]: http://lambda-the-ultimate.org/node/2352#comment-35197 [120]: http://lambda-the-ultimate.org/node/2289 [121]: http://lambda-the-ultimate.org/node/2352#comment-35184 [122]: http://lambda-the-ultimate.org/node/492#comment-22898 [123]: http://lambda-the-ultimate.org/node/492 [124]: http://lambda-the-ultimate.org/node/2352#comment-35120 [125]: http://lambda-the-ultimate.org/user/2390 "View user profile." [126]: http://lambda-the-ultimate.org/node/2352#comment-35080 [127]: http://lambda-the-ultimate.org/node/2352#comment-35081 [128]: http://lambda-the-ultimate.org/node/2352#comment-35084 [129]: http://lambda-the-ultimate.org/user/955 "View user profile." [130]: http://lambda-the-ultimate.org/node/2352#comment-35086 [131]: http://lambda-the-ultimate.org/node/2352#comment-35123 [132]: http://lambda-the-ultimate.org/node/2352#comment-35126 [133]: http://lambda-the-ultimate.org/node/2352#comment-35090 [134]: http://wmf.editthispage.com/ [135]: http://www.javalobby.org [136]: http://www.pythonware.com/daily [137]: http://thedailywtf.com/default.aspx [138]: http://phplens.com/phpeverywhere/ [139]: http://lambda-the-ultimate.org/node/view/13 [140]: http://c2.com/cgi/wiki?RecentChanges [141]: http://www.trapexit.org/Special:Recentchanges [142]: http://www.cliki.net/Recent%20Changes [143]: http://www.haskell.org/haskellwiki/Special:Recentchanges [144]: http://purl.org/thecliff/tcl/wiki [145]: http://www.program-transformation.org/Transform/WebChanges [146]: http://lambda-the-ultimate.org/archive/2018/01/23 "Previous month" [147]: http://lambda-the-ultimate.org/archive/2018/2/4 "1 post" [148]: http://lambda-the-ultimate.org/archive/2018/2/7 "1 post" [149]: http://lambda-the-ultimate.org/archive/2018/2/8 "1 post" [150]: http://lambda-the-ultimate.org/archive/2018/2/17 "1 post" [151]: http://lambda-the-ultimate.org/archive/2018/2/18 "1 post" [152]: http://lambda-the-ultimate.org/archive/2018/2/22 "1 post" [153]: http://lambda-the-ultimate.org/node/5506 "2 comments" [154]: http://lambda-the-ultimate.org/node/5504 "79 comments" [155]: http://lambda-the-ultimate.org/node/5505 "1 comment" [156]: http://lambda-the-ultimate.org/node/5487 "13 comments" [157]: http://lambda-the-ultimate.org/node/5490 "9 comments" [158]: http://lambda-the-ultimate.org/forum "Read the latest forum topics." [159]: http://lambda-the-ultimate.org/node/5502 "4 comments" [160]: http://lambda-the-ultimate.org/node/5501 [161]: http://lambda-the-ultimate.org/node/5506#comment-95381 [162]: http://lambda-the-ultimate.org/node/5504#comment-95380 [163]: http://lambda-the-ultimate.org/node/5504#comment-95379 [164]: http://lambda-the-ultimate.org/node/5504#comment-95378 [165]: http://lambda-the-ultimate.org/node/5504#comment-95377 [166]: http://lambda-the-ultimate.org/node/5504#comment-95376 [167]: http://lambda-the-ultimate.org/node/5504#comment-95375 [168]: http://lambda-the-ultimate.org/node/5506#comment-95374 [169]: http://lambda-the-ultimate.org/node/5504#comment-95373 [170]: http://lambda-the-ultimate.org/node/5504#comment-95372