2007 |
16 | EE | Olivier Danvy,
J. Michael Spivey:
On Barron and Strachey's cartesian product function.
ICFP 2007: 41-46 |
2004 |
15 | EE | J. Michael Spivey:
Fast, accurate call graph profiling.
Softw., Pract. Exper. 34(3): 249-264 (2004) |
2000 |
14 | EE | Silvija Seres,
J. Michael Spivey:
Higher-order transformation of logic programs.
LOPSTR 2000 |
13 | EE | Silvija Seres,
J. Michael Spivey:
Higher-Order Transformation of Logic Programs.
LOPSTR (LNCS 2042: Selected Papers) 2000: 57-68 |
12 | EE | J. Michael Spivey:
Meeting the Challenge of Object-Oriented Programming.
ZB 2000: 1 |
11 | | J. Michael Spivey:
Combinators for breadth-first search.
J. Funct. Program. 10(4): 397-408 (2000) |
10 | EE | Silvija Seres,
J. Michael Spivey:
Functional Reading of Logic Programs.
J. UCS 6(4): 433-446 (2000) |
1999 |
9 | | Silvija Seres,
J. Michael Spivey,
C. A. R. Hoare:
Algebra of Logic Programming.
ICLP 1999: 184-199 |
1996 |
8 | | J. Michael Spivey:
The Consistency Theorem for Free Type Definitions in Z.
Formal Asp. Comput. 8(3): 369-375 (1996) |
7 | | J. Michael Spivey:
Richer Types for Z.
Formal Asp. Comput. 8(5): 565-584 (1996) |
1995 |
6 | | J. Michael Spivey:
Unification: A Case-Study in Data Refinement.
Formal Asp. Comput. 7(2): 150-168 (1995) |
1990 |
5 | | J. Michael Spivey,
Bernard Sufrin:
Type Inference in Z.
VDM Europe 1990: 426-451 |
4 | | J. Michael Spivey:
Specifying a Real-Time Kernel.
IEEE Software 7(5): 21-28 (1990) |
3 | | J. Michael Spivey:
A Functional Theory of Exceptions.
Sci. Comput. Program. 14(1): 25-42 (1990) |
1989 |
2 | | J. Michael Spivey:
A Categorial Approch to the Theory of Lists.
MPC 1989: 399-408 |
1987 |
1 | | C. A. R. Hoare,
Ian J. Hayes,
Jifeng He,
Carroll Morgan,
A. W. Roscoe,
Jeff W. Sanders,
Ib Holm Sørensen,
J. Michael Spivey,
Bernard Sufrin:
Laws of Programming.
Commun. ACM 30(8): 672-686 (1987) |