Adjunction models for call-by-push-value with stacks

Electronic Notes in Theoretical Computer Science

Volumn 69, Issue , 2003, Pages 248-271

  Levy, Paul Blain ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PATTERN MATCHING; SET THEORY; THEOREM PROVING;

ADJUNCTION MODELS; CALL-BY-PUSH-VALUE (CBPV); CATEGORICAL SEMANTICS; COPRODUCTS;

SEMANTICS;

EID: 18944400734     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80568-1     Document Type: Conference Paper

References (20)

1. Carboni A., Lack S., Walters R.F.C. Introduction to extensive and distributive categories. Journal of Pure and Applied Algebra. 84:1993;145-158
2. Cockett J.R.B. Introduction to distributive categories. Mathematical Structures in Computer Science. 3:1993;277-307
3. Curien P.-L. and H. Herbelin, The duality of computation., in: Proceedings of the ACM Sigplan International Conference on Functional Programming (ICFP-00), ACM Sigplan Notices 35.9 (2000), pp. 233-243.
4. Felleisen M., Friedman D.P. Control operators, the SECD-machine, and the λ-calculus. Wirsing M. Formal Description of Programming Concepts. 1986;193-217 North-Holland
5. Filinski A., "Controlling Effects," Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania (1996).
6. Fiore M., G. D. Plotkin and D. Turi, Abstract syntax and variable binding, in: G. Longo, editor, Proceedings of the 14th Annual Symposium on Logic in Computer Science (LICS'99) (1999), pp. 193-202.
7. Hyland J.M.E., Ong C.-H.L. On full abstraction for PCF: I, II, and III. Information and Computation. 163:2000;285-408
8. Jeffrey A. A fully abstract semantics for a higher-order functional language with nondeterministic computation. TCS: Theoretical Computer Science. 228:1999
9. Laird J., Full abstraction for functional languages with control, in: Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Warsaw, Poland, 1997, pp. 58-67.
10. Laird J., "A Semantic Analysis of Control," Ph.D. thesis, University of Edinburgh (1998).
11. Lambek J., Scott P. "Introduction to Higher Order Categorical Logic," 1986;Cambridge University Press, Cambridge
12. Lawvere, F. W., "Functional Semantics of Algebraic Theories," Ph.D. thesis, Columbia University (1963).
13. Levy, P. B., λ-calculus and cartesian closed categories (1996), essay for Part III of the Mathematical Tripos, Cambridge University, manuscript.
14. Levy P.B. Call-by-push-value: a subsuming paradigm (extended abstract). Girard J.-Y. Typed Lambda-Calculi and Applications. 1581:1999;228-242 LNCS
15. Levy, P. B., "Call-by-push-value," Ph.D. thesis, Queen Mary, University of London (2001).
16. Levy, P. B., H. Thielecke and A. J. Power, Modelling environments in call-by-value programming languages, submitted.
17. Moggi E. Notions of computation and monads. Information and Computation. 93:1991;55-92
18. Plotkin, G. D., Lectures on predomains and partial functions (1985), course notes, Center for the Study of Language and Information, Stanford.
19. Selinger P. Control categories and duality: On the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science. 11:2001;207-260
20. Streicher T., Reus B. Classical logic, continuation semantics and abstract machines. Journal of Functional Programming. 8:1998;543-572