| Publication | Date of Publication | Type |
|---|
| The little prover. With a foreword by J. Strother Moore. With an afterword by Matthias Felleisen | 2020-06-02 | Paper |
Recycling continuations
Proceedings of the third ACM SIGPLAN international conference on Functional programming | 2017-08-21 | Paper |
Trampolined style
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming | 2016-09-01 | Paper |
Enriching the lambda calculus with contexts: toward a theory of incremental program construction
Proceedings of the first ACM SIGPLAN international conference on Functional programming - ICFP '96 | 2016-09-01 | Paper |
| Evolutionary games in natural, social, and virtual worlds | 2016-05-31 | Paper |
Backtracking, interleaving, and terminating monad transformers (functional pearl)
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming | 2015-01-06 | Paper |
| Essentials of programming languages. | 2009-12-11 | Paper |
α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic
Logic Programming | 2009-01-22 | Paper |
Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl)
Functional and Logic Programming | 2008-04-11 | Paper |
Improving the lazy Krivine machine
Higher-Order and Symbolic Computation | 2007-12-17 | Paper |
CPS in little pieces: composing partial continuations
Journal of Functional Programming | 2003-09-04 | Paper |
| Essentials of programming languages. | 2001-09-11 | Paper |
| scientific article; zbMATH DE number 177785 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 108542 (Why is no real title available?) | 1993-01-23 | Paper |
A syntactic theory of sequential state
Theoretical Computer Science | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 3997138 (Why is no real title available?) | 1987-01-01 | Paper |
A syntactic theory of sequential control
Theoretical Computer Science | 1987-01-01 | Paper |
Embedding continuations in procedural objects
ACM Transactions on Programming Languages and Systems | 1987-01-01 | Paper |
Obtaining coroutines with continuations
Computer Languages | 1986-01-01 | Paper |
A closer look at export and import statements
Computer Languages | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3986620 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3872649 (Why is no real title available?) | 1984-01-01 | Paper |
CONCUR: A language for continuous, concurrent processes
Computer Languages | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3624771 (Why is no real title available?) | 1979-01-01 | Paper |
Functional combination
Computer Languages | 1978-01-01 | Paper |
A note on conditional expressions
Communications of the ACM | 1978-01-01 | Paper |
Aspects of Applicative Programming for Parallel Processing
IEEE Transactions on Computers | 1978-01-01 | Paper |
Unbounded computational structures
Software: Practice and Experience | 1978-01-01 | Paper |
Compiling lambda-expressions using continuations and factorizations
Computer Languages | 1978-01-01 | Paper |
Hendrix's model for simultaneous actions and continuous processes: an introduction and implementation
International Journal of Man-Machine Studies | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3722073 (Why is no real title available?) | 1976-01-01 | Paper |
Output driven interpretation of recursive programs, or writing creates and destroys data structures
Information Processing Letters | 1976-01-01 | Paper |
Boolean-valued loops
BIT | 1975-01-01 | Paper |
A language extension for graph processing and its formal semantics
Communications of the ACM | 1971-01-01 | Paper |
