Re: Timing Curry programs

From: Michael Hanus <mh_at_informatik.uni-kiel.de>
Date: Fri, 20 Oct 2017 10:02:13 +0200

On 10/20/2017 12:15 AM, James Koppel wrote:
> (I do prefer an answer for KiCS2 over PAKCS, because I have the
> understanding that KiCS2 is faster.)

You have to be careful. You are right that KiCS2 is generally faster,
but this depends on the kind of applications. It is much faster for
purely deterministic computations, but for non-deterministic computations
it might not be the case. Since KiCS2 offer much more flexible
evaluation strategies, this comes with some cost. There are cases
where non-determinism is duplicated (due to the combination of laziness
and non-determinism) so that you might get an exponential increase
in some computations. See

http://drops.dagstuhl.de/opus/volltexte/2012/3616/

for a discussion (and partial solution).

Best regards,

Michael

> On Thu, Oct 19, 2017 at 6:15 PM, James Koppel <jkoppel_at_mit.edu
> <mailto:jkoppel_at_mit.edu>> wrote:
> =

> How do time Curry programs? I'm looking through the KiCS2
> documentation, and I can't find any way to get the current system
> time (ifI want to time it internally), nor accept a command-line
> argument (if I want to use the time command).
> =

> I want to do this because, I have a new approach to implementing
> direct-style nondeterminism in imperative languages, and I'd like to
> compare to the "built-in" nondeterminism of Curry.
> =

> Sincerely,
> James Koppel
> MIT CSAIL

_______________________________________________
curry mailing list
curry_at_lists.rwth-aachen.de
https://mailman.rwth-aachen.de/mailman/listinfo/curry
Received on Fr Okt 20 2017 - 11:31:30 CEST

This archive was generated by hypermail 2.3.0 : Sa Dez 07 2019 - 07:15:11 CET