A semantic formulation of ⊤⊤-lifting and logical predicates for computational metalanguage

Lecture Notes in Computer Science

Volumn 3634, Issue , 2005, Pages 87-102

  Katsumata, Shin Ya ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; COMPUTER SCIENCE; SEMANTICS;

COMPUTATIONAL METALANGUAGES; LOGICAL PREDICATES; MONOIDAL CLOSED STRUCTURES;

FORMAL LOGIC;

EID: 26944501932     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538363_8     Document Type: Conference Paper

References (24)

1. M. Abadi. ⊤⊤-closed relations and admissibility. MSCS, 10(3):313-320, 2000.
2. R. Amadio and P.-L. Curien. Domains and Lambda-Calculi, volume 46 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1998.
3. J. G.-Larrecq, S. Lasota, and D. Nowak. Logical relations for monadic types. In Proc. CSL, volume 2471 of LNCS, pages 553-568. Springer, 2002.
4. J. Y. Girard. Linear logic. Theor. Comp. Sci., 50:1-102, 1987.
5. M. Hasegawa. Categorical glueing and logical predicates for models of linear logic. Technical Report RIMS-1223, Research Institute for Mathematical Sciences, Kyoto University, 1999.
6. C. Hermida. Fibrations, Logical Predicates and Indeteminants. PhD thesis, University of Edinburgh, 1993.
7. B. Jacobs. Categorical Logic and Type Theory. Elsevier, 1999.
8. P. Johann. Short cut fusion is correct. J. Funct. Program., 13(4):797-814, 2003.
9. A. Jung and J. Tiuryn. A new characterization of lambda definability. In Proc. TLCA, volume 664 of LNCS, pages 245-257. Springer, 1993.
10. A. Kock. Strong functors and monoidal monads. Archiv der Mathematik, 23:113-120, 1970.
11. S. Lindley. Normalisation by Evaluation in the Compilation of Typed Functional Programming Languages. PhD thesis, University of Edinburgh, 2004.
12. S. Lindley and I. Stark. Reducibility and ⊤⊤-lifting for computation types. In TLCA, pages 262-277, 2005.
13. Q. Ma and J. Reynolds. Types, abstractions, and parametric polymorphism, part 2. In Proc. MFPS 1991, volume 598 of LNCS, pages 1-40. Springer, 1992.
14. S. MacLane. Categories for the Working Mathematician (Second Edition), volume 5 of Graduate Texts in Mathematics. Springer, 1998.
15. P.-A. Melliès and J. Vouillon. Recursive polymorphic types and parametricity in an operational framework. In Proc. LICS 2005. To appear.
16. J. Mitchell. Representation independence and data abstraction. In Proc. POPL, pages 263-276, 1986.
17. J. Mitchell and A. Scedrov. Notes on sconing and relators. In Proc. CSL 1992, volume 702 of LNCS, pages 352-378. Springer, 1993.
18. E. Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, 1991.
19. S. Nishimura. Correctness of a higher-order removal transformation through a relational reasoning. In APLAS, volume 2895 of LNCS, pages 358-375. Springer, 2003.
20. M. Parigot. Proofs of strong normalisation for second order classical natural deduction. Journal of Symbolic Logic, 62(4):1461-1479, 1997.
21. A. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science, 10(3):321-359, 2000.
22. A. Pitts and I. Stark. Operational reasoning for functions with local state. In A. D. Gordon and A. M. Pitts, editors, Higher Order Operational Techniques in Semantics, Publications of the Newton Institute, pages 227-273. Cambridge University Press, 1998.
23. G. Plotkin. Lambda-definability in the full type hierarchy. In "To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism", pages 367-373. Academic Press, San Diego, 1980.
24. W. Tait. Intensional interpretation of functionals of finite type I. Journal of Symbolic Logic, 32, 1967.