Results 11 to 20 of about 2,457 (170)
Several types of types in programming languages [PDF]
, 2015 Types are an important part of any modern programming language, but we often forget that the concept of type we understand nowadays is not the same it was perceived in the sixties. Moreover, we conflate the concept of "type" in programming languages with
A Church +19 more
core +5 more sources
Chemical concrete machine [PDF]
, 2013 The chemical concrete machine is a graph rewriting system which uses only local moves (rewrites), seen as chemical reactions involving molecules which are graphs made up by 4 trivalent nodes.
Buliga, Marius
core +2 more sources
Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative [PDF]
, 2005 We answer Klop and de Vrijer's question whether adding surjective-pairing axioms to the extensional lambda calculus yields a conservative extension. The answer is positive. As a byproduct we obtain a "syntactic" proof that the extensional lambda calculus
Stoevring, Kristian
core +7 more sources
Combinatory Logic and Lambda Calculus Are Equal, Algebraically
, 2023 It is well-known that extensional lambda calculus is equivalent to extensional combinatory logic. In this paper we describe a formalisation of this fact in Cubical Agda. The distinguishing features of our formalisation are the following: (i) Both languages are defined as generalised algebraic theories, the syntaxes are intrinsically typed and ...
Altenkirch, Thorsten +3 more
openaire +2 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
Termination of rewrite relations on $\lambda$-terms based on Girard's notion of reducibility [PDF]
, 2015 In this paper, we show how to extend the notion of reducibility introduced by Girard for proving the termination of $\beta$-reduction in the polymorphic $\lambda$-calculus, to prove the termination of various kinds of rewrite relations on $\lambda$-terms,
Blanqui, Frédéric
core +4 more sources
Photon Avalanching Nanoparticles: The Next Generation of Upconverting Nanomaterials?
Advanced Functional Materials, EarlyView.This Perspective outlines the mechanistic foundations that enable photon‐avalanche (PA) behavior in lanthanide nanomaterials and contrasts them with emerging application spaces and forward‐looking design strategies. By bridging threshold engineering, energy‐transfer dynamics, and materials engineering, we provide a coherent roadmap for advancing the ...
Kimoon Lee +7 more
wiley +1 more source
, 2014 Zipper logic is a graph rewrite system, consisting in only local rewrites on a class of zipper graphs. Connections with the chemlambda artificial chemistry and with knot diagrammatics based computation are explored in the article.Comment: 16 pages, 24 ...
Buliga, Marius
core +2 more sources
A new coinductive confluence proof for infinitary lambda calculus
, 2020 We present a new and formal coinductive proof of confluence and normalisation of B\"ohm reduction in infinitary lambda calculus. The proof is simpler than previous proofs of this result.
Czajka, Łukasz
core +1 more source
Unlocking Photodetection Mode Switching from a Simple Lateral Design
Advanced Functional Materials, EarlyView.A simple lateral 2D perovskite photodetector capable of switching among transient, continuous, and dual transient/continuous photoresponse modes is achieved by integrating photoconductive effects with capacitive coupling from the SiO2/Si substrate. Such light‐programmable photodetection mode switching enables triple‐channel information transmission and
Zijun (June) Yong +10 more
wiley +1 more source