Reductibility and ⊤⊤-lifting for computation types

Lecture Notes in Computer Science

Volumn 3461, Issue , 2005, Pages 262-277

  Lindley, Sam ^a   Stark, Ian ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

COMPUTATIONAL METALANGUAGES; GIRARD-TAIT REDUCIBILITY; MOGGI'S MONADIC COMPUTATION TYPES; ⊤⊤-LIFTING;

COMPUTATION THEORY;

EID: 24944577517     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11417170_20     Document Type: Conference Paper

References (33)

1. M. Abadi. ⊤⊤-closed relations and admissibility. Math. Struct. Comp. Sci., 10(3):313-320, 2000.
2. H. P. Barendregt. Lambda calculi with types. In Handbook of Logic in Computer Science, vol. II, pp. 118-309. OUP, 1992.
3. G. Barthe, J. Hatcliff, and P. Thiemann. Monadic type systems: Pure type systems for impure settings. In Proc. HOOTS II, ENTCS 10. Elsevier, 1997.
4. P. N. Benton, G. Bierman, and V. de Paiva. Computational types from a logical perspective. J. Funct. Prog., 8(2): 177-193, 1998.
5. P. N. Benton, J. Hughes, and E. Moggi. Monads and effects. In Applied Semantics; Advanced Lectures, LNCS 2395, pp. 42-122. Springer-Verlag, 2002.
6. P. N. Benton and A. Kennedy. Personal communication, December 1998.
7. P. N. Benton, A. Kennedy, and G. Russell. Compiling Standard ML to Java bytecodes. In Proc. ICFP '98. ACM Press, 1998.
8. P. N. Benton, A. Kennedy, C. Russo, and G. Russell. The SML.NET compiler. Available at http://www.cl.cam.ac.uk/Research/TSG/SMLNET/.
9. P. N. Benton and A. J. Kennedy. Exceptional syntax. J. Funct. Prog., 11 (4):395-410, 2001.
10. R. Carlsson, B. Gustavsson, and P. Nyblom. Erlang's exception handling revisited. In Proc. ERLANG '04, pp. 16-26. ACM Press, 2004.
11. P. de Groote. On the strong normalisation of intuitionistic natural deduction with permutation-conversions. Inf. & Comp., 178(2):441-464, 2002.
12. A. Filinski. Representing monads. In Conf. Record POPL '94, pp. 446-457. ACM Press, 1994.
13. J.-Y. Girard. Linear logic. Theor. Comp. Sci., 50(1):1-102, 1987.
14. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. CUP, 1989.
15. J. Goubault-Larrecq, S. Lasota, and D. Nowak. Logical relations for monadic types. In Proc. CSL '02, pp. 553-568, 2002.
16. J. Hatcliff and O. Danvy. A generic account of continuation-passing styles. In Conf. Record POPL '94, pp. 458-471. ACM Press, 1994.
17. F. Joachimski and R. Matthes. Short proofs of normalization. Arch. Math. Log., 42(1):58-87, 2003.
18. M. Lillibridge. Unchecked exceptions can be strictly more powerful than call/cc. Higher-Order & Symb. Comp., 12(1):75-104, 1999.
19. S. Lindley. Normalisation by Evaluation in the Compilation of Typed Functional Programming Languages. PhD thesis, U. Edinburgh, 2005.
20. E. Moggi. Computational lambda-calculus and monads. In Proc. LICS '89, pp. 14-23. IEEE Comp. Soc. Press, 1989.
21. E. Moggi. Notions of computation and monads. Inf. & Comp., 93(1):55-92, 1991.
22. J. Newburn. All about monads, v1.1.0. http://www.nomaware.com/monads.
23. M. Parigot. Proofs of strong normalisation for second order classical natural deduction. J. Symb. Log., 62(4): 1461-1479, 1997.
24. S. Peyton Jones, editor. Haskell 98 Language and Libraries: The Revised Report. CUP, 2003.
25. A. Pitts and I. Stark. Operational reasoning for functions with local state. In Higher Order Operational Techniques in Semantics, pp. 227-273. CUP, 1998.
26. A. M. Pitts. Parametric polymorphism and operational equivalence. Math. Struct. Comp. Sci., 10:321-359, 2000.
27. D. Prawitz. Ideas and results in proof theory. In Proc. 2nd Scand. Log. Symp., Stud. Log. Found. Math. 63, pp. 235-307. North Holland, 1971.
28. A. Sabry and P. Wadler. A reflection on call-by-value. ACM Trans. Prog. Lang. Syst., 19(6):916-941, 1997.
29. W. W. Tait. Intensional interpretations of functionals of finite type I. J. Symb. Log., 32(2) : 198-212, 1967.
30. J. Vouillon. Subtyping union types. In Proc. CSL '04, LNCS 3210, pp. 415-429. Springer-Verlag, 2004.
31. J. Vouillon and P.-A. Melliès. Recursive polymorphic types and parametricity in an operational framework. Submitted for publication, 2004.
32. J. Vouillon and P.-A. Melliès. Semantic types: a fresh look at the ideal model for types. In Conf. Record POPL '04, pp. 52-63. ACM Press, 2004.
33. P. Wadler. Monads for functional programming. In Advanced Functional Programming, LNCS 925, pp. 24-52. Springer-Verlag, 1995.