A Locally Nameless Representation for a Natural Semantics for Lazy Evaluation

2012 ◽  
pp. 105-119 ◽  
Author(s):  
Lidia Sánchez-Gil ◽  
Mercedes Hidalgo-Herrero ◽  
Yolanda Ortega-Mallén
Keyword(s):  
Lazy Evaluation

Efficient compilation of lazy evaluation

1984 ◽  
Vol 19 (6) ◽  
pp. 58-69 ◽  
Author(s):  
Thomas Johnsson
Keyword(s):  
Lazy Evaluation

BullFrog: Online Schema Evolution via Lazy Evaluation

2021 ◽  
Author(s):  
Souvik Bhattacherjee ◽  
Gang Liao ◽  
Michael Hicks ◽  
Daniel J. Abadi
Keyword(s):  
Schema Evolution ◽  
Lazy Evaluation

An operational semantics for parallel lazy evaluation

2000 ◽  
Vol 35 (9) ◽  
pp. 162-173 ◽  
Author(s):  
Clem Baker-Finch ◽  
David J. King ◽  
Phil Trinder
Keyword(s):  
Operational Semantics ◽  
Lazy Evaluation

AN OPERATIONAL SEMANTICS FOR THE PARALLEL LANGUAGE EDEN

2002 ◽  
Vol 12 (02) ◽  
pp. 211-228 ◽  
Author(s):  
MERCEDES HIDALGO-HERRERO ◽  
YOLANDA ORTEGA-MALLÉN
Keyword(s):  
Operational Semantics ◽  
Transition System ◽  
Lazy Evaluation ◽  
Parallel Language ◽  
Parallel Processes ◽  
System A ◽  
Independent Evaluation ◽  
Level Transition ◽  
Concurrent Algorithms ◽  
Main Thread

The functional parallel language Eden — suitable for the description of parallel and concurrent algorithms in a distributed setting — is an extension of Haskell with a set of coordination features. In this paper we present a formal operational semantics for the kernel of Eden, or more precisely, for a λ-calculus widened with explicit parallelism and potentially infinite communication channels. Eden overrides the lazy nature of Haskell on behalf of parallelism. This interplay between laziness and eagerness is accurately described by the semantics proposed here, which is based on Launchbury's natural semantics for lazy evaluation, and is expressed through a two-level transition system: a lower level for the local and independent evaluation of each process, and an upper one for the coordination between all the parallel processes in the system. As processes are created either under demand or in a speculative way, different scheduling strategies are possible — ranging from a minimal one that only allows the main thread to evolve, to a maximal one that evolves in parallel every active binding.

Lazy evaluation

2012 ◽  
pp. 124-138
Author(s):  
Graham Hutton
Keyword(s):  
Lazy Evaluation

scholarly journals Counter-based pseudorandom number generators for CORSIKA 8

2021 ◽  
Vol 251 ◽  
pp. 03039
Author(s):  
A. Augusto Alves ◽  
Anton Poctarev ◽  
Ralf Ulrich
Keyword(s):  
Secondary Particle ◽  
High Energy ◽  
Massively Parallel ◽  
Random Numbers ◽  
Ultra High Energy ◽  
Simulation Framework ◽  
Performance Measurements ◽  
Astroparticle Physics ◽  
Lazy Evaluation ◽  
High Quality

This document is devoted to the description of advances in the generation of high-quality random numbers for CORSIKA 8, which is being developed in modern C++17 and is designed to run on modern multi-thread processors and accelerators. CORSIKA 8 is a Monte Carlo simulation framework to model ultra-high energy secondary particle cascades in astroparticle physics. The aspects associated with the generation of high-quality random numbers on massively parallel platforms, like multi-core CPUs and GPUs, are reviewed and the deployment of counter-based engines using an innovative and multi-thread friendly API are described. The API is based on iterators providing a very well known access mechanism in C++, and also supports lazy evaluation. Moreover, an upgraded version of the Squares algorithm with highly efficient internal 128 as well as 256 bit counters is presented in this context. Performance measurements are provided, as well as comparisons with conventional designs are given. Finally, the integration into CORSIKA 8 is commented.

Sign in / Sign up

Export Citation Format

Share Document