Michael Fourman: bibliography

Michael Paul Fourman, Yao Chen, Richboy Echomgbe, and Jing Yang. Measuring the digital divide. Preprint: http://homepages.inf.ed.ac.uk/mfourman/research/publications/pdf/fourman2015-measuring-the-digital-divide.pdf (to appear), August 2015.

@unpublished{fourman2015measuring,
  author = {Fourman, Michael Paul  and Chen, Yao and Echomgbe, Richboy and Yang,Jing},
  title = {Measuring the Digital Divide},
  note = {Preprint: \url{http://homepages.inf.ed.ac.uk/mfourman/research/publications/pdf/fourman2015-measuring-the-digital-divide.pdf} (to appear)},
  optkey = {},
  month = {August},
  year = {2015},
  optannote = {}
}

Michael P. Fourman. Hitting Buneman circles. In Peter Buneman Festschrift 2013, LNCS, Edinburgh, October 2013. Springer. to appear.

@inproceedings{fourman2013hitting,
  author = {Michael P. Fourman},
  title = {Hitting {B}uneman Circles},
  year = {2013},
  address = {Edinburgh},
  publisher = {Springer},
  series = {{LNCS}},
  booktitle = {Peter {B}uneman Festschrift 2013},
  month = {October},
  note = {to appear},
  abstract = {We discuss Peter Buneman's suggestion that a fibre connection to the internet --- a hub --- 
            should be available within every circle enclosing a population of at least 2,000 people (a b-circle). 
            This poses the problem of finding a small set, $H$, of hubs, such that \emph{every} b-circle contains a hub.
            We show that a greedy algorithm does not lead to an optimal set of hubs. Instead it models market forces, 
            which are naturally greedy. An unfettered market will exploit the most profitable communities and, just like 
            a greedy algorithm, leave gaps that it is uneconomic to fill.
            We describe a geometric heuristic for the discovery of efficient hub placements satisfying a purely 
            combinatorial analogue of Buneman's criterion, and apply it to illustrate the inherent inefficiency of a 
            market-led broadband policy.},
  keywords = {hitting set, approximation algorithm, facilities location, broadband, market forces},
  url = {http://homepages.inf.ed.ac.uk/mfourman/research/publications/pdf/fourman2013-hitting-buneman-circles.pdf}
}

Michael P. Fourman. Continuous truth II: Reflections. In Leonid Libkin, Ulrich Kohlenbach, and Ruy J. Guerra B. de Queiroz, editors, WoLLIC 2013, volume 8071 of LNCS, pages 153--167, Heidelberg, August 2013. Springer. to appear.

@inproceedings{fourman2013continuous,
  author = {Michael P. Fourman},
  title = {Continuous Truth {II}: Reflections},
  year = {2013},
  editor = {Libkin, Leonid and Kohlenbach, Ulrich and de Queiroz, Ruy J. Guerra B.},
  address = {Heidelberg},
  booktitle = {{W}o{LLIC} 2013},
  publisher = {Springer},
  series = {{LNCS}},
  volume = {8071},
  pages = {153--167},
  month = {August},
  note = {to appear},
  abstract = {In the late 1960s, Dana Scott first showed how the Stone\,-Tarski 
            topological interpretation of Heyting's calculus could be extended to model intuitionistic 
            analysis; in particular Brouwer's continuity principle.
            In the early '80s we and others outlined a general treatment of non-constructive
            objects, using \emph{sheaf models}---constructions from topos theory---to model not
            only Brouwer's non-classical conclusions, but also his creation of ``new mathematical 
            entities''. These categorical models are intimately related to, but more general than 
            Scott's topological model.

            The primary goal of this paper is to consider the question
            of iterated extensions. Can we derive new insights by repeating the
            second act? 

            In  \emph{Continuous Truth I}, presented at Logic Colloquium '82 in
            Florence, we showed that general principles of continuity, local
            choice and local compactness hold in the gros topos of
            sheaves over the category of separable locales equipped with the open
            cover topology. 

            We touched on the question of iteration. Here we develop a more general 
            analysis of iterated categorical extensions, that leads to a reflection 
            schema for statements of predicative analysis.

            We also take the opportunity to revisit some aspects of both Continuous 
            Truth I and Formal Spaces (Fourman \& Grayson 1982), and correct two 
            long-standing errors therein. },
  keywords = {sheaf model, logic, intuitionism, predicative, analysis, topos.},
  url = {http://homepages.inf.ed.ac.uk/mfourman/research/publications/pdf/fourman2013-continuous-truth-II.pdf}
}

Michael P. Fourman. Logics for action. In Prasad [5], pages 1223--1237.

@inproceedings{fourman07b,
  author = {Michael P. Fourman},
  title = {Logics for Action},
  crossref = {DBLP:conf/iicai/2007},
  pages = {1223-1237},
  url = {http://homepages.inf.ed.ac.uk/mfourman/research/publications/pdf/fourman2007-logics-for-action.pdf}
}
@proceedings{DBLP:conf/iicai/2007,
  editor = {Bhanu Prasad},
  title = {Proceedings of the 3rd Indian International Conference on
               Artificial Intelligence, Pune, India, December 17-19, 2007},
  booktitle = {IICAI},
  publisher = {IICAI},
  year = {2007},
  month = {December},
  isbn = {978-0-9727412-2-4}
}

Bhanu Prasad, editor. Proceedings of the 3rd Indian International Conference on Artificial Intelligence, Pune, India, December 17-19, 2007. IICAI, December 2007.

@proceedings{DBLP:conf/iicai/2007,
  editor = {Bhanu Prasad},
  title = {Proceedings of the 3rd Indian International Conference on
               Artificial Intelligence, Pune, India, December 17-19, 2007},
  booktitle = {IICAI},
  publisher = {IICAI},
  year = {2007},
  month = {December},
  isbn = {978-0-9727412-2-4}
}

Michael P. Fourman. Categorical perspectives. October 2007.

@unpublished{fourman07c,
  author = {Michael P. Fourman},
  title = {Categorical Perspectives},
  year = {2007},
  month = {October},
  url = {http://homepages.inf.ed.ac.uk/mfourman/research/publications/pdf/fourman2007-categorical-perspectives.pdf}
}

Michael P. Fourman. Local perspectives on actions. In Johan van Benthem, Shier Ju, and Frank Veltman, editors, A Meeting of the Minds: Proceedings of the Workshop on Logic, Rationality and Interaction, Beijing, August 2007. ISBN 978-1-904987-48-2.

@inproceedings{fourman07a,
  author = {Michael P. Fourman},
  title = {Local Perspectives on Actions},
  booktitle = {A Meeting of the Minds: Proceedings of the Workshop on Logic, Rationality and Interaction},
  editor = {van Benthem, Johan  and Shier Ju and Frank Veltman },
  address = {Beijing},
  month = {August},
  year = {2007},
  url = {http://homepages.inf.ed.ac.uk/mfourman/research/publications/pdf/fourman2007-local-perspectives-on-actions.pdf},
  note = {ISBN 978-1-904987-48-2 }
}

Michael P. Fourman. informatics. In John Feather and Paul Sturges, editors, International Encyclopedia of Information and Library Science (second edition). Routledge, 2002. Available as EDI-INF-RR-0139.

@incollection{fourman02,
  author = {Michael P. Fourman},
  title = {informatics},
  booktitle = {International Encyclopedia of Information and Library Science (second edition)},
  publisher = {Routledge},
  year = {2002},
  editor = {John Feather and Paul Sturges},
  isbn = {01315259010},
  url = {http://www.inf.ed.ac.uk/publications/report/0139.html},
  note = {Available as EDI-INF-RR-0139}
}

Michael P. Fourman. Propositional reasoning. In Tiziana Margaria and Wang Yi, editors, Tools and Algorithms for the Construction and Analysis of Systems, 7th International Conference, TACAS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings, volume 2031 of Lecture Notes in Computer Science, page 23. Springer, June 2001. Abstract of Invited Lecture.

@inproceedings{fourman01,
  author = {Michael P. Fourman},
  title = {Propositional Reasoning},
  editor = {Tiziana Margaria and
               Wang Yi},
  booktitle = {Tools and Algorithms for the Construction and Analysis of Systems,
               7th International Conference, TACAS 2001 Held as Part of the
               Joint European Conferences on Theory and Practice of Software,
               ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = {2031},
  year = {2001},
  month = {June},
  isbn = {3-540-41865-2},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  note = {Abstract of Invited Lecture},
  pages = {23}
}

Michael P. Fourman. Propositional planning. In Workshop on Model-Theoretic Aproaches to Planning, AIPS 2000, April 2000. EDI-INF-RR-0034 http://www.inf.ed.ac.uk/publications/report/0034.html.

@inproceedings{fourman2000-propositional-planning,
  author = {Michael P. Fourman},
  title = {Propositional Planning},
  booktitle = {Workshop on Model-Theoretic Aproaches to Planning, AIPS 2000},
  year = {2000},
  month = {April},
  page = {10--17},
  note = {EDI-INF-RR-0034 \texttt{http://www.inf.ed.ac.uk/publications/report/0034.html}},
  url = {http://www.inf.ed.ac.uk/publications/report/0034.html}
}

Simon Finn, Michael P. Fourman, and John Longley. Partial functions in a total setting. J. Automated Reasoning, 18(1):85--104, 1997. Zbl. 0870.68136.

@article{fourman96b,
  author = {Simon Finn and Michael P. Fourman and John Longley},
  title = {Partial Functions in a Total Setting},
  journal = {J. Automated Reasoning},
  year = {1997},
  volume = {18},
  note = {Zbl. 0870.68136},
  number = {1},
  url = {http://www.lfcs.inf.ed.ac.uk/reports/96/ECS-LFCS-96-341/index.html},
  pages = {85-104}
}

Michael P. Fourman. Proof and design. In Manfred Broy, editor, Deductive Program Design, volume 152 of NATO Advanced Science Institute, Series F: Computer and System Sciences, pages 397--439. Springer, Marktoberdorf Germany, July 1996. Proceedings of the NATO Advanced Study Institute on Deductive Program Design, also available as LFCS report ECS-LFCS-95-319.

@incollection{fourman96a,
  author = {Michael P. Fourman},
  title = {Proof and design},
  booktitle = {Deductive Program Design},
  pages = {397-439},
  publisher = {Springer},
  year = {1996},
  editor = {Manfred Broy},
  volume = {152},
  series = {NATO Advanced Science Institute, Series F: Computer and System Sciences},
  address = {Marktoberdorf Germany},
  month = {July},
  url = {http://www.lfcs.inf.ed.ac.uk/reports/95/ECS-LFCS-95-319/index.html},
  note = {Proceedings of the NATO Advanced Study Institute on Deductive Program Design, also available as LFCS report ECS-LFCS-95-319}
}

Michael P. Fourman. Book review. J. Functional Programming, 6(1):189--193, 1996. Three books on ML.

@article{fourman96c,
  author = {Michael P. Fourman},
  title = {Book Review},
  journal = {J. Functional Programming},
  volume = {6},
  number = {1},
  year = {1996},
  pages = {189--193},
  note = {Three books on {ML}}
}

Nick Chapman, Simon Finn, and Michael Fourman. Reasoning about VHDL. In Carlos Delgado-Kloos and Werner Damm, editors, Practical Formal Methods for Hardware Design, volume 1 of Research Reports Esprit. Springer, 1996. Project 6128, FORMAT.

@incollection{fourman96d,
  author = {Nick Chapman and Simon Finn and Michael Fourman},
  editor = {Carlos Delgado-Kloos and Werner Damm},
  title = {Reasoning about {VHDL}},
  booktitle = {Practical Formal Methods for Hardware Design},
  publisher = {Springer},
  year = {1996},
  volume = {1},
  series = {Research Reports Esprit},
  note = {Project 6128, FORMAT},
  isbn = {3-540-62007-9 }
}

Michael P. Fourman and Hayo Thieleke. A proposed categorical semantics for ML modules. In David Pitt, David E. Rydeheard, and Peter Johnstone, editors, Category Theory and Computer Science, volume 953/1995 of Lecture Notes in Computer Science, pages 240--252. Springer Berlin / Heidelberg, 1995.

@inproceedings{fourman95,
  author = {Michael P. Fourman and Hayo Thieleke},
  title = {A Proposed  Categorical Semantics for {ML} Modules},
  booktitle = {Category Theory and Computer Science},
  editor = {David Pitt and David E. Rydeheard and Peter Johnstone},
  year = {1995},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture Notes in Computer Science},
  volume = {953/1995},
  pages = {240--252},
  isbn = {3-540-60164-3},
  doi = {10.1007/3-540-60164-3_30},
  issn = {0302-9743 (Print) 1611-3349 (Online)}
}

N. Chapman, S. Finn, and Michael P. Fourman. Datatypes in L2. In T.F. Melham and J. Camillieri, editors, Higher Order Logic Theorem Proving and its Applications. 7th International Workshop Proceedings, pages 128--43, Valetta, Malta, September 1994. Springer-Verlag; Berlin, Germany. Invited Paper.

@inproceedings{chapman95,
  author = {N. Chapman and S. Finn and Michael P. Fourman},
  title = {Datatypes in {L2}},
  booktitle = {Higher Order Logic Theorem Proving and its Applications. 7th International Workshop Proceedings},
  year = {1994},
  editor = {T.F. Melham and J. Camillieri},
  publisher = {Springer-Verlag; Berlin, Germany},
  address = {Valetta, Malta},
  month = {September},
  pages = {128--43},
  note = {Invited Paper}
}

S. Finn and M. Fourman. The LAMBDA logic. abstract hardware limited, september 1993. in lambda 4.3 reference manuals., 1993.

@misc{finn93abstract,
  author = {S. Finn and M. Fourman},
  title = {The {LAMBDA} Logic. Abstract Hardware Limited,
      September 1993. In LAMBDA 4.3 Reference Manuals.},
  year = {1993}
}

Michael P. Fourman. Formal design. In Jørgen Staunstrup, editor, Formal Design Methods for VLSI. North-Holland, 1992.

@inproceedings{fourman92b,
  author = {Michael P. Fourman},
  title = {Formal Design},
  booktitle = {Formal Design Methods for {VLSI}},
  editor = {J{\o}rgen Staunstrup},
  publisher = {North-Holland},
  year = {1992}
}

Wesley Phoa and Michael Fourman. A proposed categorical semantics for pure ML. In W. Kuich, editor, ICALP '92 International Colloquium on Automata, Languages, and Programming, Wien Austria, Springer LNCS, pages 533--544. Springer-Verlag, 1992. LFCS report ECS-LFCS-92-213.

@inproceedings{phoa92,
  author = {Wesley Phoa and Michael Fourman},
  title = {A proposed categorical semantics for Pure {ML}},
  booktitle = {{ICALP} '92 International Colloquium on Automata,
Languages, and Programming, Wien Austria},
  year = {1992},
  publisher = {Springer-Verlag},
  editor = {W. Kuich},
  series = {Springer {LNCS}},
  pages = {533--544},
  doi = {10.1007/3-540-55719-9_102},
  url = {http://www.lfcs.inf.ed.ac.uk/reports/92/ECS-LFCS-92-213/index.html},
  note = {LFCS report ECS-LFCS-92-213}
}

Michael P. Fourman. The CAD tool of the future. In J. van Leeuwen, editor, Information Processing 92. Elsevier, 1992. discussion paper.

@inproceedings{fourman92c,
  author = {Michael P. Fourman},
  title = {The {CAD} tool of the future},
  editor = {J. van Leeuwen},
  booktitle = {Information Processing 92},
  year = {1992},
  publisher = {Elsevier},
  note = {discussion paper}
}

E.M. Mayger and Michael P. Fourman. Integration of formal methods with system design. In A. Halaas and P.B. Denyer, editors, IFIP TC 10/WG 10.5 International Conference on Very Large Scale Integration, Edinburgh, Scotland, August 1991. Elsevier.

@inproceedings{mayger91,
  author = {E.M. Mayger and Michael P. Fourman},
  title = {Integration of Formal Methods with System Design},
  booktitle = {{IFIP TC 10/WG} 10.5 International Conference on Very Large
		 Scale Integration},
  year = {1991},
  editor = {A. Halaas and P.B. Denyer},
  address = {Edinburgh, Scotland},
  publisher = {Elsevier},
  month = {August}
}

Michael P. Fourman and R. Hexsel. Formal synthesis. In Graham Birtwistle, editor, IV Higher Order Workshop, Banff 1990, pages 245--264. Springer-Verlag, 1991.

@inproceedings{fourman91,
  author = {Michael P. Fourman and R. Hexsel},
  title = {Formal Synthesis},
  booktitle = {IV Higher Order Workshop, Banff 1990},
  year = {1991},
  editor = {Graham Birtwistle},
  publisher = {Springer-Verlag},
  pages = {245--264}
}

Michael P. Fourman. Formal system design. In Jørgen Staunstrup, editor, Formal Methods for VLSI Design, pages 191--236. North-Holland, 1990.

@inproceedings{fourman90,
  author = {Michael P. Fourman},
  title = {Formal System Design},
  booktitle = {Formal Methods for {VLSI} Design},
  year = {1990},
  editor = {J{\o}rgen Staunstrup},
  publisher = {North-Holland},
  pages = {191--236}
}

S. Finn and Michael P. Fourman. Logic manual for the LAMBDA system, 1990.

@misc{finn90logic,
  author = {S. Finn and Michael P. Fourman},
  title = {Logic Manual for the {LAMBDA} System},
  text = {Simon Finn and Michael P. Fourman. Logic Manual for the LAMBDA System 3.2.
      Abstract Hardware Ltd., November 1990.},
  year = {1990}
}

S. Finn, M. Fourman, M. Francis, and R. Harris. Formal system design---interactive synthesis based on computer-assisted formal reasoning. In Luc Claesen, editor, IMEC-IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, Volume 1, pages 97--110, Houthalen, Belgium, November 1989. Elsevier Science Publishers, B.V. North-Holland, Amsterdam.

@inproceedings{fourman89b,
  author = {S. Finn and M. Fourman and M. Francis and R. Harris},
  title = {Formal system design---interactive synthesis based on computer-assisted formal reasoning},
  booktitle = {IMEC-IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, Volume 1},
  year = {1989},
  month = {November},
  editor = {Luc Claesen},
  pages = {97--110},
  publisher = {Elsevier Science Publishers, B.V. North-Holland, Amsterdam},
  address = {Houthalen, Belgium}
}

Michael P. Fourman and Eleanor M. Mayger. Formally based systems design---Interactive hardware scheduling. In Proceedings of VLSI '89, pages 101--112, Munich, Germany, 1989.

@inproceedings{fourman89a,
  author = {Michael P. Fourman and Eleanor M. Mayger},
  title = {Formally based systems design---{I}nteractive hardware scheduling},
  year = {1989},
  pages = {101--112},
  address = {Munich, Germany},
  booktitle = {Proceedings of {VLSI} '89}
}

E. Mayger, M. Francis, R. Harris, G. Musgrave, and M. Fourman. Dialog -- linking formal proof to the design environment. Technical report, Abstract Hardware Ltd., Uxbridge, U. K., 1989.

@techreport{mayger89dialog,
  author = {E. Mayger and M. Francis and R. Harris and G. Musgrave and M. Fourman},
  title = {Dialog -- linking formal proof to the design environment},
  institution = {Abstract Hardware Ltd.},
  address = {Uxbridge, U. K.},
  year = {1989}
}

P. Camurati, S. Chin, M. Fourman, C. Pixley, P. Prinetto, and A. Takahara. Formal verification: is it practical for realworld design, 1989.

@misc{camurati89,
  author = {P. Camurati and S. Chin and M. Fourman and C. Pixley and P. Prinetto and
      A. Takahara},
  title = {Formal verification: is it practical for realworld design},
  text = {Paolo Camurati, Shiu-Kai Chin, Michael Fourman, Carl Pixley, Paolo Prinetto,
      and Atsushi Takahara. Formal verification: is it practical for realworld
      design? IEEE Design and Test of Computers, 6(6):50:58, December 1989. Roundtable
      discussion held at ICCD. BIBLIOGRAPHY 261},
  year = {1989}
}

Michael P. Fourman, W.J. Palmer, and R.M. Zimmer. Core tools for the next generation of electronics CAD. In Alvey Technical Conference, pages 428--430, Swansea, 1988.

@inproceedings{fourman88a,
  author = {Michael P. Fourman and W.J. Palmer and R.M. Zimmer},
  title = {Core Tools for the Next Generation of Electronics {CAD}},
  booktitle = {Alvey Technical Conference},
  address = {Swansea},
  year = {1988},
  pages = {428--430}
}

Michael P. Fourman, W.J. Palmer, and R.M. Zimmer. Proof and synthesis. In International Conference on Circuit Design, pages 600--603, Rye, New York, 1988.

@inproceedings{fourman88b,
  author = {Michael P. Fourman and W.J. Palmer and R.M. Zimmer},
  title = {Proof and Synthesis},
  booktitle = {International Conference on Circuit Design},
  address = {Rye, New York},
  year = {1988},
  pages = {600--603},
  url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=25771}
}

Michael P. Fourman, R. Holte, W.J. Palmer, and R.M. Zimmer. Interactive behavioural synthesis. In A.P. Ambler, editor, Electronic Design Automation, pages 317--329, Wembley, 1988.

@inproceedings{fourman88c,
  author = {Michael P. Fourman and R. Holte and W.J. Palmer and R.M. Zimmer},
  title = {Interactive Behavioural Synthesis},
  booktitle = {Electronic Design Automation},
  editor = {A.P. Ambler},
  address = {Wembley},
  year = {1988},
  pages = {317--329}
}

Michael P. Fourman and R.M. Zimmer. Modular design as algebraic composition. In P.J.W. Ten Hagen and T. Tomiyama, editors, Intelligent CAD Systems I: Theoretical and Methodological Aspects, pages 176--185, Berlin, 1987. Springer-Verlag. Proceedings Eurographics Workshop on Intelligent CAD.

@inproceedings{fourman87a,
  author = {Michael P. Fourman and R.M. Zimmer},
  title = {Modular Design as Algebraic Composition},
  booktitle = {Intelligent CAD Systems I: Theoretical and Methodological Aspects},
  editor = {P.J.W. Ten Hagen and T. Tomiyama},
  publisher = {Springer-Verlag},
  address = {Berlin},
  year = {1987},
  pages = {176--185},
  note = {Proceedings Eurographics Workshop on Intelligent CAD}
}

Michael P. Fourman, W.J. Palmer, and R.M. Zimmer. Using higher-order functions to describe hardware. In A.P. Ambler, editor, Electronic Design Automation, pages 87--94, Wembley, 1987.

@inproceedings{fourman87b,
  author = {Michael P. Fourman and W.J. Palmer and R.M. Zimmer},
  title = {Using Higher-Order Functions to Describe Hardware},
  booktitle = {Electronic Design Automation},
  editor = {A.P. Ambler},
  address = {Wembley},
  year = {1987},
  pages = {87--94}
}

Michael P. Fourman, R. Holte, W.J. Palmer, and R.M. Zimmer. Top-down design as bottom-up proof. In A.P. Ambler, editor, Electronic Design Automation, pages 617--628, Wembley, 1987.

@inproceedings{fourman87c,
  author = {Michael P. Fourman and R. Holte and W.J. Palmer and R.M. Zimmer},
  title = {Top-down Design as Bottom-up Proof},
  booktitle = {Electronic Design Automation},
  editor = {A.P. Ambler},
  address = {Wembley},
  year = {1987},
  pages = {617--628}
}

Michael P. Fourman, R. Harris, and G. Musgrave. Core tools for the next generation of electronics CAD. In A.P. Ambler, editor, Electronic Design Automation, pages 335--340, Wembley, 1987.

@inproceedings{fourman87d,
  author = {Michael P. Fourman and R. Harris and G. Musgrave},
  title = {Core Tools for the Next Generation of Electronics {CAD}},
  booktitle = {Electronic Design Automation},
  editor = {A.P. Ambler},
  address = {Wembley},
  year = {1987},
  pages = {335--340}
}

Michael P. Fourman. Verification using higher-order specifications and transformations. In A.P. Ambler, editor, Proc. Silicon Design Conference, Wembley, July 1986.

@inproceedings{fourman86c,
  author = {Michael P. Fourman},
  title = {Verification using Higher-order Specifications and Transformations},
  booktitle = {Proc. Silicon Design Conference},
  editor = {A.P. Ambler},
  address = {Wembley},
  month = {July},
  year = {1986}
}

Michael P. Fourman. Strategies for redundancy in WSI. In C. Jessop and W. Moore, editors, Proc. International Workshop on Wafer-Scale Integration, pages 72--81, Boston, 1986. Adam Hilger.

@inproceedings{fourman86a,
  author = {Michael P. Fourman},
  title = {Strategies for redundancy in {WSI}},
  booktitle = {Proc. International Workshop on Wafer-Scale Integration},
  editor = {C. Jessop and W. Moore},
  publisher = {Adam Hilger},
  address = {Boston},
  year = {1986},
  pages = {72-81}
}

Michael P. Fourman and S. Vickers. Theories as categories. In Pitt, Abramsky, Poigné, and Rydeheard, editors, Category Theory and Computer Programming, pages 434--448, Berlin, 1986. Springer-Verlag. Lecture Notes in Computer Science 240.

@inproceedings{fourman86b,
  author = {Michael P. Fourman and S. Vickers},
  title = {Theories as Categories},
  booktitle = {Category Theory and Computer Programming},
  editor = {Pitt and Abramsky and Poign\'{e} and Rydeheard},
  publisher = {Springer-Verlag},
  address = {Berlin},
  year = {1986},
  pages = {434--448},
  note = {Lecture Notes in Computer Science 240}
}

Michael P. Fourman. Evolving layout. I.E.E. Digest, 41:3/1--3/4, 1985. Colloquium on VLSI Design Methodologies.

@article{fourman85a,
  author = {Michael P. Fourman},
  title = {Evolving Layout},
  journal = {I.E.E. Digest},
  pages = {3/1--3/4},
  volume = {41},
  year = {1985},
  note = {Colloquium on VLSI Design Methodologies}
}

Michael P. Fourman. Compaction of symbolic layout using genetic algorithms. In Grefenstette [41], pages 141--153.

@inproceedings{fourman85b,
  author = {Michael P. Fourman},
  title = {Compaction of Symbolic Layout using Genetic Algorithms},
  booktitle = {ICGA},
  crossref = {DBLP:conf/icga/1985},
  url = {http://homepages.inf.ed.ac.uk/mfourman/research/publications/pdf/fourman85-compaction-using-genetic-algorithms.pdf},
  year = {1985},
  pages = {141--153}
}
@proceedings{DBLP:conf/icga/1985,
  editor = {John J. Grefenstette},
  title = {Proceedings of the 1st International Conference on Genetic
               Algorithms, Pittsburgh, PA, USA, July 1985},
  booktitle = {ICGA},
  publisher = {Lawrence Erlbaum Associates},
  year = {1985},
  isbn = {0-8058-0426-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

John J. Grefenstette, editor. Proceedings of the 1st International Conference on Genetic Algorithms, Pittsburgh, PA, USA, July 1985. Lawrence Erlbaum Associates, 1985.

@proceedings{DBLP:conf/icga/1985,
  editor = {John J. Grefenstette},
  title = {Proceedings of the 1st International Conference on Genetic
               Algorithms, Pittsburgh, PA, USA, July 1985},
  booktitle = {ICGA},
  publisher = {Lawrence Erlbaum Associates},
  year = {1985},
  isbn = {0-8058-0426-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Michael P. Fourman, C.M. Fourman, G. Musgrave, and A.P. Ambler. An approach to hardware description for the vida. In A.P. Ambler, editor, Proc. Silicon Design Conference, pages 67--85, Wembley, 1985.

@inproceedings{fourman85c,
  author = {Michael P. Fourman and C.M. Fourman and G. Musgrave and A.P. Ambler},
  title = {An approach to hardware description for the VIDA},
  booktitle = {Proc. Silicon Design Conference},
  editor = {A.P. Ambler},
  address = {Wembley},
  year = {1985},
  pages = {67--85}
}

Michael P. Fourman, P.Freyd, and A.Scedrov. Toposes and modal logic. J. Symbolic Logic, 49(4):1443, December 1984. Abstracts of the Annual Meeting of the Association for Symbolic Logic: Boston 1983.

@article{fourman84b,
  author = {Michael P. Fourman and P.Freyd and A.Scedrov},
  title = {Toposes and modal logic},
  pages = {1443},
  journal = {J. Symbolic Logic},
  volume = {49},
  number = {4},
  month = {December},
  year = {1984},
  note = {Abstracts of the Annual Meeting of the Association for Symbolic Logic: Boston 1983},
  url = {http://links.jstor.org/sici?sici=0022-4812\%28198412\%2949\%3A4\%3C1441\%3AAMOTAF\%3E2.0.CO\%3B2-4}
}

Michael P. Fourman. Continuous truth I: non-constructive objects. In G. Lolli, G. Longo, and A. Marcja, editors, Proc. Logic Colloquium, Florence 1982, Stud. Logic Found. Math. 112, pages 161--180. Elsevier Science Publishers B.V. (North-Holland), 1984. Invited Paper.

@inproceedings{fourman84a,
  author = {Michael P. Fourman},
  title = {Continuous truth {I}: non-constructive objects},
  booktitle = {Proc. Logic Colloquium, Florence 1982},
  editor = {G. Lolli and G. Longo and A. Marcja},
  series = {Stud. Logic Found. Math. 112},
  publisher = {Elsevier Science Publishers B.V. (North-Holland)},
  year = {1984},
  pages = {161-180},
  url = {http://homepages.inf.ed.ac.uk/mfourman/research/publications/pdf/fourman84-continuous-truth-I.pdf},
  note = {Invited Paper},
  abstract = {We give a general theory of the logic of potentially infinite objects, derived from a 
theory of meaning for statements concerning these objects. The paper has two main parts which may 
be read independently but are intended to complement each other. The first part is philosophical. 
In it, we discuss the theory of meaning. We believe that even the stunchest realist must view 
potential infinities operationally. The second part is formal. In it we consider the interpretation 
of logic in the gros topos of sheaves over the category of separable locales equipped with the open 
cover topology. We show that general priciples of continuity, local choice and local compactness 
hold for these models. We conclude with a brief discussion of the philosophical significance of our 
formal results. They allow us to reconcile our explanation of meaning with the "equivalence thesis", 
that 'snow is white' is true iff snaow is white.}
}

Michael P. Fourman. T1 spaces over topological sites. J. Pure and Applied Algebra, 27(3):223--224, March 1983.

@article{fourman83,
  author = {Michael P. Fourman},
  title = {T1 spaces over topological sites},
  pages = {223-224},
  journal = {J. Pure and Applied Algebra},
  volume = {27},
  number = {3},
  year = {1983},
  month = {March},
  url = {http://dx.doi.org/10.1016/0022-4049(83)90017-8}
}

Michael P. Fourman and A.Scedrov. The “world's simplest axiom of choice” fails. Manuscripta Mathematica, 38:325--332, 1982.

@article{fourman82a,
  author = {Michael P. Fourman and A.Scedrov},
  title = {The ``World's Simplest Axiom of Choice'' fails},
  pages = {325-332},
  journal = {Manuscripta Mathematica},
  volume = {38},
  year = {1982},
  url = {http://homepages.inf.ed.ac.uk/mfourman/research/publications/pdf/fourman82-worlds-simplest-axiom-of-choice-fails.pdf},
  abstract = {We use topos-theoretic methods to show that intuitionistic
                  set theory with coutable or dependent choice does
                  not imply that every family, all of whose elements
                  are doubletons and which has at most one element,
                  has a choice function.}
}

Michael P. Fourman. A model for the theory of choice sequences (cs). Abstracts Amer. Math. Soc., page 183, 1982. (abstract) 82-T-03-80.

@article{fourman82b,
  author = {Michael P. Fourman},
  title = {A model for the theory of choice sequences (CS)},
  note = {(abstract) 82-T-03-80},
  pages = {183},
  journal = {Abstracts Amer. Math. Soc.},
  year = {1982}
}

Michael P. Fourman. Notions of choice sequence. In D. van Dalen and A. Troelstra, editors, L.E.J. Brouwer Centenary Symposium, pages 91--105. North-Holland, 1982. Zbl 0545.03036 (Review by M. Beeson) The mathematical contribution of this paper is the construction of sheaf models for various theories of choice sequences. These models are defined when a category is given, together with a notion of which morphisms "cover" a given object (for the cognoscenti, a Grothendieck topology). The semantics is like Beth models; in fact they form a special case in which the objects of the category are the nodes of the Beth model and there is just one arrow between every pair of order-related nodes. Several specific models are considered; the two simplest are equivalent to the Scott-Moschovakis model, and the Kreisel-Troelstra elimination of lawless sequences, respectively. Another model, found independently by Grayson and by Moerdijk and van der Hoeven, corresponds to the Kreisel-Troelstra elimination of choice sequences. Several choice and continuity principles are verified in these models. The author mentions that Dragalin had, unknown to him at the time, also constructed similar models in 1974. On the philosophical side, the author hopes these models provide a conceptual basis for theories of choice sequences, i.e. a coherent and precise notion of choice sequence.

@inproceedings{fourman82c,
  author = {Michael P. Fourman},
  title = {Notions of Choice Sequence},
  booktitle = {L.E.J. Brouwer Centenary Symposium},
  editor = {D. van Dalen and A. Troelstra},
  publisher = {North-Holland},
  year = {1982},
  pages = {91--105},
  url = {http://homepages.inf.ed.ac.uk/mfourman/research/publications/pdf/fourman82-notions-of-choice-sequence.pdf},
  keyword = {topoi, intuitionism, sheaf model, choice sequence, Grothendieck topology,
Beth model; lawless sequence},
  abstract = {We use sheaf models to undertake a constructive analysis of the effects of 
admitting non-constructive choice sequences to mathematics.},
  note = {Zbl 0545.03036 (Review by M. Beeson) The mathematical contribution of this paper 
is the construction of sheaf models for
various theories of choice sequences. These models are defined when a category is given,
together with a notion of which morphisms "cover" a given object (for the cognoscenti,
a Grothendieck topology). The semantics is like Beth models; in fact they form a special
case in which the objects of the category are the nodes of the Beth model and there is
just one arrow between every pair of order-related nodes. Several specific models
are considered; the two simplest are equivalent to the Scott-Moschovakis model, and
the Kreisel-Troelstra elimination of lawless sequences, respectively. Another model,
found independently by Grayson and by Moerdijk and van der Hoeven, corresponds
to the Kreisel-Troelstra elimination of choice sequences. Several choice and continuity
principles are verified in these models. The author mentions that Dragalin had, unknown
to him at the time, also constructed similar models in 1974. On the philosophical
side, the author hopes these models provide a conceptual basis for theories of choice
sequences, i.e. a coherent and precise notion of choice sequence.}
}

Michael P. Fourman and R.J. Grayson. Formal spaces. In D. van Dalen and A. Troelstra, editors, L.E.J. Brouwer Centenary Symposium. Proceedings of the Conference held in Noordwijkerhout, 8--13 June, 1981., volume 110 of Studies in Logic and the Foundations of Mathematics, pages 107--122. North-Holland, 1982.

@inproceedings{fourman82d,
  author = {Michael P. Fourman and R.J. Grayson},
  title = {Formal Spaces},
  booktitle = {L.E.J. Brouwer Centenary Symposium. Proceedings of the Conference held in Noordwijkerhout, 8--13 June, 1981. },
  editor = {D. van Dalen and A. Troelstra},
  publisher = {North-Holland},
  series = {Studies in Logic and the Foundations of Mathematics},
  volume = {110},
  abstract = {This paper is an introduction to the constructive theory of
                  locales (or 'pointless spaces') from the point of
                  view of intuitionistic propositional theories. It is
                  shown how such a theory gives rise to a 'Lindenbaum
                  algebra' which is the dual of a locale (called the
                  formal space of the theory), and how properties of
                  the theory are reflected in properties of its formal
                  space. In particular, the question of whether the
                  formal space really is a space (i.e. whether it has
                  enough points) becomes the question of whether the
                  theory is complete (i.e. has enough models), and
                  some well-known examples of this phenomenon are
                  discussed. 

                  The paper is marred by an
                  unfortunate wrong definition: for a map of locales
                  to be open, it is not sufficient
                  (unless Y is the one-point space) merely for 
                  to have a left adjoint.},
  keywords = {constructive theory of locales, pointless spaces, intuitionistic propositional theories, Lindenbaum algebra},
  year = {1982},
  pages = {107--122}
}

Michael P. Fourman. Continuous truth. Abstracts Amer. Math. Soc., 1981. (abstract) 81-T-03-135.

@article{fourman81,
  author = {Michael P. Fourman},
  title = {Continuous Truth},
  note = {(abstract) 81-T-03-135},
  journal = {Abstracts Amer. Math. Soc.},
  year = {1981}
}

Michael P. Fourman. Sheaf models for set theory. Journal of Pure and Applied Alegebra, 19:91--101, 1980.

@article{fourman80,
  author = {Michael P. Fourman},
  title = {Sheaf Models for Set Theory},
  pages = {91-101},
  journal = {Journal of Pure and Applied Alegebra},
  volume = {19},
  year = {1980}
}

Michael P. Fourman and Dana S. Scott. Sheaves and logic. In Fourman et al. [54], pages 302--401.

@inproceedings{fourman79a,
  author = {Michael P. Fourman and Dana S. Scott},
  title = {Sheaves and Logic},
  crossref = {fourman79},
  year = {1979},
  pages = {302-401},
  doi = {10.1007/BFb0061824}
}
@proceedings{fourman79,
  booktitle = {Applications of Sheaves},
  title = {Proceedings of the Research
                  Symposium on Applications of Sheaf Theory to Logic,
                  Algebra, and Analysis, Durham, July 9–21, 1977},
  year = {1979},
  editor = {Michael Fourman and Christopher Mulvey and Dana Scott},
  volume = {753/1979},
  series = {Lecture Notes in Mathematics},
  publisher = {Springer},
  url = {http://dx.doi.org/10.1007/BFb0061811},
  isbn = {978-3-540-09564-4},
  organization = {London Mathematical Society}
}

Michael P. Fourman and J.M.E. Hyland. Sheaf models for analysis. In Fourman et al. [54], pages 280--301.

@inproceedings{fourman79b,
  author = {Michael P. Fourman and J.M.E. Hyland},
  title = {Sheaf Models for Analysis},
  crossref = {fourman79},
  year = {1979},
  pages = {280-301},
  url = {http://homepages.inf.ed.ac.uk/mfourman/research/publications/pdf/fourman79-sheaf-models-for-analysis.pdf},
  doi = {10.1007/BFb0061823}
}
@proceedings{fourman79,
  booktitle = {Applications of Sheaves},
  title = {Proceedings of the Research
                  Symposium on Applications of Sheaf Theory to Logic,
                  Algebra, and Analysis, Durham, July 9–21, 1977},
  year = {1979},
  editor = {Michael Fourman and Christopher Mulvey and Dana Scott},
  volume = {753/1979},
  series = {Lecture Notes in Mathematics},
  publisher = {Springer},
  url = {http://dx.doi.org/10.1007/BFb0061811},
  isbn = {978-3-540-09564-4},
  organization = {London Mathematical Society}
}

Michael Fourman, Christopher Mulvey, and Dana Scott, editors. Proceedings of the Research Symposium on Applications of Sheaf Theory to Logic, Algebra, and Analysis, Durham, July 9–21, 1977, volume 753/1979 of Lecture Notes in Mathematics. London Mathematical Society, Springer, 1979.

@proceedings{fourman79,
  booktitle = {Applications of Sheaves},
  title = {Proceedings of the Research
                  Symposium on Applications of Sheaf Theory to Logic,
                  Algebra, and Analysis, Durham, July 9–21, 1977},
  year = {1979},
  editor = {Michael Fourman and Christopher Mulvey and Dana Scott},
  volume = {753/1979},
  series = {Lecture Notes in Mathematics},
  publisher = {Springer},
  url = {http://dx.doi.org/10.1007/BFb0061811},
  isbn = {978-3-540-09564-4},
  organization = {London Mathematical Society}
}

Michael P. Fourman. The logic of topoi and sheaves. Journal of Symbolic Logic, 42(1):138--139, 1977. (abstract).

@article{fourman77a,
  author = {Michael P. Fourman},
  title = {The logic of topoi and sheaves},
  note = {(abstract)},
  journal = {Journal of Symbolic Logic},
  volume = {42},
  number = {1},
  year = {1977},
  pages = {138--139}
}

Michael P. Fourman. Comparaison des réeles d'un topos; structures lisses sur un topos élémentaire. Cah. Géom. Top. Diff., 16(3):233--239, 1977.

@article{fourman77b,
  author = {Michael P. Fourman},
  title = {Comparaison des r\'eeles d'un topos; structures lisses sur un topos 
\'{e}l\'{e}mentaire},
  journal = {Cah. G\'{e}om. Top. Diff.},
  year = {1977},
  volume = {16},
  number = {3},
  pages = {233--239}
}

Michael P. Fourman. The logic of topoi. In Jon Barwise, editor, Handbook of Mathematical Logic, chapter D-6, pages 1053--1090. North-Holland, 1977.

@incollection{fourman77c,
  author = {Michael P. Fourman},
  title = {The logic of topoi},
  booktitle = {Handbook of Mathematical Logic},
  publisher = {North-Holland},
  chapter = {D-6},
  year = {1977},
  editor = {Jon Barwise},
  pages = {1053--1090},
  isbn = {0-7204-2285-X}
}

Michael P. Fourman and C. Rousseau. Parameters in complex analysis and the logic of topoi. Journal of Symbolic Logic, 42(3):499, 1977. (abstract).

@article{fourman77d,
  author = {Michael P. Fourman and C. Rousseau},
  title = {Parameters in complex analysis and the logic of topoi},
  note = {(abstract)},
  journal = {Journal of Symbolic Logic},
  volume = {42},
  number = {3},
  year = {1977},
  pages = {499}
}

Michael P. Fourman. Approximation sheaves as internal banach-spaces. Notices Amer. Math. Soc., 24(2):A--224, 1977. (abstract) 77T-B67.

@article{fourman77e,
  author = {Michael P. Fourman},
  title = {Approximation Sheaves as internal Banach-Spaces},
  note = {(abstract) 77T-B67},
  pages = {A-224},
  journal = {Notices Amer. Math. Soc.},
  volume = {24},
  number = {2},
  year = {1977}
}

Michael P. Fourman. A representation for internal sober spaces. Notices Amer. Math. Soc., 24(3):A--301, 1977. (abstract) 77T-G48.

@article{fourman77f,
  author = {Michael P. Fourman},
  title = {A representation for internal sober spaces},
  note = {(abstract) 77T-G48},
  pages = {A-301},
  journal = {Notices Amer. Math. Soc.},
  volume = {24},
  number = {3},
  year = {1977}
}

Michael P. Fourman. Formal spaces. In Tagungsbericht: Kategorien, Oberwolfach, 31.7--6.8.1977, pages 38--39. 1977.

@incollection{fourman77g,
  author = {Michael P. Fourman},
  title = {Formal Spaces},
  year = {1977},
  pages = {38--39},
  url = {http://homepages.inf.ed.ac.uk/mfourman/research/publications/pdf/fourman77-formal-spaces.pdf},
  booktitle = {Tagungsbericht: {K}ategorien, {O}berwolfach, 31.7--6.8.1977}
}

Michael P. Fourman. Sheaf models for set theory. In Tagungsbericht Oberwolfach. July 1975. (abstract).

@incollection{fourman75,
  author = {Michael P. Fourman},
  title = {Sheaf models for set theory},
  booktitle = {Tagungsbericht Oberwolfach},
  note = {(abstract)},
  month = {July},
  year = {1975}
}

Michael Paul Fourman. Connections between category theory and logic. PhD thesis, Oxford University, Linacre College, Oxford, November 1974. D.Phil. thesis.

@phdthesis{fourman74,
  author = {Michael Paul Fourman},
  title = {Connections between category theory and logic},
  school = {Oxford University},
  year = {1974},
  month = {November},
  pages = {v + 102},
  note = {D.Phil. thesis},
  address = {Linacre College, Oxford}
}


This file was generated by bibtex2html 1.98.