This site needs no title
  • content
    • Pages
    • Tags
    • Categories
    • About

This site needs no title


Massimo Nocentini's papers, notes, memos and source code.

The igraph software package for complex network research

 Posted on January 1, 2006  (Last modified on February 11, 2026)  |   1 min  |   Massimo Nocentini

[Read More]
Categories: papers  graphs  Tags: igraph 

Final shift for call/cc

Direct implementation of shift and reset

 Posted on September 17, 2002  (Last modified on February 20, 2026)  |   11 min  |   Martin Gasbichler Michael Sperber

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

Call with Current Continuation Patterns

 Posted on February 1, 2001  (Last modified on February 23, 2026)  |   1 min  |   Darrell Ferguson Dwight Deugo

[Read More]
Categories: scheme  papers  Tags: callcc 

Cogen in six lines

 Posted on June 15, 1996  (Last modified on May 13, 2026)  |   1 min  |   Peter J. Thiemann

[Read More]
Categories: papers  scheme 

The Seasoned Schemer

 Posted on January 31, 1996  (Last modified on February 23, 2026)  |   5 min  |   Daniel P. Friedman Matthias Felleisen

[Read More]
Categories: scheme  books  Tags: callcc 

The Little Schemer

 Posted on January 30, 1996  (Last modified on February 20, 2026)  |   4 min  |   Daniel P. Friedman Matthias Felleisen

[Read More]
Categories: scheme  books 

Adding generic functions to Scheme

 Posted on April 1, 1995  (Last modified on May 8, 2026)  |   1 min  |   Thant Tessman

[Read More]
Categories: papers  scheme 

Representing monads

 Posted on February 1, 1994  (Last modified on February 20, 2026)  |   1 min  |   Andrzej Filinski

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

Handling control

 Posted on June 1, 1993  (Last modified on May 11, 2026)  |   1 min  |   Dorai Sitaram

[Read More]
Categories: papers  scheme 
  • ← Newer Posts
Posts
  • Inspecting the Payments Graph
  • SIMD
  • CHICKEN Scheme
  • Pharo Smalltalk
  • Neovim
  • The SBRAL data structure
  • Pattern matching
  • The Wolfram Engine
  • Running PostgreSQL natively vs into containers
  • The (aux hansei) module
  • The (aux nondeterministic) module
  • Learning tests for Scheme
  • The (aux stream) module
  • The (aux unittest) module
  • TAOCP: Volume 4, Fascicle 6.
  • The Stanford GraphBase and CWEB
  • Rust bindings for Postgres
  • Scheme lang: Chez, 48 and Chicken
  • Rust bindings for igraph
  • Hyperfunctions
  • Lua 5.5.0 is out!
  • Functions and Jordan canonical forms of Riordan matrices
  • The Reasoned Schemer
  • Algebraic Generating Functions for Languages Avoiding Riordan Patterns
  • BiRank
  • Axioms for Centrality
  • Aggregation predicates for µkanren
  • miniKanren, live and untagged
  • Teaching the art of computer programming
  • Pure, declarative, and constructive arithmetic relations
  • The igraph software package for complex network research
  • Final shift for call/cc
  • Call with Current Continuation Patterns
  • Cogen in six lines
  • The Seasoned Schemer
  • The Little Schemer
  • Adding generic functions to Scheme
  • Representing monads
  • Handling control

Massimo Nocentini  •  © 2016 - 2026  •  This site needs no title

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