Relating computational effects by ΤΤ;-lifting

Information and Computation

Volumn 222, Issue , 2013, Pages 228-246

  Katsumata, Shin Ya ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

lifting; Algebraic operation; Computational effects; Fibration; Fresh name creation; Generic effect; Logical relation; Monad

Indexed keywords

ALGEBRAIC OPERATIONS; COMPUTATIONAL EFFECTS; FIBRATION; FRESH NAMES; GENERIC EFFECTS; LOGICAL RELATIONS; MONAD;

ALGEBRA; RECURSIVE FUNCTIONS;

SEMANTICS;

EID: 84870997546     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2012.10.014     Document Type: Conference Paper

References (33)

1. R. Atkey, N. Ghani, B. Jacobs, and P. Johann Fibrational induction meets effects L. Birkedal, Foundations of Software Science and Computational Structures Lecture Notes in Computer Science vol. 7213 2012 Springer 42 57
2. N. Benton, J. Hughes, and E. Moggi Monads and effects Proc. APPSEM 2000 Lecture Notes in Computer Science vol. 2395 2002 Springer 42 122
3. A. Filinski, Representing monads, in: Proc. POPL 1994, pp. 446-457.
4. A. Filinski, Controlling effects, PhD thesis, Carnegie Mellon University, 1996.
5. A. Filinski, Representing layered monads, in: Proc. POPL 1999, pp. 175-188.
6. A. Filinski On the relations between monadic semantics Theoretical Computer Science 375 2007 41 75
7. A. Filinski, and K. Stovring Inductive reasoning about effectful data types R. Hinze, N. Ramsey, ICFP 2007 ACM 97 110
8. N. Ghani, P. Johann, and C. Fumex Fibrational induction rules for initial algebras A. Dawar, H. Veith, CSL Lecture Notes in Computer Science vol. 6247 2010 Springer 336 350
9. J.Y. Girard Linear logic Theoretical Computer Science 50 1987 1 102
10. M. Hasegawa, and Y. Kakutani Axioms for recursion in call-by-value Higher-Order and Symbolic Computation 15 2002 235 264
11. C. Hermida, Fibrations, logical predicates and indeterminants, PhD thesis, University of Edinburgh, 1993.
12. B. Jacobs Categorical Logic and Type Theory 1999 Elsevier
13. A. Jung, and J. Tiuryn A new characterization of lambda definability Proc. TLCA Lecture Notes in Computer Science vol. 664 1993 Springer 245 257
14. S. Katsumata A semantic formulation of ΤΤ;-lifting and logical predicates for computational metalanguage Proc. CSL 2005 Lecture Notes in Computer Science vol. 3634 2005 Springer 87 102
15. S. Katsumata A characterisation of lambda definability with sums via ΤΤ;-closure operators Proc. CSL 2008 Lecture Notes in Computer Science vol. 5213 2008 Springer 278 292
16. S. Katsumata Relating computational effects by ΤΤ;-lifting L. Aceto, M. Henzinger, J. Sgall, ICALP (2) Lecture Notes in Computer Science vol. 6756 2011 Springer 174 185
17. J.G. Larrecq, S. Lasota, and D. Nowak Logical relations for monadic types Mathematical Structures in Computer Science 18 2008 1169 1217
18. S. Lindley, Normalisation by evaluation in the compilation of typed functional programming languages, PhD thesis, University of Edinburgh, 2004.
19. S. Lindley, I. Stark, Reducibility and ΤΤ;-lifting for computation types, in: Proc. TLCA, pp. 262-277.
20. Q. Ma, and J. Reynolds Types, abstractions, and parametric polymorphism, part 2 Proc. MFPS 1991 Lecture Notes in Computer Science vol. 598 1992 Springer 1 40
21. P.A. Melliès, and J. Vouillon Recursive polymorphic types and parametricity in an operational framework LICS 2005 IEEE Computer Society 82 91
22. J. Mitchell Foundations for Programming Languages 1996 MIT Press
23. J. Mitchell, and A. Scedrov Notes on sconing and relators CSL Lecture Notes in Computer Science vol. 702 1992 Springer 352 378
24. R.E. Mogelberg, and A. Simpson Relational parametricity for computational effects Logical Methods in Computer Science 5 2009
25. E. Moggi Computational lambda-calculus and monads LICS 1989 IEEE Computer Society 14 23
26. M. Parigot Proofs of strong normalisation for second order classical natural deduction Journal of Symbolic Logic 62 1997 1461 1479
27. A. Pitts Parametric polymorphism and operational equivalence Mathematical Structures in Computer Science 10 2000 321 359
28. G. Plotkin, and J. Power Semantics for algebraic operations Electronic Notes in Theoretical Computer Science 45 2001
29. G. Plotkin, and J. Power Algebraic operations and generic effects Applied Categorical Structures 11 2003 69 94
30. G. Plotkin, and M. Pretnar Handlers of algebraic effects G. Castagna, ESOP Lecture Notes in Computer Science vol. 5502 2009 Springer 80 94
31. A. Simpson, G. Plotkin, Complete axioms for categorical fixed-point operators, in: LICS, pp. 30-41.
32. I. Stark Categorical models for local names Lisp and Symbolic Computation 9 1996 77 107
33. I. Stark A fully abstract domain model for the π-calculus Proc. LICS 1996 1996 IEEE 36 42