Results 101 to 110 of about 230,472 (297)
Towards sharing in lazy computation systems [PDF]
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, Matthias Mann
core
Experiments and thermophysical simulations were conducted to investigate the electron beam powder bed fusion electron beam (PBF‐EB/M) process for the γ′‐strengthened nickel‐based superalloy Inconel 738LC. The results demonstrate the impact of process‐induced microstructural variations on high‐temperature mechanical behavior, providing a basis for ...
Jan Niklas Petenati +11 more
wiley +1 more source
Map Calculus in GIS: a proposal and demonstration [PDF]
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
New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design
This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare +5 more
wiley +1 more source
Correctness of copy in calculi with letrec, case and constructors [PDF]
Call-by-need lambda calculi with letrec provide a rewritingbased operational semantics for (lazy) call-by-name functional languages. These calculi model the sharing behavior during evaluation more closely than let-based calculi that use a fixpoint ...
Schmidt-Schauß, Manfred
core
Topological Representation of the Lambda-Calculus
The [lambda]-calculus can be represented topologically by assigning certain spaces to the types and certain continuous maps to the terms. Using a recent result from category theory, the usual calculus of [lambda]-conversion is shown to be deductively ...
Steven Awodey (3881575)
core +1 more source
Standardization of a Call-By-Value Lambda-Calculus [PDF]
We study an extension of Plotkin's call-by-value lambda-calculus by means of two commutation rules (sigma-reductions). Recently, it has been proved that this extended calculus provides elegant characterizations of many semantic properties, as for example
Paolini, Luca Luigi +4 more
core +1 more source
The OntOMat ontology establishes a structured framework for polymer matrix fiber reinforced composite materials, integrating manufacturing processes, characterization methods, and multiscale design through the VDI/VDE 3682 formalized process description standard.
Nicolas Christ +19 more
wiley +1 more source
On generic context lemmas for lambda calculi with sharing [PDF]
This paper proves several generic variants of context lemmas and thus contributes to improving the tools to develop observational semantics that is based on a reduction semantics for a language.
Sabel, David +3 more
core
Deep‐UV (258 nm) femtosecond pulses enable uniform amorphous silicon writing on Si(100)/(111) with a six‐fold larger fluence amorphization window than NIR methods. Optimized fluence and overlap yield 20–45 nm uniform and continuous amorphous layers. Microscopy shows sharp interfaces, and real‐time reflectivity reveals nanosecond melt–resolidification ...
Wissal Benali +5 more
wiley +1 more source

