Parameterizations and fixed-point operators on control categories

Fundamenta Informaticae

Volumn 65, Issue 1-2, 2005, Pages 153-172

  Kakutani, Yoshihiko ^a   Hasegawa, Masahito ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BINDING MECHANISMS; CONTROL CATEGORIES; FIXED-POINT OPERATORS; PARAMETERIZATIONS;

MATHEMATICAL MODELS; MATHEMATICAL OPERATORS;

MATHEMATICAL TECHNIQUES;

EID: 24044461421     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (16)

1. Bloom, S., Ésik, Z.: Iteration Theories, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1993.
2. Fiore, M.: Axiomatic Domain Theory in Categories of Partial Maps, Distinguished Dissertation Series, Cambridge University Press, 1996.
3. Führmann, C: Varieties of Effects, in: Foundations of Software Science and Computation Structures, vol 2303 of LNCS, Springer-Verlag, 2002, 144-158.
4. Hasegawa, M.: Models of Sharing Graphs: a categorical semantics of let and letrec, Ph.D. Thesis, University of Edinburgh, 1997, Also available as Distinguished Dissertation Series, Springer-Verlag, 1999.
5. Hasegawa, M., Kakutani, Y.: Axioms for Recursion in Call-by-Value, Higher-Order and Symbolic Computation, 15(2), 2002, 235-264.
6. Jacobs, B.: Parameters and Parameterization in Specification, Using Distributive Categories, Fundamenta Informaticae, 24(3), 1995, 209-250.
7. Kakutani, Y.: Duality between Call-by-Name Recursion and Call-by-Value Iteration, in: Computer Science Logic, vol. 2471 of LNCS, Springer-Verlag, 2002, 506-521.
8. Lambek, J.: Functional Completeness of Cartesian Categories, Annals of Mathemathical Logic, 6, 1970, 259-292.
9. Lambek, J., Scott, P. J.: Introduction to Higher-Order Categorical Logic, Cambridge Studies in Advanced Mathematics, Cambridge University Press, 1986.
10. Laurent, O.: Polarized Proof Nets and λμ-calculus, Theoretical Computer Science, 290(1), 2002, 161-188.
11. Montelatici, R.: Polarized Proof Nets with Cycles and Fixpoints Semantics, in: Typed Lambda Calculi and Applications, vol. 2701 of LNCS, Springer-Verlag, 2003, 256-270.
12. Parigot, M.: λμ-calculus: an algorithmic interpretation of classical natural deduction., in: Logic Programming and Automated Reasoning, vol. 624 of LNCS, Springer-Verlag, 1992, 190-201.
13. Power, A. J., Robinson, E. P.: Premonoidal Categories and Notions of Computation, Mathematical Structures in Computer Science, 7(5), 1997, 453-468.
14. Selinger, P.: Control Categories and Duality: on the categorical semantics of the lambda-mu calculus, Mathematical Structures in Computer Science, 11(2), 2001, 207-260.
15. Simpson, A., Plotkin, G.: Complete Axioms for Categorical Fixed-point Operators, in: Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 2000, 30-41.
16. Thielecke, H.: Categorical Structure of Continuation Passing Style, Ph.D. Thesis, University of Edinburgh, 1997.