Questions tagged [lambda-calculus]
The lambda-calculus tag has no summary.
11 questions
-1
votes
1
answer
99
views
Appropriate base type for simply typed lambda calculus
Given the following hypothetical programming language:
Intended for practical programming
A simply typed lambda calculus (STLC)
All objects are functions, based on Church encodings
I am aware that ...
- 107
1
vote
1
answer
402
views
Generating a Beta Reduced Lambda Expression in Java
Good day, I'm a beginner in Java and I was wondering if, in Java, I'm able to do a beta reduction with a given lambda expression in Java. Basically lambda reduction is like this:
1.)
Expression : (...
- 19
1
vote
1
answer
510
views
Which Algorithm Approach Should I Take to Generate Lambda Expressions in Java?
Good day, I'm trying to find a way to program a lambda expression generator in java with this context-free grammar, and I would want to ask ; what would be the best way to tackle this problem and be ...
0
votes
2
answers
4k
views
Lambda calculus: Call by value / Call by name (lazy)
Having difficulties deciding which rules to apply on by value / by name evaulation.
Say I have:
(λz.zz)(λb.b)
And I want to evaluate according to call by valute, will the next step be
(λz.z)(λb.b)
...
- 3
3
votes
2
answers
546
views
What is the equivalent of The Little Lisper project in Haskell?
In the book The Little Lisper, you implement a minimal Scheme in 10 Chapters that is capable of interpreting any chapter in the book.
To me it seems you could do the same for a 'minimal subset of a ...
- 4,849
14
votes
2
answers
7k
views
What is the relationship between lambda calculus and programming languages? [closed]
I am starting my first year (in college) in Computer Science next year and I write mostly in C (if that is to matter). I have tried searching but most of what I find assumes knowledge of lambda ...
- 691
9
votes
3
answers
12k
views
Lambda expressions with no parameters in Haskell and / or lambda calculus
In eager languages like Scheme and Python, you can use a lambda expression without parameters to delay evaluation, e.g. in Scheme (Chicken Scheme):
#;1> (define (make-thunk x) (lambda () (+ x 1)))
...
- 19.8k
11
votes
1
answer
766
views
What Is λ-calculus essentially?
I have what I would call a philosophical question about λ-calculus.
When you explore λ-calculus you will be surprised to see all the things that you can do there. You can define integers, arithmetic ...
- 1,146
2
votes
1
answer
300
views
Notation/Meta Language To Express An Algorithm
I need to learn a notational language, so I can express and possibly prove the correctness of what I believe to be a complicated algorithm that distributes a credit adjustment across multiple water ...
- 699
2
votes
2
answers
645
views
General recursion to tail-recursion
Is it theoretically possible to transform every kind of general-recursion into tail-recursion? Are they equivalent for example from a lambda-calculus point of view? That's a debate between me and an ...
- 121
3
votes
3
answers
2k
views
If Scheme is untyped, how can it have numbers and lists?
Scheme is said to be just an extension of the Untyped Lambda Calculus (correct me if I am wrong). If that is the case, how can it have Lists and Numbers? Those, to me, look like 2 base types. So I'd ...
- 5,860