Models for the computational λ-calculus

Electronic Notes in Theoretical Computer Science

Volumn 40, Issue , 2001, Pages 288-301

  Power, John ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER PROGRAMMING LANGUAGES; CONFORMAL MAPPING; FUNCTION EVALUATION; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SEMANTICS;

ABSTRACT THEORY; AXIOMATIC DOMAIN THEORY; COMPUTATIONAL Λ CALCULUS; FUNCTIONAL PROGRAMMING LANGUAGES; KLEISLI EXPONENTIALS;

DIFFERENTIATION (CALCULUS);

EID: 18944390237     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80056-8     Document Type: Conference Paper

References (21)

1. Douence R., Fradet P. A Taxonomy of Functional Language Implementations Part I: Call-by-Value. INRIA Research Report No 2783. 1996
2. Fiore M., Honda K. Recursive Types in Games: Axiomatics and Process Representation. Proc LICS. 98:1998;345-356
3. Fiore M., Plotkin G.D. em An axiomatisation of computationally adequate domain-theoretic models of···Proc LICS. 94:1994;92-102
4. Fiore M., Plotkin G.D., Power A.J. Complete cuboidal sets in Axiomatic Domain Theory. Proc LICS. 97:1997;268-279
5. Gordon R., Power A.J. Enrichment through variation. J. Pure Appl. Algebra. 120:1997;167-185
6. M. Hasegawa, Decomposing typed lambda calculus into a couple of categorical programming languages,"Proc. CTCS 95,"Lect. Notes in Computer Science 953, Springer (1995).
7. Honda K., Yoshida N. Game-theoretic analysis of call-by-value computation. "Proc ICALP 97," Lect. Notes in Computer Science. 1256:1997;225-236
8. Kelly G.M. "Basic concepts of enriched category theory," Cambridge University Press. 1982
9. Kinoshita Y., Power A.J. Data refinement for a call-by-value language. "Proc CSL 99," Lect. Notes in Computer Science. 1683:1999;562-576
10. P.B. Levy, A.J. Power, and H. Thielecke, Modelling environments in call-by-value programming languages (submitted).
11. Saunders Mac Lane. "Categories for the Working Mathematician," Springer-Verlag. 1971
12. Mitchell J. "Foundations for programming languages," Foundations of Computing Series, MIT Press. 1996
13. Moggi E. Computational Lambda-calculus and Monads. Proc LICS. 89:1989;14-23
14. Moggi E. Notions of computation and Monads. Information and Computation. 93:1991;55-92
15. Plotkin G.D., Power A.J. Semantics for Algebraic Operations. "Proc MFPS 01," Electronic Notes in Theoret. Computer Science. 45:2001
16. Plotkin G.D., Power A.J., Sannella D.T., Tennent R.D. Lax logical relations. 'Proc ICALP 2000," Lect. Notes in Computer Science. 1853:2000;85-102
17. A.J. Power, Premonoidal categories as categories with algebraic structure, Theoretical Computer Science (to appear).
18. Power A.J., Robinson E.P. Premonoidal categories and notions of computation. Math Structure in Computer Science. 7:1997;453-468
19. Power A.J., Thielecke H. Environments, Continuation Semantics and Indexed Categories. "Proc TAGS 97," Lect. Notes in Computer Science. 1281:1997;391-441
20. Power A.J., Thielecke H. Closed·····- and·-categories. "Proc ICALP 99," Lect. Notes in Computer Science. 1644:1999;625-634
21. Ross Street. The formal theory of monads. J. Pure Appl. Algebra. 2:1972;149-168