A lazy evaluator

Henderson, Peter B.; Morris, James H.

doi:10.1145/800168.811543

Cited by 263 publications

(92 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is conceptually related to lazy evaluation (Henderson and Morris, 1976) known from some programming languages like Haskell. The term "lazy cryptography" is avoided in favour of "deferred cryptography" because cryptography itself is not weakened.…”

Section: Deferred Cryptographymentioning

confidence: 99%

Improved Security Performance for VANET Simulations

et al. 2016

View full text Add to dashboard Cite

Upcoming deployments of Vehicular Ad Hoc Networks (VANETs) in Europe are expected to sign and verify packets secured by cryptographic signatures by default. Thus, when VANET simulations are used for development and test of applications building upon vehicular communication, the overhead induced by security extensions to the ITS-G5 protocol stack shall not be neglected. This paper presents a standard compliant simulation model capable to handle secured messages. Beside its suitability for Hardware-in-the-Loop simulations employing secured communication, the model's major advantage is the minimisation of the simulation environment's performance penalty linked with cryptographic computations.

show abstract

Section: Deferred Cryptographymentioning

confidence: 99%

Improved Security Performance for VANET Simulations

et al. 2016

View full text Add to dashboard Cite

show abstract

“…Our running example is typical file processing: to read and print a file expanding all tabs 5 . Ideally, reading file data, tab expansion itself, and writing the result should be separated, so each can be replaced.…”

Section: Effectsmentioning

confidence: 99%

“…Since lazy evaluation corresponds to an implicit and stylized use of coroutines [5][6][7][8], it is natural to consider an explicit stylized use of coroutines. Such alternatives, historically known as generators or iterators, have indeed been used to structure programs using "pipelines" of producers and consumers [9] following Jackson's principles of program design [10].…”

Section: Introductionmentioning

confidence: 99%

Lazy v. Yield: Incremental, Linear Pretty-Printing

Kiselyov

Peyton-Jones

Sabry

2012

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. We propose a programming style for incremental stream processing based on typed simple generators. It promotes modularity and decoupling of producers and consumers just like lazy evaluation. Simple generators, however, expose the implicit suspension and resumption inherent in lazy evaluation as computational effects, and hence are robust in the presence of other effects. Simple generators let us accurately reason about memory consumption. To substantiate our claims we give a new solution to the notorious pretty-printing problem. Like earlier solutions, it is linear, backtracking-free and with bounded latency. It is also simpler to write and reason about, and is compatible with effects including IO, letting us read the source document from a file, and format it as we read.

show abstract

“…A more efficient solution-and indeed a traditional motivation for lazy evaluation [27,32]-is to construct the sequences lazily and to traverse them on demand. In the following generator, the data type sequence implements finite lazy sequences; the construction of the rest of the lazy sequence is delayed with a thunk of type unit -> sequence; and make sequence is defined as an accumulator-based flatten function: Unlike in the eager solution, the construction of the sequence in Lazy generator and the comparisons in same fringe are interleaved.…”

Section: A Lazy Traversalmentioning

confidence: 99%

On the dynamic extent of delimited continuations

Biernacki

Danvy

Shan

2005

Information Processing Letters

View full text Add to dashboard Cite

We show that breadth-first traversal exploits the difference between the static delimited-control operator shift (alias S) and the dynamic delimited-control operator control (alias F). For the last 15 years, this difference has been repeatedly mentioned in the literature but it has only been illustrated with one-line toy examples. Breadth-first traversal fills this vacuum.We also point out where static delimited continuations naturally give rise to the notion of control stack whereas dynamic delimited continuations can be made to account for a notion of 'control queue.'

show abstract

A lazy evaluator

Cited by 263 publications

References 4 publications

Improved Security Performance for VANET Simulations

Improved Security Performance for VANET Simulations

Lazy v. Yield: Incremental, Linear Pretty-Printing

On the dynamic extent of delimited continuations

Contact Info

Product

Resources

About