J. Michael Spivey

Affiliations:
  • University of Oxford, UK


According to our database1, J. Michael Spivey authored at least 24 papers between 1985 and 2017.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Faster coroutine pipelines.
Proc. ACM Program. Lang., 2017

2012
When Maybe is not good enough.
J. Funct. Program., 2012

2009
Algebras for combinatorial search.
J. Funct. Program., 2009

2007
On Barron and Strachey's cartesian product function.
Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, 2007

2004
Fast, accurate call graph profiling.
Softw. Pract. Exp., 2004

2000
Functional Reading of Logic Programs.
J. Univers. Comput. Sci., 2000

Combinators for breadth-first search.
J. Funct. Program., 2000

Meeting the Challenge of Object-Oriented Programming.
Proceedings of the ZB 2000: Formal Specification and Development in Z and B, First International Conference of B and Z Users, York, UK, August 29, 2000

Higher-order transformation of logic programs.
Proceedings of the Extended Abstracts of the 10th International Workshop on Logic-based Program Synthesis and Transformation, 2000

1999
Algebra of Logic Programming.
Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

1996
Richer Types for Z.
Formal Aspects Comput., 1996

The Consistency Theorem for Free Type Definitions in Z.
Formal Aspects Comput., 1996

An introduction to logic programming through Prolog.
Prentice Hall International series in computer science, Prentice Hall, ISBN: 978-0-13-536047-7, 1996

1995
Unification: A Case-Study in Data Refinement.
Formal Aspects Comput., 1995

1992
Z Notation - a reference manual (2. ed.).
Prentice Hall International Series in Computer Science, Prentice Hall, ISBN: 978-0-13-978529-0, 1992

1990
Specifying a Real-Time Kernel.
IEEE Softw., 1990

A Functional Theory of Exceptions.
Sci. Comput. Program., 1990

Type Inference in Z.
Proceedings of the VDM '90, 1990

1989
An introduction to Z and formal specifications.
Softw. Eng. J., 1989

A Categorial Approch to the Theory of Lists.
Proceedings of the Mathematics of Program Construction, 1989

The Z notation - a reference manual.
Prentice Hall International Series in Computer Science, Prentice Hall, ISBN: 978-0-13-983768-5, 1989

Understanding Z - a specification language and its formal semantics (reprint).
Cambridge tracts in theoretical computer science 3, Cambridge University Press, ISBN: 978-0-521-33429-7, 1989

1987
Laws of Programming.
Commun. ACM, 1987

1985
Understanding Z : A specification language and its formal semantics.
PhD thesis, 1985


  Loading...