Predicate Transformers and Higher-Order Programs

[1]  Oege de Moor,et al.  Categories, relations and dynamic programming , 1994, Mathematical Structures in Computer Science.

[2]  Benjamin C. Pierce,et al.  Basic category theory for computer scientists , 1991, Foundations of computing.

[3]  C. A. R. Hoare,et al.  Pre-adjunctions in order enriched categories , 1991, Mathematical Structures in Computer Science.

[4]  Clare E. Martin,et al.  An Algebraic Construction of Predicate Transformers , 1994, Sci. Comput. Program..

[5]  Clare Martin,et al.  Preordered categories and predicate transformers , 1992 .

[6]  David Andrew Naumann.  Two-categories and program structure: data types, refinement calculi, and predicate transformers , 1992 .

[7]  R. Street,et al.  Review of the elements of 2-categories , 1974 .

[8]  David A. Naumann,et al.  Predicate Transformer Semantics of an Oberon-Like Language , 1994, Programming Concepts and Methods.

[9]  Edsger W. Dijkstra,et al.  A method of programming , 1988 .

[10]  Ralph-Johan Back,et al.  Exploring Summation and Product Operators in the Refinement Calculus , 1995, MPC.

[11]  John W. Backus,et al.  Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.

[12]  Wim H. Hesselink,et al.  Modalities of nondeterminacy , 1990 .

[13]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[14]  Carroll Morgan.  Procedures, parameters, and abstraction: Separate concerns , 1988, Sci. Comput. Program..

[15]  Carroll Morgan,et al.  The specification statement , 1988, TOPL.

[16]  Edsger W. Dijkstra,et al.  Predicate Calculus and Program Semantics , 1989, Texts and Monographs in Computer Science.

[17]  C. A. R. Hoare,et al.  Laws of programming , 1987, CACM.

[18]  John C. Reynolds,et al.  The craft of programming , 1981, Prentice Hall International series in computer science.

[19]  Albert R. Meyer,et al.  Towards a fully abstract semantics for local variables: Preliminary report , 1988 .

[20]  Chris F. Kemerer.  Corrigenda: an empirical validation of software cost estimation models , 1987, CACM.

[21]  Raymond Hoofman,et al.  The theory of semi-functors , 1993, Mathematical Structures in Computer Science.

[22]  Oege de Moor.  Inductive Data Types for Predicate Transformers , 1992, Inf. Process. Lett..

[23]  Robert D. Tennent,et al.  Semantics of programming languages , 1991, Prentice Hall International Series in Computer Science.

[24]  Samson Abramsky,et al.  Domain Theory in Logical Form , 1991, LICS.

[25]  Ralph-Johan Back.  Refinement Calculus, Lattices and Higher Order Logic , 1992, NATO ASI PDC.

[26]  Robert D. Tennent,et al.  Semantical Analysis of Specification Logic , 1985, Inf. Comput..

[27]  Carroll Morgan,et al.  Programming from specifications , 1990, Prentice Hall International Series in computer science.

[28]  Luca Cardelli,et al.  On understanding types, data abstraction, and polymorphism , 1985, CSUR.

[29]  Richard S. Bird,et al.  Lectures on Constructive Functional Programming , 1989 .

[30]  Manfred Broy.  Program Design Calculi , 1993, NATO ASI Series.

[31]  A. Bijlsma.  Calculating with Procedure Calls , 1993, Inf. Process. Lett..

[32]  W. Hesselink.  Beauty is our business , 1990 .

[33]  Gordon D. Plotkin,et al.  Dijkstras Predicate Transformers & Smyth's Power Domaine , 1979, Abstract Software Specifications.

[34]  Ralph-Johan Back,et al.  Correctness preserving program refinements: Proof theory and applications , 1980 .

[35]  Anne Kaldewaij,et al.  Programming - the derivation of algorithms , 1990, Prentice Hall international series in computer science.

[36]  David A. Naumann,et al.  A Recursion Theorem for Predicate Transformers on Inductive Data Types , 1994, Inf. Process. Lett..

[37]  Manfred Broy,et al.  Constructive Methods in Computing Science , 1989, NATO ASI Series.

[38]  Lambert Meertens,et al.  Algorithmics : towards programming as a mathematical activity , 1986 .