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.
33
questions
0
votes
1
answer
21
views
Results of a Program After Call By Reference Vs. Call By Value-Result
I have a question that I am trying to work through. I have a program:
...
- 101
0
votes
1
answer
67
views
Can contiguous arrays be lazily evaluated?
Contiguous arrays with variable length, such as C++'s std::vector, have been a major sequential container for languages whose evaluation is eager. However, it has ...
- 335
1
vote
1
answer
61
views
Must the evaluation strategy for a language be specified in order to apply the Church-Rosser Theorem?
The Church-Rosser Theorem [0] states that the Lambda Calculus (LC) is
confluent: between a source expression S and target expression T, the
latter in normal form, for any given P, a sequence of ...
- 39
2
votes
1
answer
66
views
Is there a hierarchy of computational expressivity that is sensitive to evaluation strategies?
Various computational hierarchies describes the relative
expressivity of different classes of languages, machines, or other
models of computing, with the classic progression for Automata Theory
[0] ...
- 39
2
votes
1
answer
456
views
Is the term $(\lambda x.x)(y y)$ a normal form in call-by-value reduction strategy?
I am learning λ-calculus and I have some confusion about it.
Is the term $(\lambda x.x)(y y)$ a normal form in call by value reduction strategy? (where $y$ is a free variable)
From the wikipedia, it ...
- 275
0
votes
1
answer
124
views
Termination of Z combinator with call-by-value
I am trying to build my own λ-calculus interpreter. So far it supports both call-by-value and normal order.
I now want to try recursion via fixed points. The $Y$ combinator works with normal order, ...
- 103
3
votes
0
answers
74
views
Standardisation Theorem versus Leftmost reduction Theorem
According to Chris Hankin in his book (Lambda Calculus a Guide for Computer Scientists). A reduction sequence $\sigma: M_0 \to^{\Delta_0} M_1 \to^{\Delta_1}M_2 \to^{\Delta_2}\ldots $ is a standard ...
- 31
0
votes
0
answers
26
views
Database that contains timespans of cyber attacks in the web
for a project I need to evaluate a model, that tries to predict wether a certain cyber-attack (i.e. connection to a low level honeypot) is just a random access, a new attack-wave or an already known ...
- 1
0
votes
0
answers
28
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 ...
- 255
0
votes
1
answer
289
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 ...
- 103
0
votes
1
answer
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 ...
- 125
1
vote
0
answers
47
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. ...
- 125
0
votes
1
answer
40
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 ...
- 125
3
votes
1
answer
938
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 ...
- 131
1
vote
2
answers
304
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:
...
- 265
17
votes
2
answers
3k
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 ...
- 185
1
vote
0
answers
26
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 ...
- 111
3
votes
1
answer
494
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 ...
- 295
0
votes
2
answers
595
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
1
answer
106
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 ...
- 131
1
vote
0
answers
240
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:
...
- 385
0
votes
1
answer
150
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 ...
- 1
0
votes
0
answers
47
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:
...
- 123
4
votes
1
answer
149
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 ...
- 41
1
vote
0
answers
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.
- 41
0
votes
1
answer
199
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.
- 21
4
votes
1
answer
117
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:
...
user23039
7
votes
3
answers
3k
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 ...
- 173
2
votes
1
answer
187
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 ...
- 232
-1
votes
1
answer
265
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() {...
- 101
12
votes
1
answer
25k
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:
...
- 121
1
vote
2
answers
330
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 ...
- 223
6
votes
3
answers
14k
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 ...
- 233