Results 11 to 20 of about 13,265 (227)
Program Equivalence in an Untyped, Call-by-value Lambda Calculus with Uncurried Recursive Functions
CoRR, 2022 Submitted to the Journal of Logical and Algebraic Methods in ...
Dániel Horpácsi +2 more
openaire +2 more sources
Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 For the lambda-calculus with letrec we develop an optimisation, which is based on the contraction of a certain class of 'future' (also: virtual) redexes.
Jan Rochel, Clemens Grabmayer
doaj +1 more source
, 2023 Over the last decades, deep neural networks based-models became the dominant paradigm in machine learning. Further, the use of artificial neural networks in symbolic learning has been seen as increasingly relevant recently. To study the capabilities of neural networks in the symbolic AI domain, researchers have explored the ability of deep neural ...
Flach, João +2 more
openaire +2 more sources
First Class Call Stacks: Exploring Head Reduction [PDF]
, 2016 Weak-head normalization is inconsistent with functional extensionality in the call-by-name $\lambda$-calculus. We explore this problem from a new angle via the conflict between extensionality and effects.
Ariola, Zena M. +2 more
core +2 more sources
Lazy Evaluation and Delimited Control [PDF]
, 2010 The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics.
Amr Sabry +7 more
core +1 more source
Functional Programming and Lambda Calculus [PDF]
, 1990 Contains fulltext : 13246.pdf (Publisher’s version ) (Open Access)
openaire +2 more sources
The exp-log normal form of types [PDF]
, 2016 Lambda calculi with algebraic data types lie at the core of functional programming languages and proof assistants, but conceal at least two fundamental theoretical problems already in the presence of the simplest non-trivial data type, the sum type ...
Ahmad A. +5 more
core +4 more sources
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
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
Normalization by Evaluation in the Delay Monad: A Case Study for Coinduction via Copatterns and Sized Types [PDF]
, 2014 In this paper, we present an Agda formalization of a normalizer for simply-typed lambda terms. The normalizer consists of two coinductively defined functions in the delay monad: One is a standard evaluator of lambda terms to closures, the other a type ...
Abel, Andreas, Chapman, James
core +2 more sources