Podcast #128: We chat with Kent C Dodds about why he loves React and discuss what life was like in the dark days before Git. Listen now.

Questions tagged [evaluation-strategies]

Evaluation strategies (or reduction strategies) are rules on how to evaluate programs. Common strategy choices include call-by-value (applicative order) vs. call-by-name (normal order) and eager (strict) vs. lazy.

Filter by
Sorted by
Tagged with
0
votes
0answers
32 views

Evaluation of function

Is this the right approach to the question or am I off-track? Function: let rec collect f = function | [] -> [] | x::xs -> f x @ collect f xs;; Question: ...
0
votes
0answers
26 views

Manage event programming under a stack-oriented language

I wonder how events, or more broadly reactive programming, could be managed in a simple stack-oriented language. For example, let's imagine a context where there is a button that displays a small ...
0
votes
1answer
42 views

Is “lazy evaluation” part of the compilation process or a run-time feature?

I'm studing the Clean functional programming language, and like other functional PL it uses Lazy Evaluation. The thing that I can't get is when a PL that using ...
0
votes
1answer
26 views

How to evaluate the learned prototypes for multivariate time-series (e.g. motion)?

Consider a method which finds prototypes for multivariate time-series (MTS) data, and is designed to find prototypes for each class of data. For example, the {walking} class consists of some slightly ...
1
vote
0answers
40 views

Why do reviewers always want to compare the method with deep learning baselines and Big data?

I work on the topics of sparse coding (SC) and dictionary learning (DL), in which classification is not the main goal, but the discriminative power of the representation is one of the concerns. ...
0
votes
1answer
31 views

How to show that i have significant improvements over the baselines?

I had review feedbacks regarding my recent publications and reviewers argued that the improvements are not significant over the baselines. I tried my classification algorithm on some image datasets ...
3
votes
1answer
590 views

How to use Latin hypercube sampling with fixed points?

I use Latin hypercube sampling to select what point to evaluate my function. As evaluations take a lot of time, I want to limit the time by adding already evaluated points. I thought about taking the ...
1
vote
2answers
247 views

Application of lambda function in Simply Typed Lambda Calculus

I'm just getting started with STLC (Simply Typed Lambda Calculus) and I'm trying to understand an evaluation rule I've been given in some lecture notes by my professor. What it says is the following: ...
14
votes
2answers
2k views

Is it possible for a stack-based programming language to be concurrent?

I have been reading about stack-based programming languages, such as FORTH and Cat, and it seems that given their nature, they can only execute one action at a time regardless of their paradigm (FORTH ...
1
vote
0answers
22 views

Is there a term for mixing deferred and eager evaluation?

I've written a model which utilises deferred evaluation for many aspects of its feature but in one instance of its use it is mixed with threaded eager evaluation for things that are expected to be ...
3
votes
1answer
208 views

Understanding Applicative Evaluation Order with the Z-Combinator

I am trying to understand how the Z-combinator (Y-combinator for applicative order languages) definition came about. As Python is applicative I am using Python for this. So I know Python's evaluation ...
0
votes
2answers
284 views

What are the drawbacks of Normalized Mutual Information clustering evaluation method?

What are the drawbacks of Normalized Mutual Information (NMI) clustering evaluation method? For evaluating what clustering algorithms, is the NMI evaluation method suitable?
2
votes
1answer
38 views

Call by value-return with void function [closed]

If I'm passing parameters as call by value-return and call a void function, will the local values within the function still be copied to the corresponding values in the caller function even though the ...
1
vote
0answers
135 views

How to evaluate is_empty for 2-tuple lists in Lambda calculus?

This question has been handled various ways, but let me show my case. I want to find out, if the given list is empty with these constraints: ...
0
votes
1answer
128 views

Strategy to create a testbed and gold standard

I need to create a correct evaluation of the method I'm proposing. The problem is that in the field I'm working on there is no benchmark that I can use for this purpose. On the other hand, my method ...
0
votes
0answers
34 views

Analysis of the reduction of a function using (outermost) graph-reduction

I want to determine the time and space complexity of the following functions: ...
4
votes
1answer
100 views

Playing to win strategy algorithm

Here is the game's setup: You're given a formula for a binary expression using and or not as the connectives. The connectives are combining many variables for which two players will assign truth ...
1
vote
0answers
34 views

Evaluation of Information extraction a task

I have to evaluate my information extraction program. I have to evaluate it by the expectation-driven way. I don't know what that means. I would appreciate if you could help me. Thx.
-1
votes
1answer
124 views

Meaning of “call by reference”

Can someone explain to me in a plain English what call by Reference mean ? I am having trouble to recognize a difference between "call by value" and "call by reference" Thank you.
4
votes
1answer
104 views

In what cases is graph rewriting not enough to avoid duplicate work?

As I understand, evaluating something like the following in normal order evaluation is inefficient due to duplicate work: ...
5
votes
3answers
2k views

Is Applicative-order and Normal-order evaluation model's definition contradictory as per sicp text book?

As per this explaination, it defines applicative and normal order evaluation in one form saying: This alternative "fully expand and then reduce" evaluation method is known as normal-order ...
2
votes
1answer
157 views

Conditionals with normal order evaluation

From what I've read, conditionals (like the cond statement in lisp) do not need to be primitive if normal order evaluation is used. Using lambda calculus and normal order evaluation, how can you ...
-1
votes
1answer
210 views

Where to learn about Short-circuit evaluation? [closed]

I would like to implement short circuit evaluation logic in my code. And I want to know about the full details how it works? Ex: function a() {return true;} function b() {return false;} function c(...
7
votes
1answer
13k views

Difference between normal-order and applicative-order evaluation

The language I'm learning is Scheme and I'm working on an exercise that gives this: ...
1
vote
2answers
145 views

Call‑by‑name will succeeds where call‑by‑value may fails: some example cases?

I've landed to SML pages, comparing call‑by‑name and call‑by‑value, asserting the former always succeed while the latter may fails. As this seems counter intuitive to me, I feel at least an example ...
6
votes
3answers
11k views

Call by value-result vs. call by reference?

From my Googling, it appears that call by value-result is similar to call by reference in that it changes values in the caller, but it's different in that the changes don't take place until the callee ...