Results 1  10
of
200
A Lazy List Implementation in Squeak
"... conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. A Lazy List Implementation in Squeak ..."
Abstract
 Add to MetaCart
conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. A Lazy List Implementation in Squeak
Lazy List Comprehension in Logic Programming
"... The pure prolog evaluation of a goal yields a list of answers, but the tools provided for manipulating these structures are very poor. We discuss augmenting pure prolog with a list comprehension construct that offers the possibility of referring to the finite or infinite list of answers produced. Th ..."
Abstract
 Add to MetaCart
The pure prolog evaluation of a goal yields a list of answers, but the tools provided for manipulating these structures are very poor. We discuss augmenting pure prolog with a list comprehension construct that offers the possibility of referring to the finite or infinite list of answers produced
$\lambda$Calculus with Lazy ListsExtended Abstract
"... Into Acalculus we introduce lazy lsts $\tilde{a} $ whose naive meaning is an infinite tit consisting of variables, ($a_{0}, $ $a_{1} $ , a2, $\ldots$). It is shown that there exist maps which form aGalois connection ffom Parigotâ€™s $\mathrm{A}/\mathrm{i}$calculus to the Acalculus with lazy list. T ..."
Abstract
 Add to MetaCart
Into Acalculus we introduce lazy lsts $\tilde{a} $ whose naive meaning is an infinite tit consisting of variables, ($a_{0}, $ $a_{1} $ , a2, $\ldots$). It is shown that there exist maps which form aGalois connection ffom Parigotâ€™s $\mathrm{A}/\mathrm{i}$calculus to the Acalculus with lazy list
Lazy Wheel Sieves and Spirals of Primes
, 1997
"... This article describes functional variants of the wheel sieve that enumerate all primes as a lazy list. 2 A standard solution ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This article describes functional variants of the wheel sieve that enumerate all primes as a lazy list. 2 A standard solution
Why functional programming matters
 The Computer Journal
, 1989
"... As software becomes more and more complex, it is more and more important to structure it well. Wellstructured software is easy to write, easy to debug, and provides a collection of modules that can be reused to reduce future programming costs. Conventional languages place conceptual limits on the ..."
Abstract

Cited by 328 (3 self)
 Add to MetaCart
on the way problems can be modularised. Functional languages push those limits back. In this paper weshow that two features of functional languages in particular, higherorder functions and lazy evaluation, can contribute greatly to modularity. As examples, we manipulate lists and trees, program several
Abstract Lazy Functional Programming in Java
"... In this paper, we show how lazy functional programming techniques can be used within the Java programming language. We provide Java implementations of classic examples of lazy lists, such as the Sieve of Eratosthenes, the Eight Queens Problem, and naturallanguage parsing. We discuss how well these ..."
Abstract
 Add to MetaCart
In this paper, we show how lazy functional programming techniques can be used within the Java programming language. We provide Java implementations of classic examples of lazy lists, such as the Sieve of Eratosthenes, the Eight Queens Problem, and naturallanguage parsing. We discuss how well
Functional Data Structures
, 1996
"... this paper. Note that the cons operation supplied by this library is strict, not lazy. In fact, the only lazy operations in this library are ++ (infix append) and reverse. 2 FIFO Queues Stacks and queues are usually the first two data structures studied by beginning computer science students. The ty ..."
Abstract

Cited by 283 (4 self)
 Add to MetaCart
this paper. Note that the cons operation supplied by this library is strict, not lazy. In fact, the only lazy operations in this library are ++ (infix append) and reverse. 2 FIFO Queues Stacks and queues are usually the first two data structures studied by beginning computer science students
An Iterative Powerdomain Construction
 In Draft Proceedings of the 1989 Glasgow Workshop on Functional Programming
, 1989
"... A finite domain for the abstract interpretation of lazy lists is known, ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A finite domain for the abstract interpretation of lazy lists is known,
Strictness Properties of Lazy Algebraic
"... A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the recursive domain equations associated with such types as initial algebras. We then show how the initial algebra inductio ..."
Abstract
 Add to MetaCart
induction principle can be used to reason about the entailment relation on the chosen collection of properties. We examine the lattice of properties given by our construction for the type nlist of lazy lists of natural numbers and give proof rules which extend the conjunctive strictness logic of [2] to a
A Lazy Concurrent ListBased Set Algorithm
, 2005
"... Listbased implementations of sets are a fundamental building block of many concurrent algorithms. A skiplist based on the lockfree listbased set algorithm of Michael will be included in the Java Concurrency Package of JDK 1.6.0. However, Michael's lockfree algorithm has several drawb ..."
Abstract

Cited by 53 (7 self)
 Add to MetaCart
Listbased implementations of sets are a fundamental building block of many concurrent algorithms. A skiplist based on the lockfree listbased set algorithm of Michael will be included in the Java Concurrency Package of JDK 1.6.0. However, Michael's lockfree algorithm has several
Results 1  10
of
200