The following pages link to Daniel P. Friedman (Q1101432):
Displaying 30 items.
- A syntactic theory of sequential control (Q1101435) (← links)
- Output driven interpretation of recursive programs, or writing creates and destroys data structures (Q1238624) (← links)
- A syntactic theory of sequential state (Q1263961) (← links)
- Improving the lazy Krivine machine (Q2464718) (← links)
- (Q2736592) (← links)
- Enriching the lambda calculus with contexts (Q2817703) (← links)
- Trampolined style (Q2817711) (← links)
- Backtracking, interleaving, and terminating monad transformers (Q2936782) (← links)
- (Q3339256) (← links)
- (Q3651734) (← links)
- A closer look at export and import statements (Q3719789) (← links)
- Obtaining coroutines with continuations (Q3740199) (← links)
- (Q3750108) (← links)
- Embedding continuations in procedural objects (Q3768363) (← links)
- CONCUR: A language for continuous, concurrent processes (Q3886919) (← links)
- (Q3911367) (← links)
- (Q4024007) (← links)
- (Q4038663) (← links)
- Boolean-valued loops (Q4088262) (← links)
- Functional combination (Q4139638) (← links)
- Unbounded computational structures (Q4153596) (← links)
- Hendrix's model for simultaneous actions and continuous processes: an introduction and implementation (Q4154094) (← links)
- Aspects of Applicative Programming for Parallel Processing (Q4162469) (← links)
- Compiling lambda-expressions using continuations and factorizations (Q4166205) (← links)
- A note on conditional expressions (Q4167526) (← links)
- (Q4187295) (← links)
- CPS in little pieces: composing partial continuations (Q4709846) (← links)
- (Q4723273) (← links)
- (Q5112629) (← links)
- Recycling continuations (Q5348902) (← links)
