Beyond fun: Order and membership in polytypic imperative programming

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

Volumn 1422, Issue , 1998, Pages 286-314

  Naumann, David A ^a  

^a STEVENS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

COMPATIBLE RELATIONS; FUNCTION SPACES; FUNCTIONAL PROGRAMS; HIGHER-ORDER; IMPERATIVE PROGRAMMING; IMPERATIVE PROGRAMS; MONOTONIC FUNCTIONS; PROGRAM DERIVATION;

CALCULATIONS;

EID: 84957588525     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054296     Document Type: Conference Paper

References (19)

1. R. Bird and O. de Moor. Algebra of Programming. Prentice-Hall, 1996.
2. R. Cockett and D. Spencer. Strong categorical datatypes I. In R. A. G. Seely, editor, International Meeting on Category Theory 1991, Canadian Mathematical Society Proceedings. AMS, 1992.
3. O. de Moor. Inductive data types for predicate transformers. Int. Process. Lett., 43(3):113-118, 1992.
4. O. de Moor. An exercise in polytypic programming: repmin. Typescript, www.comlab.ox.ac.uk/ouc]/pubfications/books/algebra/papers/repmin.ps.gz., Sept. 1996.
5. P. Gardiner. Algebraic proofs of consistency and completeness. Theoretical Cornput. Sci., 150:161-191, 1995.
6. P. H. Gardiner, C. E. Martin, and O. de Moor. An algebraic construction of predicate transformers. Science of Computer Programming, 22:21-44, 1994.
7. P. Hoogendijk. A generic theory of data types. Dissertation, Technische Universiteit Eindhoven, 1997.
8. P. Hoogendijk and O. de Moor. What is a data type? Technical Report 96/16, Eindhoven University of Technology, 1996. www.win.tue.nl/win/cs/wp/papers.
9. P. Jansson and J. Jeuring. PolyP — a polytypic programming language extension. In Proceedings, Principles of Programming Languages, pages 470-82. ACM Press, 1997.
10. C. Martin. Towards a calculus of predicate transformers. In Proceedings, Mathematical Foundations of Computer Science, volume 969 of Springer LNCS, pages 489-49, 1995.
11. C. Martin, C. Hoare, and J. He. Pre-adjunctions in order enriched categories. Mathematical Structures in Computer Science, 1:141-158, 1991.
12. E. Moggi. Notions of computation and monads. Information and Computation, 93:55-92, 1991.
13. C. Morgan. Programming from Specifications, second edition. Prentice Hall, 1994.
14. D. A. Naumann. Predicate transformer semantics of an Oberon-like language. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi, IFIP Transactions A-56. Elsevier, 1994.
15. D. A. Naumann. A recursion theorem for predicate transformers on inductive data types. Inf. Process. Lett., 50:329-336, 1994.
16. D. A. Naumann. Predicate transformers and higher order programs. Theoretical Comput. Sci., 150:111-159, 1995.
17. D. A. Naumann. A categorical model for higher order imperative programming. Mathematical Structures in Computer Science, 1996. To appear.
18. D. A. Naumann. Towards squiggly refinement algebra. In W.-P. de Roever and D. Gries, eds., IFIP Working Conference on Programming Concepts and Methods. Chapman and Hall, 1998.
19. J. Power and E. Robinson. Premonoidal categories and notions of computation. Mathematical Structures in Computer Science, 7:453-468, 1997.