A Small Measure of Peace
  • About
  • Externals
    • Data Structures in Smalltalk
    • Crate libpq-rs
    • Crate igraph-rs

Papers

Final shift for call/cc

Direct implementation of shift and reset

 Posted on September 17, 2002  |   11 min  |   2208 words  |   Martin Gasbichler Michael Sperber

[Read More]
Categories: scheme papers  Tags: monads callcc shift reset 

Call with Current Continuation Patterns

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

[Read More]
Categories: scheme papers  Tags: callcc 

Cogen in six lines

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

[Read More]
Categories: papers scheme 

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]
Categories: papers Okasaki  Tags: 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]
Categories: papers scheme 

Representing monads

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

[Read More]
Categories: ml papers  Tags: monads callcc shift reset 

Handling control

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

[Read More]
Categories: papers scheme 

Guarded commands, nondeterminacy and formal derivation of programs

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

[Read More]
Categories: papers  Tags: pattern matching 
  • ← Newer Posts

Massimo Nocentini  •  © 2026  •  A Small Measure of Peace

Hugo v0.163.2 powered  •  Theme Beautiful Hugo adapted from Beautiful Jekyll