Program equivalence in a linear functional language

Journal of Functional Programming

Volumn 10, Issue 2, 2000, Pages 167-190

  Bierman, G M ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346007448     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003639     Document Type: Article

References (35)

1. Abramsky, S. (1990) The lazy lambda calculus. In: Turner, D. A. (ed), Research Topics in Functional Programming, pp. 65-116. Addison-Wesley.
2. Abramsky, S. (1993) Computational interpretations of linear logic. Theor. Comput. Sci. 111(1-2), 3-57.
3. Barendsen, E. and Smetsers, S. (1996) Uniqueness typing for functional languages with graph rewriting semantics. Math. Struct. in Comput. Sci. 6(6), 579-612.
4. Benton, P. N. and Wadler, P. (1996) Linear logic, monads and the lambda calculus. Proc. Symposium on Logic in Computer Science, pp. 420-431.
5. Benton, P. N., Bierman, G. M., de Paiva, V. C. V. and Hyland, J. M. E. (1993) A term calculus for intuitionistic linear logic. In: Bezem, M. and Groote, J. F. (eds.), Proc. 1st Int. Conf. on Typed λ.-calculi and Applic., pp. 75-90. Lecture Notes in Computer Science. 664. Springer-Verlag.
6. Benton, P. N., Kennedy, A. J. and Russell, G. (1998) Compiling Standard ML to Java bytecodes. Proc. Int. Conf. on Functional Programming. (ACM SIGPLAN Notices, 34(1), 129-140, January 1999.)
7. Bierman, G. M. (1995) What is a categorical model of intuitionistic linear logic? Proc. 2nd Int. Conf. on Typed λ-calculi and Applic., pp. 78-93. Lecture Notes in Computer Science, 902. Springer-Verlag.
8. Bierman, G. M. (1997) Observations on a linear PCF. Technical Report 412, Computer Laboratory, University of Cambridge.
9. Braüner, T. (1994) The Girard translation extended with recursion. Proc. Conf. on Computer Science Logic, pp. 31-45. Lecture Notes in Computer Science, 933. Springer-Verlag.
10. Braüner, T. (1996) An axiomatic approach to adequacy. PhD thesis, Department of Computer Science, University of Århus, Denmark. (Available as BRICS Technical Report DS-96-4.)
11. Braüner, T. (1997) A general adequacy result for a linear functional language. Theor. Comput. Sci., 177(1), 27-58.
12. Chirimar, J., Gunter, C. A. and Riecke, J. G. (1996) Reference counting as a computational interpretation of linear logic. J. Functional Programming, 6(2), 195-244.
13. Croie, R.L. (1996) How linear is Howe? In: McCusker, G., Edalat, A. and Jourdan, S. (eds.), Advances in Theory and Formal Methods, pp. 60-72. Imperial College Press.
14. Di Cosmo, R. (1993) Deciding type isomorphisms in a type-assignment framework. J. Functional Programming, 3(4), 485-525.
15. Di Cosmo, R. (1995) Isomorphisms of Types: From λ-calculus to information retrieval and language design. Progress in Theoretical Computer Science. Birkhauser.
16. Girard, J.-Y. (1987) Linear logic. Theor. Comput. Sci., 50, 1-101.
17. Gordon, A.D. (1995) Bisimilarity as a theory of functional programming. 11th Ann. Conf. on Mathematical Foundations of Programming Semantics. Electronic Notes in Theoretical Computer Science, Elsevier.
18. Gordon, A. D. and Pitts, A. M. (eds.) (1998) Higher Order Operational Techniques in Semantics. Publications of the Newton Institute. Cambridge University Press.
19. Hashimoto, M. and Ohori, A. (1996) A typed context calculus. Technical Report RIMS-1098, Research Institute for Mathematical Sciences, Kyoto University.
20. Holmström, S. (1988) A linear functional language. Proc. Workshop on Implementation of Lazy Functional Languages, pp. 13-32. Aspenäs, Sweden. Programming Methodology Group, University of Göteborg and Chalmers University of Technology. PMG Tech Report 53.
21. Holmström, S. (1989) Quicksort in a linear functional language. Technical Report 65, Programming Methodology Group, University of Göteborg and Chalmers University of Technology.
22. Howe, D. J. (1996) Proving congruence of bisimulation in functional programming languages. Infor. & Control, 124(2), 103-112.
23. Mackie, I. (1994) Lilac: A functional programming language based on linear logic. J. Functional Programming, 4(4), 1-39.
24. Maraist, J., Odersky, M., Turner, D. N. and Wadler, P. (1995) Call-by-name, call-by-value, call-by-need and the linear lambda calculus. Proc. Conf. on Mathematical Foundations of Programming Semantics. Electronic Notes in Theoretical Computer Science. Elsevier.
25. Morrisett, G. (1995) Compiling with types. PhD thesis, School of Computer Science, Carnegie Mellon University. (Available as Technical Report CMU-CS-95-226.)
26. Pitts, A. M. (1994) Some notes on inductive and co-inductive techniques in the semantics of functional languages. Technical Report BRICS-NS-94-5, BRICS, Department of Computer Science, University of Århus.
27. Pitts, A. M. (1997) Operationally-based theories of program equivalence. In: Dybjer, P. and Pitts, A. M. (eds.), Semantics and Logics of Computation, pp. 241-298. Publications of the Newton Institute. Cambridge University Press.
28. Plotkin, G. D. (1977) LCF considered as a programming language. Theor. Comput. Sci., 5, 223-255.
29. Rittri, M. (1991) Using types as search keys in function libraries. J. Functional Programming, 1(1), 71-89.
30. Seely, R. A. G. (1989) Linear logic, *-autonomous categories and cofree algebras. In: Conference on Categories in Computer Science and Logic, pp. 371-382.
31. Wadler, P. (1990) Linear types can change the world! In: Broy, M. and Jones, C. (eds.), Programming Concepts and Methods. North Holland.
32. Wadler, P. (1991) Is there a use for linear logic? Proc. Symposium on Partial Evaluation and Semantics based Program Manipulation. (In ACM SIGPLAN Notices, 26(9), 255-273.)
33. Wakeling, D. (1990) Linearity and laziness. PhD thesis, University of York. (Available as Technical Report YCST 90/07.)
34. Wakeling, D. and Runciman, C. (1991) Linearity and laziness. Proc. Conference on Functional Programming Languages and Computer Architecture, pp. 215-240. Lecture Notes in Computer Science, 523. Springer-Verlag.
35. Winskel, G. (1993) The Formal Semantics of Programming Languages: An introduction. MIT Press.