CPS Translating Inductive and Coinductive Types (Extended Abstract) (2002)

by Gilles Barthe , Tarmo Uustalu
Venue:In: Proc. of 2002 ACM SIGPLAN Wksh. on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'02
Citations:2 - 0 self

Documents Related by Co-Citation

813 Notions of Computation and Monads – Eugenio Moggi - 1991
505 Comprehending Monads – Philip Wadler - 1992
368 λµ-Calculus: An Algorithmic Interpretation of Classical Natural Deduction – M Parigot - 1992
231 Call-by-name, call-by-value and the λ-calculus – Gordon Plotkin - 1975
220 Call-by-name, call-by-value, and the -calculus – G D Plotkin - 1975
110 Recursive types and type constraints in second-order lambda calculus – P F Mendler
90 A Generic Account of Continuation-Passing Styles – John Hatcliff, Olivier Danvy - 1994
54 Type-Based Termination of Recursive Definitions – G. Barthe, M. J. Frade, E. Giménez, L. Pinto, T. Uustalu - 2002
61 Propositional Lax Logic – Matt Fairtlough, Michael Mendler - 1997