Behavioural specifications in type theory

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

Volumn 1130, Issue , 1996, Pages 395-408

  Mylonakis, Nikos ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; SPECIFICATIONS;

ALGEBRAIC SPECIFICATIONS; BEHAVIOURAL SPECIFICATIONS; DEPENDENT TYPES; TYPE THEORY;

ABSTRACT DATA TYPES;

EID: 84958616626     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61629-2_55     Document Type: Conference Paper

References (18)

1. Kent Petersson Bengt Nordstrom and Jan Smith. Programming in Martin-Lof's Type Theory: An Introduction. Oxford University Press, 1990.
2. M. Bidoit, H.-J. Kreowski, P. Lescanne, F. Orejas, and D. Sannella (eds.). Algebraic System Specification and Development: A survey and Annotated Bibliography, volume 501 of LNCS. Springer Verlag, 1991.
3. Michel Bidoit and Rolf Hennicker. Behavioural theories and the proof of behavioural properties. Report LIENS-95-5, Ecole Normale Superieure, 1995.
4. Michel Bidoit, Rolf Hennicker, and Martin Wirsing. Behavioural and abstractor specifications. Science of Computer Programming, 25(2-3):149-186, December1995.
5. Healfdene Goguen. A Typed Operational Semantics for Type Theory. PhD thesis, University of Edinburgh, September 1994. Also published as Technical Report CST-110-94, Department of Computer Science.
6. Rolf Hennicker. Context induction: a proof principle for behavioural abstractions and algebraic implementations. Formal Aspects of Computing, 4:326-345, 1991.
7. Martin Hofmann and Donald Sannella. On behavioural abstraction and behavioural satisfaction in higher-order logic. Report ECS-LFCS-95-318, Univ. of Edinburgh, 1995. To appear in Theoretical Computer Science.
8. Stefan Kahrs, Donald Sannella, and Andrzej Tarlecki. The definition of Extended ML: A gentle introduction. To appear in Theoretical Computer Science.
9. Stefan Kahrs, Donald Sannella, and Andrzej Tarlecki. The Definition of Extended ML. Technical Report ECS-LFCS-94-300, LFCS, August 1994.
10. Zhaohui Luo. Program specification and data refinement in type theory. Math. Struct, in Comp. Science, 3:333-63, 1993.
11. Zhaohui Luo. Computation and Reasoning: A Type Theory for Computer Science. Clarendon Press Oxford, 1994.
12. Zhaohui Luo and Randy Pollack. LEGO proof development system: User's manual. Report ECS-LFCS-92-211, Department of Computer Science, University of Edinburgh, May 1992.
13. Grant Malcolm and Joseph A. Goguen. Proving correctness of refinement and implementation. Technical Monograph PRG-114, Oxford University Computing Laboratory, 1994 (revised May 1995).
14. James Hugh McKinna. Deliverables: A Categorical Approach to Program Development in Type Theory. PhD thesis, University of Edinburgh, November 1992.
15. Robin Milner and Mads Tofte. Commentary on Standard ML. The MIT Press, 1991.
16. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. The MIT Press, 1990.
17. Simon Thompson. Type Theory and Functional Programming. Addison-Wesley, 1991.
18. Judith Underwood. Typing abstract data types. In Springer Verlag, editor, Selected Papers from the 10th Workshop on Specification of Abstract Data Types, Santa Margherita Ligure, number 906 in LNCS, 1995