Lambda the Ultimate

Do you mean "From Shift and Reset to Polarized Linear Logic" on the home page?
Also where does it say how to put links in these pages?

Standard html links should do the trick. Enter the following:


<a href='http://lambda-the-ultimate.org/'>Text for Link</a>


Resulting in:


Text for Link

As for looking up past discussions, there's the search facility on this site, and the all-knowing google. In addition, I try to keep my archive indexes relatively up to date, where I have:

• LtU Topic Index Sorted by Date
• LtU Topic Index Sorted by Topic
• LtU Index of Post Authors
• Zipped LtU Archive

The last one's for those that think SED and AWK are the last word in search technology. :-)

margin-left:50.95pt;line-height:15.6pt'> font-family:"Trebuchet MS";mso-bidi-font-family:Arial'>You know, one of the
most elegant solutions I have ever seen which cleanly deals with side-effects
is to simply make a distinction between functions (no side-effects) and
procedures (may have side-effects). Functions may use other functions, and procedures
may use other functions or procedures. font-family:"Trebuchet MS";mso-bidi-font-family:Arial'>



Oddly enough, you can formalize this approach href="http://citeseer.ist.psu.edu/653507.html">using modal logic.



There is no escape from crazy theory. :)

Actually this is a button push error! But as long as it is here what do you think? The quote is due to neelk.

This approach is discussed here.

Perhaps the modal logic idea suggested here is a key to sorting this out. What is properly impreative and what is properly functional. Where do the "effects" (ie side effects) belong. In a modal logic view the effects and their representation (ie a situation) provides a frame for the purely analytic (ie functional)

As "purests" say programming is really logic. But might it not be modal logic. Modal logics account for external effects such as errors, information, the results of actions, etc that can only be represented modally.

See for example the pages: href="http://en.wikipedia.org/wiki/Hybrid_logic">wikipedia: Hybrid logic style="mso-spacerun: yes"> and Hybrid
logic page

Oddly enough, you can formalize this approach using modal logic.

Oddly enough, you can formalize (S4) modal logic proofs with monads.

(Curry-Howard ho! For the CH uninitiated, this means essentially that terms that would have modal types are monadic functional programs which is relevant both for FP and LP.)

I mean discussions of Kanren, Schelog, papers mentioned that were previously discussed etc.

Part of my motivation is to get definitions. Does determinate mean one answer, and nondeterminate several answers? Likewise "data flow variables" vs "true logical variables". Can a nondeterminate fact or variable be a modal variable (ie one that can change during a deduction)

Deterministic logic programming means programming in a logic language with no nondeterministic choice operator. So there is at most one solution to each query. Nondeterministic logic programming has a nondeterministic choice operator. So there can be any number of solutions to a query (zero, one, or more). (There are two kinds of nondeterministic choice operator: don't care, which selects exactly one alternative, and don't know, which searches over all possible alternatives. The above definition and chapter 9 of CTM both use a don't know operator.)

A dataflow variable is a single-assignment variable that causes any operation that uses the variable to wait until it is bound. A logic variable is a variable that can be bound to exactly one value; it is a basic part of the unification operation. A logic variable can be used as a dataflow variable.