|
206
|
A Formulae-as-Types Notion of Control
– Timothy G. Griffin
- 1990
|
|
263
|
Definitional interpreters for higher-order programming languages
– John C. Reynolds
- 1972
|
|
651
|
Notions of Computation and Monads
– Eugenio Moggi
- 1991
|
|
116
|
Representing Monads
– Andrzej Filinski
- 1994
|
|
174
|
Call-by-name, call-by-value and the λ-calculus
– G Plotkin
- 1976
|
|
270
|
Λµ-calculus: an algorithmic interpretation of classical natural deduction
– M Parigot
- 1992
|
|
401
|
Computational Lambda-Calculus and Monads
– Eugenio Moggi
- 1988
|
|
20
|
Shift to control
– Chung-chieh Shan
- 2004
|
|
21
|
Control operators, hierarchies, and pseudo-classical type systems: A-translation at work
– Chethan R Murthy
- 1992
|
|
8
|
A Syntactic Approach to Modularity
– P Cenciarelli, E Moggi
- 1993
|
|
3
|
On the Call-by-Value CPS Transform and its
– C Fuhrmann, H Thielecke
|
|
3
|
Adjunctions whose Counits are Coequalizers
– G M Kelly, A J Power
- 1993
|
|
17
|
Sound and Complete Axiomatisations of Call-By-Value Control Operators
– Martin Hofmann, Mart I N Hofmann
- 1994
|
|
21
|
Composing Monads Using Coproducts
– Christoph Lüth, Neil Ghani
- 2002
|
|
10
|
Locally presentable and accessible
– J V Adámek, J Rosick´y
|
|
39
|
A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so
– G M Kelly
- 1980
|
|
13
|
From Control Effects to Typed Continuation Passing
– Hayo Thielecke
- 2003
|
|
14
|
On Exceptions versus Continuations in the Presence of State
– Hayo Thielecke
- 2000
|
|
15
|
An Extended Type System for Exceptions
– Juan Carlos Guzm'an
- 1994
|
