Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
lazy lists
Description:
Sequences in functional programming whose elements are computed only when they are needed.
Primary topic:
Logic, programming, and type systems (78%)
Related topics:
Logic, programming, and type systems (78%),
Distributed systems and fault tolerance (8%)
OpenAlex ID:
keywords/lazy-lists
A Lazy Concurrent List-Based Set Algorithm
2006
·
Steve Heller
, Maurice Herlihy
, et al.
·
Lecture notes in computer science
·
220
Parametric polymorphism and operational equivalence
2000
·
ANDREW M. PITTS
·
Mathematical Structures in Computer Science
·
197
Recursion Equations as a Programming Language
1982
·
D. A. Turner
·
Lecture notes in computer science
·
146
A Categorical Programming Language
2020
·
Hagino, Tatsuya
·
arXiv (Cornell University)
·
102
PDF
A Naïve Time Analysis and its Theory of Cost Equivalence
1995
·
DAVID SANDS
·
Journal of Logic and Computation
·
100
Simple and efficient purely functional queues and deques
1995
·
Chris Okasaki
·
Journal of Functional Programming
·
78
PDF
A fixedpoint approach to implementing (Co)inductive definitions
1994
·
Lawrence C. Paulson
·
Lecture notes in computer science
·
75
On embedding a microarchitectural design language within Haskell
1999
·
John Launchbury
, Jeffrey R. Lewis
, et al.
·
ACM SIGPLAN International Conference on Functional Programming (ICFP)
·
58
Mechanizing coinduction and corecursion in higher-order logic
1997
·
L. Paulson
·
Journal of Logic and Computation
·
56
PDF
Power series, power serious
1999
·
M. DOUGLAS MCILROY
·
Journal of Functional Programming
·
37
PDF
Automated complexity analysis of Nuprl extracted programs
2001
·
RALPH BENZINGER
·
Journal of Functional Programming
·
35
PDF
Functional programming with the FC++ library
2004
·
BRIAN MCNAMARA
, YANNIS SMARAGDAKIS
·
Journal of Functional Programming
·
28
PDF
Co-induction and co-recursion in higher-order logic
1993
·
Lawrence C. Paulson
·
CL Technical Reports
·
25
Eden — The paradise of functional concurrent programming
1996
·
S. Breitinger
, R. Loogen
, et al.
·
Lecture notes in computer science
·
21
Distributed random number generation
1992
·
F. Warren Burton
, Rex L. Page
·
Journal of Functional Programming
·
20
PDF
What sequential games, the tychonoff theorem and the double-negation shift have in common
2010
·
Martín Escardó
, Paulo Oliva
·
19
Stream processing hardware from functional language specifications
2003
·
S. Frankau
, A. Mycroft
·
Hawaii International Conference on System Sciences (HICSS)
·
18
Strictness properties of lazy algebraic datatypes
1993
·
P. N. Benton
·
Lecture notes in computer science
·
16
Order out of Chaos: Proving Linearizability Using Local Views
2018
·
Feldman, Yotam M. Y.
, Enea, Constantin
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
15
PDF
A Constructive Approach for Proving Data Structures’ Linearizability
2015
·
Kfir Lev-Ari
, Gregory Chockler
, et al.
·
Lecture notes in computer science
·
14
Implementation and programming techniques for functional languages
1986
·
Stuart Charles Wray
·
CL Technical Reports
·
14
Parametric Polymorphism and Operational Equivalence (Preliminary Version)
1998
·
Andrew M. Pitts
·
Electronic Notes in Theoretical Computer Science
·
13
PDF
Uniform ideals and strictness analysis
1991
·
Christine Ernoult
, Alan Mycroft
·
Lecture notes in computer science
·
13
Interactive Functional Programs: a Method and a Formal Semantics
1987
·
Simon Thompson
·
Kent Academic Repository (University of Kent)
·
12
PDF
Deriving structural induction in LCF
1984
·
Lawrence Paulson
·
Lecture notes in computer science
·
12
Show more works
View as search
Works count:
101
Citation count:
1,469
Year
Topic
Type