A compositional logic for polymorphic higher-order functions

Proceedings of the Sixth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP'04

Volumn , Issue , 2004, Pages 191-202

  Honda, Kohei ^a   Yoshida, Nobuko ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Language; Theory; Verification

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; DIFFERENTIATION (CALCULUS); LOGIC PROGRAMMING; OBJECT ORIENTED PROGRAMMING;

COMPOSITE PROGRAMS; COMPOSITIONAL LOGIC; NATURAL NUMBERS; POLYMORPHIC FUNCTIONS;

MATHEMATICAL TRANSFORMATIONS;

EID: 11244317202     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1013963.1013985     Document Type: Conference Paper

References (42)

1. Abadi, M., TT-closed relations and admissibility, MSCS 10(3) (June 2000), 313-320.
2. Abadi, M., Cardelli, L., Curien, P.-L., Formal Parametric Polymorphism, TCS 121,1-2, (Dec), 9-58. Elsevier, 1993.
3. Abadi, M. and Leino, R. A logic for object-oriented programs. Technical Report SRC-161, Compaq SRC, 1998.
4. Abramsky, S., Domain Theory in Logical Form, Annuals of Pure and Applied Logic, 51:1-77, 1991.
5. Barbanera, F., Dezani-Ciancaglini, M. and de'Liguoro, U., Intersection and Union Types: syntax and semantics. Inf. and Comp., 119:202-230, 1995.
6. Berger, M., Honda, K. and Yoshida, N., Sequentiality and the π-Calculus, TLCA01, LNCS 2044, 29-45, Springer, 2001.
7. Berger, M., Honda, K. and Yoshida, N., Genericity and the π-Calculus, FoSSaCs'03, LNCS 2620, 103-119, Springer, 2003.
8. Bornat, R., Proving pointer programs in Hoare Logic. Mathematics and Program Construction, 2000.
9. Caml Home Page, http://caml.inria.fr/.
10. Calcagno, C., O'Hearn, P. and Bornat, R. Program logic and equivalence in the presence of garbage collection. TCS, 298(3):557-581, 2003.
11. Coppo, M. and Dezani-Ciancaglini, M. An extension of basic functionality theory of lambda-calculus. Notre Dame J. Formal Log. 21:685-693, 1980.
12. Damiani.F., Dezani-Ciancaglini, M. and Giannini, P. A filter model for mobile processes. MSCS, 9(1):63-101, 1999.
13. Dunfield, J. and Pfenning, F., Type Assignment for Intersections and Unions in Call-by-Value, FoSSaCs'03, LNCS 2620, 250-266, Springer, 2003.
14. Gordon, M., Milner, A. and Wadsworth, C., Edinburgh LCF, LNCS 78, Springer, 1979.
15. Gunter, C., Semantics of Programming Languages: Structures and Techniques, MIT Press, 1992.
16. Floyd, W. Assigning meaning to programs. Prc. Symp. in Applied Mathematics. 19:19-32, 1967.
17. The Haskell home page, http://haskell.org.
18. Hennessy, M. and Milner, R. Algebraic Laws for Nondeterminism and Concurrency. Journal of ACM, 32:1, pp.137-161, 1985.
19. Hoare, C.A.R. An axiomatic basis of computer programming. CACM, 12:576-580, 1969.
20. Honda, K., Sequential Process Logics: Soundness Proofs. Typescript, 50pp. November 2003. Available at: www.dcs.qmul.ac.uk/∼kohei/logics.
21. Honda, K., Process Logic and Duality: Part (1) Sequential Processes. Typescript, 234pp, March 2004. Available at: www.dcs.qmul.ac.uk/∼kohei/ logics.
22. Honda, K. From Process Logic to Program Logic. A short version of Sections 1-3 and 6 in [21], ICFP'04, ACM, 2004.
23. Java home page. Sun Microsystems Inc., http://www.javasoft.com/, 1995.
24. U. de' Liguoro, Characterizing convergent terms in object calculi via intersection types, TLCA'01, LNCS 2044. Springer, 2001.
25. Mendelson, E., Introduction to Mathematical Logic (third edition). Wadsworth Inc., 1987.
26. Milner, R., Functions as Processes, MSCS. 2(2): 119-141, 1992
27. Milner, R., Tofte, M. and Harper, R.W, The Definition of Standard ML, MIT Press, 1990.
28. Milner, R., Parrow, J. and Walker, D., A Calculus of Mobile Processes, Info. & Comp. 100(1):1-77, 1992.
29. Microsoft Corporation .NET Framework Developer's Guide, http: //msdn.microsoft.com, 2003.
30. O'Hearn, P., Yang, H. and Reynolds, J., Separation and Information Hiding, POPL'04, 268-280, 2004.
31. Pierce, B.C., Types and Programming Languages, MIT Press, 2002.
32. Pitts, A.M., Existential Types: Logical Relations and Operational Equivalence, Proceedings ICALP'98, LNCS 1443, 309-326, Springer, 1998.
33. Pitts, A.M., Parametric Polymorphism and Operational Equivalence, Mathematical Structures in Computer Science, 2000, 10:321-359.
34. Plotkin, G. and Abadi, M., A Logic for Parametric Polymorphism, LICS'98,42-53, IEEE Press, 1998.
35. Reynolds, J. Idealized Algol and its specification logic. Tools and Notions for Program Construction, 121-161, CUP.
36. Reynolds, J. Intuitionistic Reasoning about Shared Mutable Data Structure, Millennial Perspectives in Computer Science, 2000. Palgrave.
37. Reynolds, J., Separation logic: a logic for shared mutable data structures. Invited Paper, LICS 2002.
38. van Bakel, S., Intersection Type Assignment Systems. TCS, 151(2):385-435, 1995.
39. Wadler, P. Theorems for Free. Functional Programming and Computer Architecture, Adison Wesley, 1989.
40. Winskel, G. The Formal Semantics of Programming Languages. MIT Press, 1993.
41. Yoshida, N., Berger, M. and Honda, K., Strong Normalisation in the π-Calculus, LICS'01, 311-322, IEEE, 2001. A full version in Journal of Info. & Comp., 191 (2004) 145-202, Elsevier.
42. Yoshida, N., Berger, M. and Honda, K., Strong Normalisation in the π-Calculus, LICS'01, 311-322, IEEE, 2001. A full version in Journal of Info. & Comp., 191 (2004) 145-202, Elsevier.