Search Results: "ag"

13 June 2007

Eddy Petrișor: Your next Gnome subversion client...

... is NaughtySVN.

I have joined this project which was started by Alexander Thomas a few weeks ago and I have convinced him that is better to have a release sooner rather than later. The project is still in its early alpha stage[*] but I thought is better to have a rather minimalist and functional client first.
So, I talked to Alexander and we came up with a roadmap; for the 0.0.1 release I am working on the update feature which is about 40% done[1][2] (update dialog screenshot).

Of course, after the release I will probably make a debian package, too, unless someone else beats me to it :-) .

So, the future is bright.


Update: as a response to a comment, NaughtySVN is designed to be not only a Subversion client, but also a framework for other VCS-es and other clients. It just happens that we are working on the Subversion backend and client at the moment.

P.S.: as curiosity of mine, I have written in python a small nautilus plugin that does the svn update (is a svn frontend) and I must say I really miss the development speed of python when writing in C (or maybe I am out of practice).

[*] only a few features are implemented and can't be used yet as a SVN client without being forced to use another client.
[1] according to my estimations
[2] update related code is not committed yet

DebConf team: DebConf7 Gallery (Posted by Joerg Jaspert)

Similar to last year we opened a DebConf7 gallery on our gallery server. We would like to have this again as a central point for all pictures taken at DebConf7, so we would really appreciate if you can (in addition to your own gallery) upload there. As it is open for everyone just create a user and send a little mail to gallery-admins@debconf.org to get your account activated if you do not have one already.

Ross Burton: Postr 0.7

Postr 0.7 is out, fixing a couple of very nasty bugs. Tarballs at the usual place, packages heading towards Debian shortly. NP: Flight 602, Aim

MJ Ray: the Connection, paperless billing and post offices

Just got my copy of the Connection for June in the email today. Highlights: expansion of paperless billing and putting savings into a new sustainability fund that will be used to "green" the co-op further; profiles of Emerge, Cycle Training UK, Low Carbon Lifestyle, and Resurgence Magazine; not following BT's introductions of charges for 1571 ( 1/month), non-DD payment and late payment (up to 7.50/bill); free line transfers until end of August; new mobile phone services; previously-posted ADSL charging plan changes. (Note: I'm a member of this consumer co-op and my main company is Phone Co-op agent 471 if you'd like to join through us.) An interesting question is how that new sustainability fund will be allocated. I can't see an answer in this newsletter, but I've signed up for the extra paperless services anyway. I have mixed feelings about that: it may be helping save trees and fuel, but is it also further harming my rural post service by reducing the amount of post sent to me? Then again, it looks like the government has caused most harm to rural post offices by moving social service payments to banks and slowly reducing the number of services at rural sub-offices, while the Post Office themselves are doing "ludicrous" things like moving main post offices out of historic buildings and into the backs of newsagent chains. I care more about the offices than the delivery service and they don't seem very connected here.

Lucas Nussbaum: maintainer wanted for next generation tetrinet server!

You probably all know tetrinet - if you don’t, you should really try that game. There are several servers for that game out there, and one of them is tetrinetx. It is packaged in Debian, but it has several problems: A few years ago, I worked with a few friends on improving tetrinetx. This resulted in: This is hosted on sourceforge under the name tetrinetx-ng, but it hasn’t seen any activity for the last two years. It would really be great if a tetrinet fan could take over the project and start making it alive again. Then tetrinet.debian.net could support tetrifast ;) Also, I could try to setup a server with tetrinetx-ng. Someone wants to host tetrifast.debian.net for me ? Needed: MySQL DB + Apache (for the stats), + not being afraid of insecure code (doesn’t need to run as root)

Adam Rosi-Kessel: Parmet on Public Health and Individualism

Via Jason, my brilliant former Constitutional Law professor Wendy Parmet weighs in on the XDR-TB scare. Unlike most coverage, Professor Parmet brings out the big picture of how the incident fits into a larger flawed public health policy:
…It is trite but true that in America we admire individual self-sufficiency and rugged individualism. Not only do we admire this taking care of number 1 attitude, but public health has encouraged it. Over the last several decades, public health has emphasized the role that individuals can and should play in determining their own health. Indeed, every day of week, we are bombarded with messages about how we can do this or that to take care of ourselves. Sometimes the message extends to what we can do for our families. Seldom are we told what or how we can do for unnamed others. Even infectious disease policies perpetuate this myth of self-control. We are told to vaccinate our children to protect them. We are told to help ourselves by getting a flu shot. And the federal government provides us with information about how we should prepare to help ourselves and our family in the event of an influenza pandemic. This privatization of infectious disease control is even evident in the U.S. approach to quarantine. During the SARS epidemic, governments in Canada and in Asia quickly realized that quarantines would not be effective without income protection. So laws were passed to assure that people would receive compensation while under quarantine. In the United States, in contrast, despite all the efforts that have been made at public health preparedness and public health law modernization, income replacement remains off the table (the Family and Medical Leave Act only guarantees unpaid leaves for some ill employees). Perhaps even more astonishingly, in its proposed quarantine regulations, the CDC failed to ensure that it would provide all necessary health care to those it quarantined. …

Mario Iseli: Organize stuff and prepare for Debconf

Hello World :) Debconf (16.6.2007) is getting closer, in 77 hours I will take the train to the airport in Geneva and then fly to Edinburgh. I didn’t really organize anything yet so it becomes stressful.
* Today I organized a kilt from a friend, looks quite funny, I will wear it on Saturday.
* Wednesday I want to prepare my private notebook and maybe even my IBM x60s from the office.
* Wednesday I want to prepare my digital camera and clean the memory stick.
* Wednesday I’ll organize 95 for the LPI exams.
* Wednesday evening I’ll go out with some friends to have party (several of my friends go to the Greenfield festival Thursday evening and I go to Debconf, time to celebrate)
* Thursday evening I will leave work early and go to Biel to buy some clothes for me, cheese for madduck and the othere Cheese’n'Wine participiants, chocolate for ana, cookies for Joerg. (If you also want something from .ch, please ping me on IRC)
* Thursday after shopping I need to go to a business dinner in a Mongolian BBQ restaurant.
* Friday I need to organize some W-Lan cards for the airport in Geneva in a Swisscom-Shop.
* Friday I would like to bring a friend a birthday gift.
* Friday I would like to go to have a drink with my ex-girlfriend.
* Friday night I need to prepare my baggage including all technical stuff. So you see, several tasks I have to do (this weren’t all of them) and I hope to be able to do all of that ;) See you in Teviot, Saturday afternoon!

12 June 2007

Matt Brown: Back on the Intarnets

Now that we’ve settled into our new apartment in Dublin, the ADSL has been connected and I’m back on the net! Obviously I’ve had Internet access at work during this time, but there has been so much new information to take in that I haven’t really had time to do any Debian or WLUG work. I’m still waiting for the shipping company to deliver my computers, so it will be another week or two before I have a development environment that can build and test package. Once that’s setup again I have updates queued for the following: Unfortunately I’m not going to make it to Debconf this year, despite being the closest geographically that I’ve ever been. :(

Ross Burton: Shock and Awe

From The Hacker's Guide To GPSD:
The best way to avoid having dynamic-memory allocation problems is not to use malloc/free at all.
An interesting approach to avoiding dynamic memory problems which in general are not that hard to debug with good tools (such as Valgrind), especially in relatively simple pieces of code like gpsd. However, in the next section:
The parsing of GPGSV sentences in the NMEA driver has been a persistent and nasty trouble spot, causing more buffer overruns and weird secondary damage than all the rest of the code put together.
Personally, I often find that not allocating buffers on the stack and using dynamically allocated memory with length-bounded functions helps fix buffer overruns.

Biella Coleman: Housebreaking Your Health Insurance

Are you having trouble with your health insurance? Are they stalling on paying a bill? Denying a claim? Not telling you what the heck is going on?? Well you can and should take action to eliminate some of the mystery and move forward, and possibly win fight against the health insurance company. Thanks to my unpleasant ordeals with BCBS of NJ, I have compiled some handy resources and tips to get you started. Good luck and I welcome any other tips that you think should be here. Please email them to me at biella(at)gmail(dot)com Can’t get a straight answer when dealing with health insurance representatives on the phone? Are different representatives providing different and contradictory information? Does talking to the representatives leave you with a pounding headache? Then the following may be helpful: 1. Ideally you should tape record all conversations. If this is not possible, get the name or employee number of the person you are talking to and write down what they told you along with the time and date. If they have agreed to something, make sure they send it to you in writing. This sort of documentation may come in handy later when you are trying to contest or prove something. Is your insurance company flip flopping on a claim? For example telling you that the claim is still being “reviewed” but sending you statements that indicate it has not been paid and never will be? What action can you take to inch things forward? The following may help: 1. Most states have a Department of Banking and Insurance and they are there to help you. Many (perhaps all) provide a service for filing a complaint against your health insurance company and other insurance and banking companies too. When I used the service in NJ , I got assigned an investigator and their service was prompt and helpful. It was my experience that even though they were not able to resolve my issue, the insurance company started to make firm decision on many claims and this alone has been helpful. Before this, it was impossible to get a clear answer from them as to the state of all sorts of claims. They said “NO,” & you think they should say “YES, YES, YES, YES!!!!” In other words, appealing a denial: 1. This site has some great information on how to avoid a denial and what you can do to fight one. 2. Included on their site is the Health Insurance Laws and Benefits Tool which will provide specific information about your rights in different states. For example, you will want to know if there is an external or independent grievance system to appeal your plan’s decisions. In the case of NJ, which is the state I am fighting, the tool provided the following helpful information:
Does New Jersey require an external or independent grievance system to appeal your health plan’s unfavorable decisions? Yes, for all health plans.

On what grounds can you file your external grievance?
Investigational treatment appeal, medical necessity. What is the status of the external grievance panel’s decision?
Binding. External grievance systems allow you to take a dispute with your health plan to a doctor or review board unaffiliated with your health plan. Thus, both you and your health plan receive an impartial ruling on its decision to deny coverage of services or treatment. Additionally, you can file a complaint against your health insurer with your state’s department of insurance.
Additional Helpful Information and Resources 1. The message boards on lawyers.com are a great place to hit for information. I have found folks there helpful.
2. You many want to blog about your experience as you may get an unexpected response directly from your insurance company. I think there are pro’s and cons to blogging about your experience but it does provide a public face to your ordeal and allows you to chronicle exactly what has transpired.
3. If your cases is particularly shocking, do not hesitate to hit the local media.
4. If your claim has been denied by an external review panel, you may not have much luck suing but if there is no external review panel, you can and should also try Small Claims Court or other legal action. Further, even if your claim was denied by an external review board, you may have other options for suing, for example, due to their bad faith handling of a claim. And on that note, here is a great legal resource covering the topic.

Daniel Stone: LCA 2008 CfP now open

The linux.conf.au 2008 Call for PapersPresentations is now open. We're accepting submissions from now until July 20th, 2007; you'll be notified in early September of the paper committee's decision.

Go check out the announcement, and start thinking of cool talk ideas. Once you've got to that stage, be sure to read mbp's How to get a conference abstract accepted, and Mary's Getting a talk into linux.conf.au (not just because she's a co-chair of the paper committee).

This year, we've introduced one optional step: a video submission. If you think that you're a great speaker, and if only we could see you, we'd say yes instantly, then grab a camera, and convince us. :)

Also, if you're interested in running a mini-conf before the main conference, we're also taking proposals for mini-confs.

See you in Melbourne!

Bastian Venthur: 1 Kilobyte = 1000 24 bytes

Could you exactly say how big your hard disk has to be at least when the vendor claims it’s 500 Gigabytes big? Do you know how many bytes a file has when the filemanager says 2 Megabytes? Do you know what your DSL-provider actually means with 2 Megabit per second? Experienced users surely can since they know the meaning of “Kilobyte” depends on the context. Sometimes it’s 1000 bytes, sometimes it’s 1024. Non technical users will tend to assume that a 1 Kilobyte is 1000 bytes (which is correct, since k is the SI prefix for kilo) while users with technical background will tend to assume (depending on the context of course) it’s 1024. There is a solution for this ambiguity, but unfortunately it doesn’t come for free: First, it sounds really stupid (kibi-what?) and second it will add an extra character (kB -> kiB) and we all know how stuffed our 80 column terminals already are nowadays. If you have better arguments against the binary prefix notation please, join the discussion. Personally I’d find it very cool if we could use SI prefixes where we mean n * 10^3 and binary prefixes where we mean n * 2^10 in Debian consistently.

Antti-Juhani Kaijanaho: Benja on denotational semantics

My friend Benja Fallenstein got carried away in the comment section of my latest post on recursion and wrote a tutorial on how it all relates to denotational semantics. It’s a shame it is buried somewhere in the comments, so I am reposting the comment here with Benja’s permission. The tagline is, Denotational semantics tutorials. It s the new monad tutorials!
Benja Fallenstein writes: Having read and understood [the] entire post, I can now summarize Antti-Juhani s complaint in a way that programmers with no theoretical background will understand: The definition is an infinite recursion. Sure, it s self-referential, but since it recurses forever, it doesn t actually define what recursion is! :-) That said, I find it kind of a pity to introduce all this theory without talking about why it nicely models the real world. Antti-Juhani argues that this pretty much the definition of popularized science, but I have to admit that, as definitions go, I like recursion: see recursion better. :) So let me have a quick go. [UPDATE: Didn t turn out to be quick at all. This is, in fact, as long as Antti-Juhani s original post. Proceed at your own peril.] All of this comes from denotational semantics, which is concerned with what expressions in a programming language mean and which ones mean the same thing. For example, 7 denotes the number seven, 7+2 denotes the number nine, and 5+4 also denotes the number nine. Now, here s the knotty problem. If we have f(x) = if x = 0 then 1 else x*f(x-1) then f(4) denotes the number twenty-four, but what does f(-2) denote? So, denotational semantics introduces a new, special value, recurses forever. An expression of type integer either denotes an integer, or, like f(-2), it denotes recurses forever. Now, about these partial orders. (Reminder: A partial order says, for every pair (x,y) of elements of a certain set, that x is smaller than y, equal to y, larger than y, or incomparable to y.) Here is Benja s guide to what the partial orders of denotational semantics mean: Let s say that you write a program where, in one place, you can plug in either x or y. If you can write such a program that prints foo when you plug in x and prints bar when plug in y, then x and y are incomparable. If you can t do that, but you can write a program that prints foo when you plug in y, and recurses forever when you plug in x, then x is smaller than y. If every program you can write will do the same thing whether you plug in x or y, then x and y are equal. (We ignore details like out-of-memory errors and *how long* a program takes to do something.) Examples: - 5 and 7 are incomparable. Proof: if ___ == 5 then print foo else print bar . - f(-2) f(2). Proof: if ___ == 2 then print foo else print foo if you plug in f(-2), this will loop forever, if you plug in f(2), it ll print foo . - (5+2) = 7. Whatever program I write, it will do the same thing, no matter which of these expressions I plug in. Now, with expressions of type integer, the resulting partial order is: Recurses forever is smaller than everything else. All other values are incomparable. Recall from Antti-Juhani s post that the bottom element ( ) is defined to be the smallest element of a mathematical universe (if such a beast exists). Since recurses forever is smaller than everything else, it s the bottom element of this universe. That s what denotational semantics calls it. (Haskell, too.) Of course, this partial order is kind of boring (the technical term is flat ). It gets more interesting when we consider functions. In general, we can talk about functions from values of type S to values of type T, where we already know the partial orders of S and T. In particular, we can talk about functions from integers to integers. Now, if you can find an x and a program that prints foo when you plug in f(x) and bar if you plug in g(x), then you can write a program that prints foo when you plug in f, and bar when you plug in g. (Exercise! ;-) ) Further, denotational semantics wants applying a function to a parameter and then doing something with the result to be the *only* way you can get information about a function. No f.get_function_name, please. (If your programming language has that, you can t map the functions of your programming language 1:1 to the functions of denotational semantics.) By my rule above, this implies that f = g if and only if f(x) = g(x) for all x. Since formal theories can t have fuzzy stuff like my rule, denotational semantics takes this as the *definition* of the partial order on functions. The bottom element of this mathematical universe, then, is the function that always returns bottom, no matter what it is given or in other words, a function that recurses forever, no matter what parameter you pass to it. (Side note. Denotational semantics allows only monotone functions that is, if x = y, then f(x) = f(y) for all f, x, and y. That s an example of how all these definitions allow us to make formal statements about the real world. In the real world, if you can find a function f and a program that prints foo when given f(x) and bar when given f(y), then you have a program that prints foo when given x and bar when given y so if f(x) and f(y) are incomparable, then x and y must be incomparable, and the other way around, if x and y are comparable, then f(x) and f(y) must be comparable, too. (This reasoning doesn t exclude the case that x = y and f(x) >= f(y). If you really care, prove it yourself. :) ) This ends the side note.) Recall, now, Antti-Juhani s definition of recursion: An equation of the form x = some expression (which may contain x), interpreted as a recursive definition, defines x to be the smallest value satisfying this equation. The models constructed in denotational semantics have the property that for any equation of this form, the set of values satisfying it does have a smallest element, so x is well-defined no matter what the equation is. It s important to note that this does not mean that x has to be bottom, because there are equations to which bottom is not a solution. Let s look at a slightly simpler example than the one Antti-Juhani gave. f(x) = if x = 0 then 0 else f(x-1) We have f(0) = 1, but bottom(0) = bottom, so f can t be bottom. The equation has more than one solution, though. It is satisfied by a function that returns 0 for x >= 0 and returns bottom (recurses forever) for x 0; but it is also satisfied by a function that returns 0 for every input. And by an infinite number of functions that return 0 for some negative inputs and bottom for others. We want the first of these solutions, of course, because that s what we get if we interpret the equation as a computer program, and computer programs are what we re trying to model. But we re in luck: The first solution is smaller than all the other ones, because for all inputs, they either return the same value, or the solution we want returns bottom and the solution we don t want returns 0 (and bottom 0). The point of it all is, of course, that when we interpret an equation as a computer program, we always get the least value satisfying the equation (if we use a partial order that follows my rule, above). And that, my friend, is denotational semantics.

MJ Ray: STklos 0.95 - a Scheme compiler/interpreter

The aim of this implementation is to be fast as well as light. The implementation is based on an ad-hoc Virtual Machine. STklos can also be compiled as a library, so one can easily embed it in an application. This is a major version introducing support for the ScmPkg source packaging system.

David Welton: Information Asymmetry and IT Hiring

It appears as though Akerlof's "market for lemons" that Bruce Schneier wrote about has caught on. While hiring is certainly a case of information asymmetry like the "lemons market", there are some other factors at work: The Principal-agent problem: even once you've hired someone, there are some asymmetries at work of a different sort: your motives may not be the same as your employer's, and it may be difficult for the employer to monitor what you're doing. If you're digging ditches, it's pretty easy to see what you've done, and how well you've done it. If you're creating a complex system, on the other hand, it's much harder, even for an expert, to tell what sort of job you've done, let alone for a "pointy haired boss" with little knowledge of the domain at hand. The wikipedia article discusses different schemes and problems with attempting to align the interests of employee and employer. The curious may wonder why anyone hires anyone at all, rather than just having all work be a series of contracts between independant individuals, rather than companies and employees. Ronald Coase asked the same question a number of years ago, and determined that the answer lies in transaction costs - the subtle friction that permeates any real world exchange. Think about having to continuously search for potential contract workers, and bargain with them over prices. It's easier to employ someone, and be able to count on their work, at a steady rate, than to have to outsource important functions continuously and at variable prices. It's also probably cheaper in some ways because of people's tendency to be "risk averse" - they prefer the steady but stable job over a more variable, but higher paying income stream. As we've seen in recent years, as transaction costs have come down, it does become easier to outsource certain kinds of work, and we have seen more of it. Economics provides a fascinating lens through which to view the world of high tech and information goods, and the superficial overview that I've attained has certainly served me well. A good place to start, besides perusing wikipedia, is the book Information Rules by Hal Varian and Carl Shapiro.

Paul van Tilburg: Arrival

I have just arrived in Edinburgh. The flight was just fine. The weather is a bit foggy and cold (compared to NL), but it is exactly how I remember it. I was transported to MACS at the Heriot-Watt university. It’s weird to sit on my old working spot again. :-)

MJ Ray: When did foo(l) join the debian project?

In response to John Goerzen's question, I'd try the following steps: Check keyring.debian.org/changelog - this will give a near-definitive answer for all DDs joining since 19 Jan 1998. If that fails, check the web archive copies of the 1997 debian people page to find out when they first appear and which packages to check. Check as many package changelogs as possible on the package tracking system and the rest on the debian archive to find the earliest entries. (Update: for completeness, check the signature on the matching dsc and its key creation date.) Then look in their $HOME on master for the earliest timestamp. And finally, search list archives and the web for any welcome message (rare), the first use of their @debian.org address, or a signature where they claim to be a debian developer. Any other ways to guess the date?

Evan Prodromou: 23 Prairial CCXV

I'm listening to The Current on CBC and they're interviewing the product manager for Google Maps about the Street View feature. The question: "Couldn't this technology be used by terrorists?" Let's go ahead and answer this oft-repeated question once and for all: of course it could. Practically any technology or information source that's useful to the general public would be useful to terrorists. Terrorists benefit every day from self-service gas stations, sliced bread, walk/don't walk signs, and pocket dictionaries. All these advances, and many more, have helped terrorists in their daily lives and in their evil plans. They also help the rest of us. There are very few technologies or infrastructure improvements that are useful to Good People that aren't also useful to Bad People. It would probably hamper the work of terrorists if we tore up the public roads, forbade the sale and transport of household cooking oil, and mandated inconsistent and illegible spelling in all print publications. It would also cause the rest of us a lot of inconvenience and harm. Of course, the converse is not true: there are plenty of technologies that are only useful for doing very bad things. The question we should ask with any technology is, "Does it have enough general-purpose usefulness to offset possible misuses?" Rigging every railroad bridge in North America with dynamite and a convenient nearby plunger is an initiative that has very little utility for anyone with good intentions. Enhanced mapping tools? Probably not in the same class. We live in a world where evil folks use the tools of everyday living to take civilian lives. If we turn our technological society back to the Neolithic, it's not going to change that -- it's just going to take longer for people riding donkeys to come brain us with stone axes. I don't think it's worth it. tags:

Michal Čihař: Troubles on being popular

phpMyAdmin is quite popular tool and it attracts people who want to earn money on it. For long time Navicat company used phpMyAdmin name to propagate their completely different product, but this seems to be gone now (probably with help from Google, but I haven't receive reply from them, but short after my complain, all their ads abusing phpMyAdmin were gone). Today Marc spotted that somebody just stole our website added Google shopping cart and started to sell phpMyAdmin: Main stolen page screenshot Buy page screenshot Lets see how long will it take to get them down. PS: There is intentionally no link in this post, you can see URL on screenshot, if you really want. Update: It looks like hosting is very responsible on such problems, they just disabled this domain:
Hello, Thank-you for your e-mail enquiry. Please be advised that we have disabled site php-my-admin.awardspace.com. AWARDSPACE.COM provides legitimate web hosting services and has a ZERO tolerance policy towards these violations. We apologize for the inconvenience this has caused you. If you still have any concerns in regards this matter feel free to contact us. Best Regards, Harry AWARDSPACE Dedicated Support Team support@awardspace.com /"Your winning web hosting provider"/ http://www.awardspace.com

Antti-Juhani Kaijanaho: On recursion

Note: This entry has been edited a couple of times (and might be edited in the future) to remove errors. Thanks to Benja Fallenstein for critique. My previous post about recursion drew some comments. This is a topic that frequently confuses me, and there is a lot of confusion (some of it mine) in the blog post and its comments. On reflection, it seems prudent to examine what recursion really is. Consider the following recursive definition: 0 is an expression; if T is an expression, then sT is an expression; nothing is an expression that doesn’t have one of these two forms. Now, it is clear that 0 is an expression. It is equally clear that sssssK is not an expression. In some applications, it makes sense to consider infinite expressions like “…ssssss0“; that is, an infinite number of ss before the final 0, and in others it doesn’t. Is that infinite utterance and expression? It does have one of the forms given in the definitions, so it is not forbidden from being an expression, but neither is there anything in the definition requiring that it is. It is helpful to do this a bit more formally. Let us translate the self-referential definition into a set equation: The set of expressions is the set E that satisfies the equation

E = 0 ∪ se e ∈ E

But this definition is bogus! There are more than one set E that satisfies the equation, as remarked above, and thus there is no “the set E”! We need to fix the definition in a way that makes the set E unique. The key question is, do we want to regard the infinite utterance discussed above as an expression. It is simplest to just say “the set of expressions is the smallest set E that …” if we want it to not be an expression, and if we want it to be an expression we should say “the set of expressions is the largest set E that …” Let us make the following definitions:
Consider the set equation S = … S …, in which the set S is alone on the left-hand side and occurs at least once on the right-hand side. This equation is a recursive definition of the smallest set S satisfying this equation, and a corecursive definition of the largest set S satisfying this equation.
Thus, a definition like

E = 0 ∪ se e ∈ E

is not recursive because of its form; it is self-referential. By itself, it is an ambiguous and thus bogus definition. We use the words “recursive” and “corecursive” to indicate the intended method of disambiguation. A rather nice example of this can be seen in the treatment of algebraic data types in strict (ML-style) and nonstrict (Haskell-style) functional programming languages. Consider the declaration (using Haskell syntax)
data IntList = Nil   Cons Int IntList
This can be read as a set equation as follows:

IntList = Nil ∪ Cons n x n ∈ Int ∧ x ∈ IntList

Now, as a recursive definition, it is restricted to finite lists as found in ML, but as a corecursive definition, it also allows infinite lists as found in Haskell. (It unfortunately fails to address the question of bottom-terminated lists, which also can be found in Haskell.) As it happens, the technique is not limited to set definitions; but to generalise it, we need to discuss a bit what we mean by the terms “smallest” and “largest”. In a set context, a set is smaller than another set if it is the other’s subset. Notice how this makes the ordering partial, that is, there are sets that are not comparable (for example 1 and 2 ; neither is smaller than the other, but neither are they equal). A collection of sets does not necessarily have a “smallest” set (that is, one of the sets that is a subset of all the others). However, we can always find the lowest upper bound (”lub” or “join”) of a collection of sets as the union of the sets, and the greatest lower bound (”glb” or “meet”) as the intersection of the sets, and if the lub or glb is itself a member of the collection, it is the smallest or largest set of the collection. Haskellists will find things instantly familiar when I say that the smallest element of a mathematical universe (if it exists) is called bottom and is denoted by ⊥; somewhat less familiar will be that the greatest element (if it exists) is called top and is denoted by ⊤. A partial function is any function that needs not be defined everywhere. For example, f(x) = 1/x is a partial function on the reals (it is not defined for x = 0). We can form a partial ordering of (partial) functions having the same domain and codomain by specifying that f is smaller than g if f(x) = g(x) for all such x that f(x) is defined. Sometimes it will make sense to specify that f is smaller than g if f(x) is smaller than g(x) for all such x that f(x) is defined. Now, it happens that all collections of functions have a lub; and in particular, the partial function that is defined nowhere is the smallest function (the bottom function). Now, with this definition of “ordering” of functions we can apply the definitions of recursion and corecursion to functions. For example, consider f(x) = f(x) + 1. The bottom function (defined nowhere) qualifies, since undefined + 1 is undefined; thus it is the smallest solution to the equation and thus this equation is a recursive definition of bottom. However, consider f(x) = if x = 0 then 1 else x*f(x-1): any solution to this equation must have f(0) = 1 and thus the bottom function is disqualified. In fact, the smallest solution is the factorial function, and thus the equation is a recursive definition of factorial. In the comments to my previous entry, I was asked whether the Haskell definition “ones = 1 : ones” is recursive. Of course, the question in itself is nonsensical; whether it is a recursive definition or something else (such as corecursive) depends on what the programmer intends. I will interpret this question as whether the equation is a recursive definition of the intended result, the infinite list of all ones. First, observe that we can order Haskell lists (including the special “undefined” list) partially as follows: l1 is smaller than l2 if l1 is undefined, if they both are empty lists or if a) the first element of l1 is smaller than the first element of l2 and b) the tail (the list with the first element removed) of l1 is smaller than the tail of l2. The undefined list does not qualify as a solution for “ones = 1 : ones”. No finite list qualifies either. The infinite list of all ones does qualify, and it is the only solution; hence, the equation is a recursive definition of the infinite list of all ones; it is also a corecursive definition of the same list. Finally, let us consider the question that started it all: what should we make of the definition “recursion: see recursion”. First, note that a equation x = x admits all elements of the universe as a solution; hence, the proper reading of “recursion: see recursion” as a definition is that it is ambiguous and hence bad. It is a recursive definition of the bottom element of the universe (whatever that might be for a dictionary), and a corecursive definition of the top element of the universe (whatever that might be). In any case, it does not define recursion (unless of course, the concept of recursion is the smallest or the largest concept in the universe of concepts).

Next.

Previous.