Comparing Control Constructs by Double-barrelled CPS (2002)

View PDF

Download Links

by Hayo Thielecke
Venue:Higher-order and Symbolic Computation
Citations:18 - 2 self

Documents Related by Co-Citation

308 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
252 A Formulae-as-Types Notion of Control – Timothy G. Griffin - 1990
766 Notions of Computation and Monads – Eugenio Moggi - 1991
457 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
340 Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction – M Parigot - 1992
132 Representing Monads – Andrzej Filinski - 1994
496 Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory – J E Stoy - 1977
467 Comprehending Monads – Philip Wadler - 1992
469 The formulae-as-types notion of construction – W Howard - 1980