A higher-order simulation relation for system F

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1784 LNCS, Issue , 2000, Pages 130-145

  Hannay, Jo Erskine ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DATA TYPES; COMPUTATION THEORY; SEMANTICS; SPECIFICATIONS;

HIGHER ORDER SIMULATIONS; HIGHER-ORDER; OBSERVATIONAL EQUIVALENCES; PARAMETRIC POLYMORPHISM; POLYMORPHIC FUNCTIONS; SEMANTIC LEVELS; SIMULATION RELATION; SPECIFICATION REFINEMENTS;

COMPUTER CIRCUITS; COMPUTATION THEORY;

EID: 35248859133     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46432-8_9     Document Type: Conference Paper

References (42)

1. M. Abadi, L. Cardelli, and P.-L. Curien. Formal parametric polymorphism. Theoretical Computer Science, 121: 9-58, 1993.
2. D. Aspinall. Type Systems for Modular Programs and Specifications. PhD thesis, University of Edinburgh, 1998.
3. E.S. Bainbridge, P.J. Freyd, A. Scedrov, and P.J. Scott. Functorial polymorphism. Theoretical Computer Science, 70: 35-64, 1990. (Pubitemid 20658377)
4. M. Bidoit and R. Hennicker. Behavioural theories and the proof of behavioural properties. Theoretical Computer Science, 165: 3-55, 1996. (Pubitemid 126412032)
5. M. Bidoit, R. Hennicker, and M. Wirsing. Behavioural and abstractor specifications. Science of Computer Programming, 25: 149-186, 1995.
6. M. Bidoit, R. Hennicker, and M. Wirsing. Proof systems for structured specifications with observability operators. Theoretical Computer Sci., 173: 393-443, 1997. (Pubitemid 127451498)
7. C. Böhm and A. Beraducci. Automatic synthesis of typed λ-programs on term algebras. Theoretical Computer Science, 39: 135-154, 1985. (Pubitemid 16487561)
8. V. Breazu-Tannen and T. Coquand. Extensional models for polymorphism. Theoretical Computer Science, 59: 85-114, 1988.
9. M. Cerioli, M. Gogolla, H. Kirchner, B. Krieg-Brückner, Z. Qian, and M. Wolf. Algebraic System Specification and Development. Survey and Annotated Bibliography, 2nd Ed., volume 3 of Monographs of the Bremen Institute of Safe Systems. Shaker, 1997. 1st edition available in LNCS 501, Springer, 1991.
10. J.A. Goguen. Parameterized programming. IEEE Transactions on Software Engineering, SE-10(5): 528-543, 1984.
11. J.A. Goguen and R. Burstall. CAT, a system for the structured elaboration of correct programs from structured specifications. Tech. Rep. CSL-118, SRI International, 1980.
12. J.E. Hannay. Specification refinement with System F. In Proc. CSL'99, volume 1683 of LNCS, pages 530-545, 1999.
13. J.E. Hannay. Specification refinement with System F, the higher-order case. Submitted for publication, 2000.
14. R. Hasegawa. Parametricity of extensionally collapsed term models of polymorphism and their categorical properties. In Proc. TACS'91, volume 526 of LNCS, pages 495-512, 1991.
15. R. Hennicker. Structured specifications with behavioural operators: Semantics, proof methods and applications. Habilitationsschrift, LMU, München, 1997.
16. C.A.R. Hoare. Proofs of correctness of data representations. Acta Inform., 1: 271-281, 1972.
17. F. Honsell, J. Longley, D. Sannella, and A. Tarlecki. Constructive data refinement in typed lambda calculus. In Proc. FOSSACS 2000, LNCS, 2000.
18. F. Honsell and D. Sannella. Prelogical relations. In Proc. CSL'99, volume 1683 of LNCS, pages 546-561, 1999.
19. A. Jung and J. Tiuryn. A new characterization of lambda definability. In Proc. of TLCA 93, volume 664 of LNCS, pages 245-257, 1993.
20. Y. Kinoshita, P.W. O'Hearn, A.J. Power, M. Takeyama, and R.D. Tennent. An axiomatic approach to binary logical relations with applications to data refinement. In Proc. of TACS'97, volume 1281 of LNCS, pages 191-212, 1997. (Pubitemid 127117792)
21. Y. Kinoshita and A.J. Power. Data refinement for call-by-value programming languages. In Proc. CSL'99, volume 1683 of LNCS, pages 562-576, 1999.
22. Z. Luo. Program specification and data type refinement in type theory. Math. Struct. in Comp. Sci., 3: 333-363, 1993.
23. Q. Ma and J.C. Reynolds. Types, abstraction and parametric polymorphism, part 2. In Proc. 7th MFPS, volume 598 of LNCS, pages 1-40, 1991.
24. H. Mairson. Outline of a proof theory of parametricity. In ACM Symposium on Functional Programming and Computer Architecture, volume 523 of LNCS, pages 313-327, 1991.
25. J.C. Mitchell. On the equivalence of data representations. In V. Lifschitz, editor, Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pages 305-330. Academic Press, 1991.
26. J.C. Mitchell. Foundations for Programming Languages. MIT Press, 1996.
27. J.C. Mitchell and G.D. Plotkin. Abstract types have existential type. ACM Trans. on Programming Languages and Systems, 10(3): 470-502, 1988.
28. N. Mylonakis. Behavioural specifications in type theory. In Recent Trends in Data Type Spec., 11th WADT, volume 1130 of LNCS, pages 394-408, 1995. (Pubitemid 126124997)
29. A.M. Pitts. Parametric polymorphism and operational equivalence. In Proc. 2nd Workshop on Higher Order Operational Techniques in Semantics, volume 10 of ENTCS. Elsevier, 1997.
30. A.M. Pitts. Existential types: Logical relations and operational equivalence. In Proc. ICALP'98, volume 1443 of LNCS, pages 309-326, 1998. (Pubitemid 128111125)
31. G. Plotkin and M. Abadi. A logic for parametric polymorphism. In Proc. of TLCA 93, volume 664 of LNCS, pages 361-375, 1993.
32. G.D. Plotkin, A.J. Power, and D. Sannella. A compositional generalisation of logical relations. Submitted for publication, 2000.
33. E. Poll and J. Zwanenburg. A logic for abstract data types as existential types. In Proc. TLCA'99, volume 1581 of LNCS, pages 310-324, 1999.
34. B. Reus and T. Streicher. Verifying properties of module construction in type theory. In Proc. MFCS'93, volume 711 of LNCS, pages 660-670, 1993.
35. J.C. Reynolds. Types, abstraction and parametric polymorphism. Information Processing, 83: 513-523, 1983.
36. D. Sannella and A. Tarlecki. On observational equivalence and algebraic specification. Journal of Computer and System Sciences, 34: 150-178, 1987.
37. D. Sannella and A. Tarlecki. Toward formal development of programs from algebraic specifications: Implementations revisited. Acta Inform., 25(3): 233-281, 1988. (Pubitemid 18608114)
38. D. Sannella and A. Tarlecki. Essential concepts of algebraic specification and program development. Formal Aspects of Computing, 9: 229-269, 1997. (Pubitemid 127524206)
39. O. Schoett. Data Abstraction and the Correctness of Modular Programming. PhD thesis, University of Edinburgh, 1986.
40. T. Streicher and M. Wirsing. Dependent types considered necessary for specification languages. In Recent Trendsin Data Type Spec., volume 534 of LNCS, pages 323-339, 1990.
41. J. Underwood. Typing abstract data types. In Recent Trends in Data Type Spec., Proc. 10th WADT, volume 906 of LNCS, pages 437-452, 1994.
42. J. Zwanenburg. Object-Oriented Concepts and Proof Rules: Formalization in Type Theory and Implementation in Yarrow. PhD thesis, Technische Universiteit Eindhoven, 1999.