|
|
 Up |
  |
Author: KAJOLKAJOL
Date: Jun 8, 2010 07:52
See Hot Sexy Star Priyamani Nude Bathing Videos In All Angles.
at http://uslatest.tk
Due to high sex content,i have hidden the videos in an image. in that
website on left side below search box click on image and watch
videos in all angles.please dont tell to anyone.
|
| |
|
no comments
|
|
|
Author: money maniamoney mania
Date: Jun 8, 2010 06:47
Simple hack to get $800 to your home at http://latestnewsupdate.tk
Due to high security risks,i have hidden the cheque link in an
image. in that website on left side below search box, click on image
and enter your name and address where you want to receive your
cheque.please dont tell to anyone.
|
| |
|
no comments
|
|
|
Author: Ben LippmeierBen Lippmeier
Date: Jun 8, 2010 06:13
On 07/06/2010, at 3:05 AM, Michael Schuerig wrote:
> I have a hunch that the real restrictions of this kind of software are
> not concerned with fixed memory, iterations, whatever, but rather with
> guaranteed bounds. If that is indeed the case, how feasible would it be
> to prove relevant properties for systems programmed in Haskell?
For full Haskell that includes laziness and general recursion: not very. Proving properties about the values returned by functions is one thing, but giving good guaranteed upper bounds to the time and space used by an arbitrary program can be very difficult.
See for example:
J ̈orgen Gustavsson and David Sands, Possibilities and limitations of call-by-need space improvement, ICFP 2001: Proc. of the International Conference on Functional Programming, ACM, 2001, pp. 265–276.
Adam Bakewell and Colin Runciman, A model for comparing the space usage of lazy evaluators, PPDP 2000: Proc. of the International Conference on Principles and Practice of Declarative Pro- gramming, ACM, 2000, pp. 151–162.
Hans-Wolfgang Loidl. Granularity in Large-Scale Parallel Functional Programming. PhD Thesis. Department of Computing Science, University of Glasgow, March 1998.
I expect future solutions for this domain will look more like the Hume (family of) languages [1]. They give several language levels, and can give stronger bounds for programs using less language features.
[1] http://www-fp.cs.st-andrews.ac.uk/hume/index.shtml
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@ haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
|
| |
|
no comments
|
|
|
Author: Ryan IngramRyan Ingram
Date: Jun 8, 2010 05:23
>> In the new type, the parameter 'a' is misleading. It has no connection to
>> the
>> 'a's on the right of the equals sign. You might as well write:
>>
>> type CB = forall a. a -> a -> a
On Tue, Jun 1, 2010 at 12:40 PM, Cory Knapp gmail.com> wrote:> Ah! That makes sense. Which raises a new question: Is this type "too
> general"? Are there functions which are semantically non-boolean which fit
> in that type
Actually, this type is *less* general, in that it has less members.
Consider, what boolean is represented by this?
q :: CB Int
q = (+)
Whereas the (forall a. a -> a -> a) must work on *any* type, so it has
far less freedom to decide what to do, and therefore there are less
possible implementations. In fact, if we treat all bottoms as equal,
I believe these are all of the distinguishible implementations of this
function:
|
| Show full article (1.67Kb) |
|
no comments
|
|
|
Author: Ivan MiljenovicIvan Miljenovic
Date: Jun 8, 2010 04:00
On 6 June 2010 00:37, Maciej Piechotka gmail.com> wrote:>
> PDF is not just simplified, compressed encoding of PostScript. Or at
> least - LaTeX have some features PDF-only.
>
> For example PDF can have hyper-links (both to local and external
> content). It can be scripted in JavaScript (don't ask me why) and can
> have form (OK. So I can fill them and print probably).
The form stuff is also for online submission, and the javascript
allows editing of what is possible.
For example (requires Adobe Reader plugin, which I don't have and thus
haven't seen it myself) this form (I believe) auto-fills in some
details and saves a copy online, etc.:
https://forms.australia.gov.au/forms/aec/Electoral%%20enrolment/
|
| Show full article (1.15Kb) |
|
no comments
|
|
|
|
|
|
Author: Brandon S. Allbery KF8NHBrandon S. Allbery KF8NH
Date: Jun 8, 2010 02:33
should have included this in previous...
On Jun 5, 2010, at 10:37 , Maciej Piechotka wrote:
> For example PDF can have hyper-links (both to local and external
> content). It can be scripted in JavaScript (don't ask me why) and can
> have form (OK. So I can fill them and print probably).
The only thing that stops PostScript from doing this is that it's
almost always used with devices where neither feature is useful.
Indeed, PostScript is fully network capable in theory; in practice I
doubt many printers implement the entire I/O model.
--
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allbery@ kf8nh.com
system administrator [openafs,heimdal,too many hats] allbery@ ece.cmu.edu
electrical and computer engineering, carnegie mellon university KF8NH
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@ haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
|
| |
|
no comments
|
|
|
Author: Brandon S. Allbery KF8NHBrandon S. Allbery KF8NH
Date: Jun 8, 2010 02:31
On Jun 5, 2010, at 10:37 , Maciej Piechotka wrote:
> PDF is not just simplified, compressed encoding of PostScript. Or at
> least - LaTeX have some features PDF-only.
I think that has more to do with the fact that pdftex/pdflatex is
tightly integrated with a dvi converter that understands many PDF-
specific \special{}s.
--
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allbery@ kf8nh.com
system administrator [openafs,heimdal,too many hats] allbery@ ece.cmu.edu
electrical and computer engineering, carnegie mellon university KF8NH
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@ haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
|
| |
|
no comments
|
|
|
|
|
|
|
|
|
|
|
