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

7 The Dual of Substitution is Redecoration – Tarmo Uustalu, Varmo Vene - 2002
5 Monad Translating Inductive and Coinductive Types – Tarmo Uustalu - 2003
2 Co)monads from inductive and coinductive types – T Uustalu - 2001
2 Generalizing substitution (extended abstract – T Uustalu - 2002
2 Least and greatest fixedpoints in intuitionistic natural deduction – T Uustalu, V Vene - 2002
21 Recursion Schemes from Comonads – Tarmo Uustalu, Varmo Vene, Alberto Pardo - 2001
39 Type-Based Termination of Recursive Definitions – G. Barthe, M. J. Frade, E. Giménez, L. Pinto, T. Uustalu - 2002
5 Type Iteration vs. recursion – Sp lawski, Z, P Urzyczyn - 1999
3 A third-order representation of the -calculus – A Abel - 2001
8 Monadic Type Systems: Pure Type Systems for Impure Settings (Preliminary Report) – Gilles Barthe, John Hatcliff, Peter Thiemann - 1997
14 Type fixpoints: Iteration vs. recursion – Z Splawski, P Urzyczyn - 1999
34 Contracting proofs to programs – D Leivant - 1990
51 Inductive and Coinductive types with Iteration and Recursion – Herman Geuvers - 1992
7 A third-order representation of the λµ-Calculus – Andreas Abel - 2001
220 Call-by-name, call-by-value and the -calculus – G D Plotkin - 1975
10 CPS Translations and Applications: The Cube and Beyond – Gilles Barthe, John Hatcliff, Morten Heine B. Srensen - 1996
8 About Charity, Yellow Series Report 92/480/18 – R Cockett, T Fukushima - 1992
94 Recursive types and type constraints in second-order lambda calculus – P F Mendler - 1987
328 An algorithmic interpretation of classical natural deduction – M Parigot - 1992