Results 11 to 20 of about 13,083 (112)
On the enumeration of closures and environments with an application to random generation [PDF]
, 2019 Environments and closures are two of the main ingredients of evaluation in lambda-calculus. A closure is a pair consisting of a lambda-term and an environment, whereas an environment is a list of lambda-terms assigned to free variables.
Bendkowski, Maciej, Lescanne, Pierre
core +3 more sources
Functional Programming and Lambda Calculus [PDF]
, 1990 Contains fulltext : 13246.pdf (Publisher’s version ) (Open Access)
openaire +2 more sources
Map Calculus in GIS: a proposal and demonstration [PDF]
, 2004 This paper provides a new representation for fields (continuous surfaces) in Geographical Information Systems (GIS), based on the notion of spatial functions and their combinations.
Haklay, M
core +1 more source
A Lambda Term Representation Inspired by Linear Ordered Logic [PDF]
, 2011 We introduce a new nameless representation of lambda terms inspired by ordered logic. At a lambda abstraction, number and relative position of all occurrences of the bound variable are stored, and application carries the additional information where to ...
Amal Ahmed +27 more
core +6 more sources
(Leftmost-Outermost) Beta Reduction is Invariant, Indeed [PDF]
, 2015 Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is lambda-calculus a reasonable machine?
Accattoli, Beniamino, Lago, Ugo Dal
core +5 more sources
Supervised data extraction from transformer representation of Lambda-terms
Радіоелектронні і комп'ютерні системиThe object of this research is the process of compiler optimization, as it is essential in modern software development, particularly in functional programming languages like Lambda Calculus.
Oleksandr Deineha
doaj +1 more source
Counting and Generating Terms in the Binary Lambda Calculus (Extended version) [PDF]
, 2014 In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences.
Grygiel, Katarzyna, Lescanne, Pierre
core +7 more sources
A lambda calculus for quantum computation with classical control
, 2004 The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the first author's work on quantum flow-charts.
A. Tonder +8 more
core +3 more sources
A correspondence between rooted planar maps and normal planar lambda terms [PDF]
, 2015 A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no beta-redexes ...
Giorgetti, Alain, Zeilberger, Noam
core +5 more sources
Towards sharing in lazy computation systems [PDF]
, 2004 Work on proving congruence of bisimulation in functional programming languages often refers to [How89,How96], where Howe gave a highly general account on this topic in terms of so-called lazy computation systems .
Mann, Matthias
core