Results 241 to 250 of about 31,361 (278)
Some of the next articles are maybe not open access.
Perpetual reductions in \(\lambda\)-calculus
Information and Computation, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
van Raamsdonk, F. +3 more
openaire +2 more sources
2018
The λ-calculus is, at heart, a simple notation for functions and application. The main ideas are applying a function to an argument and forming functions by abstraction. The syntax of basic λ-calculus is quite sparse, making it an elegant, focused notation for representing functions. Functions and arguments are on a par with one another.
Alama, Jesse, Korbmacher, J.
openaire +1 more source
The λ-calculus is, at heart, a simple notation for functions and application. The main ideas are applying a function to an argument and forming functions by abstraction. The syntax of basic λ-calculus is quite sparse, making it an elegant, focused notation for representing functions. Functions and arguments are on a par with one another.
Alama, Jesse, Korbmacher, J.
openaire +1 more source
Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 2003
In this short and elegant article, the \(\lambda Y\) calculus, which extends the simply typed \(\lambda\)-calculus by the fixed-point combinator \(Y\) of type \((A \to A) \to A\) for any type \(A\), is investigated. The following theorems are shown: (1) Higher-type fixed-point combinators are not definable from lower-type fixed-point combinators.
openaire +1 more source
In this short and elegant article, the \(\lambda Y\) calculus, which extends the simply typed \(\lambda\)-calculus by the fixed-point combinator \(Y\) of type \((A \to A) \to A\) for any type \(A\), is investigated. The following theorems are shown: (1) Higher-type fixed-point combinators are not definable from lower-type fixed-point combinators.
openaire +1 more source
Lambda-calculus, combinators and applicative computational technologies
Cognitive Systems Research, 2022Larisa Yu Ismailova +1 more
exaly
Strict intersection types for the Lambda Calculus
ACM Computing Surveys, 2011Steffen van Bakel
exaly