Papers

Call with Current Continuation Patterns

Posted on February 1, 2001 | 1 min | 11 words | Darrell Ferguson | Dwight Deugo

[Read More]

callcc

Cogen in six lines

Posted on June 15, 1996 | 1 min | 92 words | Peter J. Thiemann

[Read More]

Purely functional random-access lists

Posted on October 1, 1995 | 1 min | 112 words | Chris Okasaki

Okasaki introduces purely functional random-access lists, a data structure that combines constant-time list operations with logarithmic lookup and update, offering an efficient persistent alternative to arrays in functional programs. [Read More]

randomaccess functional lists lookup update indexing arrays persistent logarithmic

Adding generic functions to Scheme

Posted on April 1, 1995 | 1 min | 86 words | Thant Tessman

[Read More]

Representing monads

Posted on February 1, 1994 | 1 min | 167 words | Andrzej Filinski

[Read More]

monads callcc shift reset

Handling control

Posted on June 1, 1993 | 1 min | 114 words | Dorai Sitaram

[Read More]

Guarded commands, nondeterminacy and formal derivation of programs

Posted on August 1, 1975 | 1 min | 87 words | Edsger W. Dijkstra

[Read More]

pattern matching