18 comments

[ 4.8 ms ] story [ 54.2 ms ] thread
I mostly liked this article to show some of the basic features of CLOS, but was a little disappointed about the attitude toward the end. The attitude toward some of the more advanced features of CLOS like method combination reminds me of the attitude that some people have for functional programming. "Well, it's cool you can 'map' and 'reduce' a function across a list, but why not just use a for-loop?" I think most people on HN can see why that may not be a good attitude to have because of the larger implications of functional programming.

Method combination has an overarching theory behind it. My take is as follows: Methods are by definition associated with a set of constraints on the arguments. The constraints are, for the most part, specified by their class. Because classes form a mathematical lattice, we have the notion of "more and less specifically applicable methods" for a set of arguments, and so the aforementioned constraints can be ordered and usually the most specific method is called, as the article explains. But the key thing to notice here is that if we remove the notion of "more or less applicable", and replace it with just the notion of "applicable", then we can do some interesting things.

For a particular generic function (Lisp parlance for a method with unspecified constraints), and for a given set of arguments to the function, there is a set of applicable methods. How we arrange to execute these applicable methods, and how we arrange to use the results of the executions, is what constitutes method combination.

There are two trivial ways to arrange what gets executed. The popular way is to just execute the most specific only. The other trivial way is to just execute everything. Many kinds of non-default method combinations (like the LIST method combination) do this. Another one, which I find generally more useful, is the + method combination. (This sums all of the results of the applicable methods. One usual example is calculating prices with additive taxes.)

Many problems can be decomposed into one which sounds like the following: 1. Classify your objects into a (multiple-inheritance) class hierarchy. 2. Write down the behavior that is applicable to products of these objects.

If you can do 1 & 2, then these aspects of CLOS and method combination can solve your problem in a clean way.

* * *

There were a few nits I had with the article otherwise. What he calls "forms" are not forms. "Forms" are memory representations of the syntax. The syntax is called "symbolic expressions" or "S-expressions" or "S-exprs". An even more pedantic nit is that IF is not called a "special form", it is called a "special operator". The combination of a special operator and its arguments make a "special form". (But who cares. Even seasoned Lispers say "special form" for operators.)

Indeed, where the article says:

"these features are too advanced to be useful in 99% of the cases"

I'm pretty sure when I wrote CLOS for a living (mind you, not recently) that I used :before, :around and :after rather more than that - they are a very natural and pretty simple extension to the basic method dispatch mechanism.

I mean they are if nothing else a good place to shove sanity-checking/design-by-contract code with out bloating (see: making harder to reason about) the actual method.
Since ~2009 Perl 5 has had the Moo* ecosystem of modules (Moose, Moo, Mouse) to provide an object system that supports much of this. It was created as a backport of ideas for Perl 6's object system, which was heavily inspired by CLOS and the Smalltalk traits paper (always liberally steal the best ideas!).

That is, there's quite a lot of Perl 5 out there that makes extensive use of method modifiers[1] like before, after, around and friends.

1: http://search.cpan.org/dist/Moose/lib/Moose/Manual/MethodMod...

I wonder if anyone has a favorite example that uses method combinations, or auxiliary methods (:before, :after, :around), or something MOP related. Preferably one that is "in-the-wild" and not invented just to showcase the feature.
> Something MOP related

Postmodern[0] defines simple wrapper objects so that you can access databases rows as objects. The same goes for the Elephant persistent database[1]. Cells[2] define metaobjects for classes with dataflow dependencies where slots can be automatically updated in a reactive fashion.

:AROUND methods and the like are used quite often. In fact, the default way of defining a "constructor" function for your class is to specialize "initialize-instance" with an :after qualifier, so that you can fill slots that could not be initialized with the arguments to "make-instance" or the default initargs.

[0] http://marijnhaverbeke.nl/postmodern/

[1] https://common-lisp.net/project/elephant/

[2] https://common-lisp.net/project/cells/

At work we have a condition (think: exception) hierarchy that uses multiply inherited mixins. One might be validation-failure and introduce a slot telling you the invalid value. Another might be user-error that records the user that triggered the error. A third might carry an RPC error code for use if reported over RPC.

I used a generic function with list combination to collect from the mixins only the slots that should be reported over RPC. The user is not among them since it is always reported to the user that triggered the error.

Seems pretty nifty, would love if you could share a gist [implementation] of the idea
Ah, it wasn't list, it was append. Though list would be fine if each mixin contributes no more than one item, I wanted mixins to be able to contribute more if necessary, so they always return lists which the combination appends to the result. It also allows them to decide to return nil and behave as though they were not called at all.

Here's a suitably abstracted implementation of the idea: https://gist.github.com/spacebat/dbad3b50684b3a516071abb3757...

Yes I am likening RPC programming to dealing with monsters in the darkness.

s-expressions are a syntax for data. Lisp syntax is then layered on top of s-expressions.
To provide an example of the utility of method combinations:

I wrote a project skeleton generator[0] whose functionality is provided by progn-composable plugins, implemented as mixin classes.

Every bit of functionality, like adding a README.md file to a project skeleton, adding a .gitignore file, adding stub unit tests, etc. is implemented as a mixin class. A full template inherits[1] all the mixins it needs.

There is a generic function, render-template[1], that takes a template, some options, and the target directory, and uses the progn method combination. Meaning: every method in the chain is called in succession, and each method adds its own thing to the generated project. The render-template method for the gitignore mixin adds a .gitignore file, for instance. When render template is called on an instance of a class that inherits a bunch of template mixins, it runs all of those mixins in addition to the render-template method of that class itself (if any).

In a sense, this is basically the entity-component pattern[3] implemented in the object system itself, with the caveat that you can't have "multiple instances" of the same component -- you can't inherit a class twice.

[0]: https://github.com/roswell/mystic

[1]: https://github.com/roswell/mystic/blob/2d0fd8e401d50893b4a15...

[2]: https://github.com/roswell/mystic/blob/2d0fd8e401d50893b4a15...

[3]: https://en.wikipedia.org/wiki/Entity_component_system

Are go-lang interfaces borrowed from lisp style multiple dispatch?