Lambda the Ultimate

Happy New Year!

I just found that I am again reinventing a wheel, this time it is delay construct featured in ECLiPSe.
Quick searching revealed that similar constructs are available in various PLs (freeze in Prolog-II, when in NU-Prolog, block in SICStus, bind hook(?) in ESP, committed choice/guards in other PLs).

Is there a survey of these mechanizms out there, or the only way to learn the differences between them is to read the manuals of all these PLs?

Any help is appreciated.

Dear LtU,

My google search didn't answer my doubts so I am posting here my question.

When we see a program, especially in imperative languages, we are often very fast in determining his computational complexity. Other times the same job is very hard.
My question is about the logic process that we follow in determining the computational complexity of a program/function.
(Of course i mean the complexity of the worst case only).
I am searching for somewhat very similar to the Hoare Logic.
A sort of formal logical system for derive judgments like P \in O(n^2) ... where n is the length of the Input.

This system should make clear the informal steps we use every days in determining the complexity of a function (especially in imp. languages).

I don't know if Hoare Logic can be directly used to this purposed. Maybe it's possible and we don't need a different formal system.

Thanks for any help.

Matteo

Brief Announcement: Secondlife(.com) now has an LTU-equivalent discussion group "Lambda The Ultimate"
Enrollment is free and open to all.

Hi,

I just spent the last semester learning about category theory and concurrency , and I'm still confused by the whole thing.

But I put together my notes in an effort to practice my writing and straighten out some of my thinking, so I figured I'd post them here to see if they'd interest anyone.
There are definitely a lot of 'not-quite-right' details inside.