You are here: › › › Daniel P Friedman
Daniel P Friedman

Daniel P Friedman

15 books

Programming with continuations: [Devils and angels problem]

Programming with continuations: [Devils and angels problem]

by Daniel P Friedman

0.0 of 0

GRASPE 1.5,: A graph processor and its applications,

GRASPE 1.5,: A graph processor and its applications,

by Daniel P Friedman

0.0 of 0

Multiple-valued recursive procedures (Technical report - Indiana University, Computer Science Department)

Multiple-valued recursive procedures (Technical report - Indiana University, Computer Science Department)

by Daniel P Friedman

0.0 of 0

Unbounded computational structures (Technical report - Indiana University, Computer Science Department)

Unbounded computational structures (Technical report - Indiana University, Computer Science Department)

by Daniel P Friedman

0.0 of 0

An environment for multiple-valued recursive procedures

An environment for multiple-valued recursive procedures

by Daniel P Friedman

0.0 of 0

Unwinding structured recursions into iterations (Technical report - Indiana University, Computer Science Department)

Unwinding structured recursions into iterations (Technical report - Indiana University, Computer Science Department)

by Daniel P Friedman

0.0 of 0

Recursive programming through table look-up (Technical report - Indiana University, Computer Science Department)

Recursive programming through table look-up (Technical report - Indiana University, Computer Science Department)

by Daniel P Friedman

0.0 of 0

A conditional, interlock-free store instruction

A conditional, interlock-free store instruction

by Daniel P Friedman

0.0 of 0

Applicative programming for systems

Applicative programming for systems

by Daniel P Friedman

0.0 of 0

A constructor for applicative multiprogramming

A constructor for applicative multiprogramming

by Daniel P Friedman

0.0 of 0

A note on conditional expressions (Technical report - Indiana University, Computer Science Department)

A note on conditional expressions (Technical report - Indiana University, Computer Science Department)

by Daniel P Friedman

0.0 of 0

Reference counting can manage the circular environments of mutual recursion

Reference counting can manage the circular environments of mutual recursion

by Daniel P Friedman

0.0 of 0

Applicative multiprogramming

Applicative multiprogramming

by Daniel P Friedman

0.0 of 0

An algorithm for garbage collecting in a hashing environment (Technical report - Indiana University, Computer Science Department)

An algorithm for garbage collecting in a hashing environment (Technical report - Indiana University, Computer Science Department)

by Daniel P Friedman

0.0 of 0