Blue Line
[Home] [Writings] [Qualifications]
Blue Line
Redirecting to  http://dwolfram.googlepages.com/writings. Please update links.

 

David Wolfram: Writings

A  version of the list below is available via The Collection of Computer Science Bibliographies. Another list is part of the DBLP Bibliography Server.

For citations of my writings, please see Google Scholar or CiteSeer.

 I am happy to post you a copy of any paper listed below. For further information about a paper, just click on its title. A collection of their abstracts appears here.

Editor

  1. D A Wolfram.
    Guest Editor, Australasian Computing Theory, a Special Issue of Theoretical Computer Science, Volume 298, Number 2 (Elsevier, Amsterdam, 8 April 2003). 112 pages. Preface, page 273.

  2. D A Wolfram.
    Guest Editor, Proceedings of Computing: the Australasian Theory Symposium, 2000, Volume 31 of Electronic Notes in Theoretical Computer Science. (Elsevier, Amsterdam, 2000).

Book

  1. D A Wolfram.
    The Clausal Theory of Types, Volume 21 of Cambridge Tracts in Theoretical Computer Science. (Cambridge University Press, 1993).

Technical Writing

  1. Microsoft Corporation.
    Managed Extensions for C++ Specification, MSDN Library, 2001, 109 pp.
    Also available with Visual Studio .NET under Vc7\managedextensionsspec.doc.

  2. Microsoft Corporation.
    Managed Extensions for C++ Migration Guide, Parts I & II, MSDN Library, 2001., 34 pp.
    Also available with Visual Studio .NET under Vc7\migration_guide.doc.

Journal Papers

  1. D A Wolfram.
    A formula for the general solution of a constant-coefficient difference equation. Journal of Symbolic Computation 29, 1 (2000) 79-82. (PDF)

  2. Paliath Narendran, Qing Guo, and D A Wolfram.
    Complexity of nilpotent unification and matching problems. Information and Computation 162, 1/2 (2000) 3-23. (PDF)

  3. D A Wolfram.
    Solving generalized Fibonacci recurrences. The Fibonacci Quarterly 36.2 (May 1998): 129-45. (PDF)
     
  4. D A Wolfram.
    An appraisal of INTERNIST-I. Artificial Intelligence in Medicine 7 (1995) 93-116. (PDF)

  5. D A Wolfram.
    A semantics for lambda Prolog. Selected Papers of the Meeting on Mathematical Foundations of Programming Semantics (MFPS 8) Part II, (Oxford, 1992) Theoretical Computer Science, 136, 1 (1994) 277-289. (PDF)

  6. D A Wolfram.
    Forward checking and intelligent backtracking. Information Processing Letters, 32:85-87, 1989. (PDF)

  7. D A Wolfram.
    Intractable unifiability problems and backtracking. Journal of Automated Reasoning, 5:37-47, 1989. (PDF)

Invited Lecture

  1. Joseph A Goguen and David Wolfram.
    On Types and FOOPS. In Robert Meersman, William Kent and Samit Khosla, (editors), Proceedings of the Fourth IFIP TC-2 Working Conference on Data Semantics (DS-4): Object Oriented Databases: Analysis, Design & Construction, Windermere, 2-6 July 1990. Organized by Working Group 2.6 (Database), (North-Holland, Amsterdam, 1991) 1-22.

Refereed Conference Papers

  1. Karsten Konrad and D.A. Wolfram.
    System Description: Kimba, a model generator for many-valued first-order logics. In Harald Ganzinger, editor, Automated Deduction - CADE-16: Sixteenth International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 1632 (Springer, Berlin, 1999) 282-286.
    Kimba is part of MathWeb and is used in the DORIS system for computational semantics of natural language. (PDF)

  2. Paliath Narendran, Qing Guo, and D.A. Wolfram.
    Unification and matching modulo nilpotence. In: Michael McRobbie and John Slaney, editors, Automated Deduction - CADE-13: Thirteenth International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 1104 (Springer, Berlin, 1996) 261-274.

  3. D A Wolfram.
    Semantics for Abstract Clauses. In Henk Barendregt and Tobias Nipkow, editors, Types for Proofs and Programs: International Workshop TYPES '93, Selected Papers, Lecture Notes in Computer Science 806 (Springer, Berlin, 1994) 366-383.

  4. D A Wolfram and Joseph A. Goguen.
    A sheaf semantics for FOOPS expressions (extended abstract). In Mario Tokoro, Oscar Nierstrasz and Peter Wegner, editors, Object-Based Concurrent Computing, Lecture Notes in Computer Science 612 (Springer, Berlin, 1992) 81-98. European Conference on Object-Oriented Programming (ECOOP '91) Workshop, Geneva, Switzerland, July 1991.

  5. D A Wolfram.
    Rewriting, and equational unification: the higher-order cases (extended abstract). In Ronald V. Book, editor, Rewriting Techniques and Applications, Fourth International Conference, RTA-91, Lecture Notes in Computer Science 488 (Springer, Berlin, 1991) 25-36.

  6. D A Wolfram.
    ACE: the abstract clause engine. In Mark E. Stickel, editor, Proceedings of the Tenth International Conference on Automated Deduction (CADE-10), Lecture Notes in Artificial Intelligence 449 (Springer, Berlin, 1990) 679-680. This is a system description of ACE.

  7. D A Wolfram.
    Intractable unifiability problems and backtracking. In Ehud Shapiro, editor,Third International Conference on Logic Programming, Lecture Notes in Computer Science 225 (Springer, Berlin, 1986) 107-121.

  8. D A Wolfram, M J Maher and J-L. Lassez.
    A unified treatment of resolution strategies for logic programs. In Sten-Åke Tärnlund, editor, Proceedings of the Second International Logic Programming Conference, pages 263-276. University of Uppsala, Sweden, 1984. (Presented by D.A. Wolfram)

Dissertation and Thesis

  1. D A Wolfram.
    The Clausal Theory of Types. PhD Dissertation, University of Cambridge, March 1990.

  2. D A Wolfram.
    Adaptive Backtracking. M.Sc. Thesis, The University of Melbourne, x+163 pages, July 1985.

Abstracts

  1. D A Wolfram.
    An implementation of higher-order rewriting (extended abstract). Technical Report PRG-TR-8-93, Oxford University Computing Laboratory, 1993.

  2. Paliath Narendran and D A Wolfram.
    The complexity of two simple unifiability problems. In Franz Baader and Wayne Snyder, editors, Proceedings of the Seventh International Workshop on Unification, UNIF'93, Boston University Computer Science Department, USA, 1993, 42-47.

  3. D A Wolfram.
    The decidability of higher-order matching. In Franz Baader, Jörg Siekmann and Wayne Snyder, editors, Sixth International Workshop on Unification, UNIF '92. Internationales Begegnungs- und Forschungszentrum für Informatik Schloß Dagstuhl, Germany, July 1992. Dagstuhl-Seminar-Report; 42, 29.07-31.07.92 (9231) 11.

  4. D A Wolfram.
    A sheaf semantics for an object-oriented language. In Hans-Dieter Ehrich, Joseph A. Goguen and Amilcar Sernadas, editors, Foundations of Information Systems Specification and Design. Internationales Begegnungs- und Forschungszentrum für Informatik Schloß Dagstuhl, March 1992. Dagstuhl-Seminar-Report; 35, 16.03-19.03.92 (9212) 29.