doc-src/springer.bbl
author haftmann
Tue Oct 10 13:59:12 2006 +0200 (2006-10-10)
changeset 20950 981fa0ce23ed
parent 460 5d91bd2db00a
permissions -rw-r--r--
added IsarAdvanced material
lcp@460
     1
\begin{thebibliography}{10}
lcp@460
     2
lcp@460
     3
\bibitem{andrews86}
lcp@460
     4
Andrews, P.~B.,
lcp@460
     5
\newblock {\em An Introduction to Mathematical Logic and Type Theory: To Truth
lcp@460
     6
  Through Proof},
lcp@460
     7
\newblock Academic Press, 1986
lcp@460
     8
lcp@460
     9
\bibitem{basin91}
lcp@460
    10
Basin, D., Kaufmann, M.,
lcp@460
    11
\newblock The {Boyer-Moore} prover and {Nuprl}: An experimental comparison,
lcp@460
    12
\newblock In {\em Logical Frameworks}, G.~Huet, G.~Plotkin, Eds. Cambridge
lcp@460
    13
  Univ. Press, 1991, pp.~89--119
lcp@460
    14
lcp@460
    15
\bibitem{boyer86}
lcp@460
    16
Boyer, R., Lusk, E., McCune, W., Overbeek, R., Stickel, M., Wos, L.,
lcp@460
    17
\newblock Set theory in first-order logic: Clauses for {G\"odel's} axioms,
lcp@460
    18
\newblock {\em J. Auto. Reas. {\bf 2}}, 3 (1986), 287--327
lcp@460
    19
lcp@460
    20
\bibitem{bm88book}
lcp@460
    21
Boyer, R.~S., Moore, J.~S.,
lcp@460
    22
\newblock {\em A Computational Logic Handbook},
lcp@460
    23
\newblock Academic Press, 1988
lcp@460
    24
lcp@460
    25
\bibitem{camilleri92}
lcp@460
    26
Camilleri, J., Melham, T.~F.,
lcp@460
    27
\newblock Reasoning with inductively defined relations in the {HOL} theorem
lcp@460
    28
  prover,
lcp@460
    29
\newblock Tech. Rep. 265, Comp. Lab., Univ. Cambridge, Aug. 1992
lcp@460
    30
lcp@460
    31
\bibitem{charniak80}
lcp@460
    32
Charniak, E., Riesbeck, C.~K., McDermott, D.~V.,
lcp@460
    33
\newblock {\em Artificial Intelligence Programming},
lcp@460
    34
\newblock Lawrence Erlbaum Associates, 1980
lcp@460
    35
lcp@460
    36
\bibitem{church40}
lcp@460
    37
Church, A.,
lcp@460
    38
\newblock A formulation of the simple theory of types,
lcp@460
    39
\newblock {\em J. Symb. Logic {\bf 5}\/} (1940), 56--68
lcp@460
    40
lcp@460
    41
\bibitem{coen92}
lcp@460
    42
Coen, M.~D.,
lcp@460
    43
\newblock {\em Interactive Program Derivation},
lcp@460
    44
\newblock PhD thesis, University of Cambridge, 1992,
lcp@460
    45
\newblock Computer Laboratory Technical Report 272
lcp@460
    46
lcp@460
    47
\bibitem{constable86}
lcp@460
    48
{Constable et al.}, R.~L.,
lcp@460
    49
\newblock {\em Implementing Mathematics with the Nuprl Proof Development
lcp@460
    50
  System},
lcp@460
    51
\newblock Prentice-Hall, 1986
lcp@460
    52
lcp@460
    53
\bibitem{davey&priestley}
lcp@460
    54
Davey, B.~A., Priestley, H.~A.,
lcp@460
    55
\newblock {\em Introduction to Lattices and Order},
lcp@460
    56
\newblock Cambridge Univ. Press, 1990
lcp@460
    57
lcp@460
    58
\bibitem{dawson90}
lcp@460
    59
Dawson, W.~M.,
lcp@460
    60
\newblock {\em A Generic Logic Environment},
lcp@460
    61
\newblock PhD thesis, Imperial College, London, 1990
lcp@460
    62
lcp@460
    63
\bibitem{debruijn72}
lcp@460
    64
de~Bruijn, N.~G.,
lcp@460
    65
\newblock Lambda calculus notation with nameless dummies, a tool for automatic
lcp@460
    66
  formula manipulation, with application to the {Church-Rosser Theorem},
lcp@460
    67
\newblock {\em Indag. Math. {\bf 34}\/} (1972), 381--392
lcp@460
    68
lcp@460
    69
\bibitem{devlin79}
lcp@460
    70
Devlin, K.~J.,
lcp@460
    71
\newblock {\em Fundamentals of Contemporary Set Theory},
lcp@460
    72
\newblock Springer, 1979
lcp@460
    73
lcp@460
    74
\bibitem{coq}
lcp@460
    75
{Dowek et al.}, G.,
lcp@460
    76
\newblock The {Coq} proof assistant user's guide,
lcp@460
    77
\newblock Technical Report 134, INRIA-Rocquencourt, 1991
lcp@460
    78
lcp@460
    79
\bibitem{dummett}
lcp@460
    80
Dummett, M.,
lcp@460
    81
\newblock {\em Elements of Intuitionism},
lcp@460
    82
\newblock Oxford University Press, 1977
lcp@460
    83
lcp@460
    84
\bibitem{dyckhoff}
lcp@460
    85
Dyckhoff, R.,
lcp@460
    86
\newblock Contraction-free sequent calculi for intuitionistic logic,
lcp@460
    87
\newblock {\em J. Symb. Logic {\bf 57}}, 3 (1992), 795--807
lcp@460
    88
lcp@460
    89
\bibitem{felty91a}
lcp@460
    90
Felty, A.,
lcp@460
    91
\newblock A logic program for transforming sequent proofs to natural deduction
lcp@460
    92
  proofs,
lcp@460
    93
\newblock In {\em Extensions of Logic Programming\/} (1991),
lcp@460
    94
  P.~Schroeder-Heister, Ed., Springer, pp.~157--178,
lcp@460
    95
\newblock LNAI 475
lcp@460
    96
lcp@460
    97
\bibitem{felty93}
lcp@460
    98
Felty, A.,
lcp@460
    99
\newblock Implementing tactics and tacticals in a higher-order logic
lcp@460
   100
  programming language,
lcp@460
   101
\newblock {\em J. Auto. Reas. {\bf 11}}, 1 (1993), 43--82
lcp@460
   102
lcp@460
   103
\bibitem{frost93}
lcp@460
   104
Frost, J.,
lcp@460
   105
\newblock A case study of co-induction in {Isabelle HOL},
lcp@460
   106
\newblock Tech. Rep. 308, Comp. Lab., Univ. Cambridge, Aug. 1993
lcp@460
   107
lcp@460
   108
\bibitem{OBJ}
lcp@460
   109
Futatsugi, K., Goguen, J., Jouannaud, J.-P., Meseguer, J.,
lcp@460
   110
\newblock Principles of {OBJ2},
lcp@460
   111
\newblock In {\em Princ. Prog. Lang.\/} (1985), pp.~52--66
lcp@460
   112
lcp@460
   113
\bibitem{gallier86}
lcp@460
   114
Gallier, J.~H.,
lcp@460
   115
\newblock {\em Logic for Computer Science: Foundations of Automatic Theorem
lcp@460
   116
  Proving},
lcp@460
   117
\newblock Harper \& Row, 1986
lcp@460
   118
lcp@460
   119
\bibitem{mgordon-hol}
lcp@460
   120
Gordon, M. J.~C., Melham, T.~F.,
lcp@460
   121
\newblock {\em Introduction to {HOL}: A Theorem Proving Environment for Higher
lcp@460
   122
  Order Logic},
lcp@460
   123
\newblock Cambridge Univ. Press, 1993
lcp@460
   124
lcp@460
   125
\bibitem{halmos60}
lcp@460
   126
Halmos, P.~R.,
lcp@460
   127
\newblock {\em Naive Set Theory},
lcp@460
   128
\newblock Van Nostrand, 1960
lcp@460
   129
lcp@460
   130
\bibitem{harper-jacm}
lcp@460
   131
Harper, R., Honsell, F., Plotkin, G.,
lcp@460
   132
\newblock A framework for defining logics,
lcp@460
   133
\newblock {\em J.~ACM {\bf 40}}, 1 (1993), 143--184
lcp@460
   134
lcp@460
   135
\bibitem{haskell-tutorial}
lcp@460
   136
Hudak, P., Fasel, J.~H.,
lcp@460
   137
\newblock A gentle introduction to {Haskell},
lcp@460
   138
\newblock {\em {SIGPLAN} {\bf 27}}, 5 (May 1992)
lcp@460
   139
lcp@460
   140
\bibitem{haskell-report}
lcp@460
   141
Hudak, P., Jones, S.~P., Wadler, P.,
lcp@460
   142
\newblock Report on the programming language {Haskell}: A non-strict, purely
lcp@460
   143
  functional language,
lcp@460
   144
\newblock {\em {SIGPLAN} {\bf 27}}, 5 (May 1992),
lcp@460
   145
\newblock Version 1.2
lcp@460
   146
lcp@460
   147
\bibitem{huet75}
lcp@460
   148
Huet, G.~P.,
lcp@460
   149
\newblock A unification algorithm for typed $\lambda$-calculus,
lcp@460
   150
\newblock {\em Theoretical Comput. Sci. {\bf 1}\/} (1975), 27--57
lcp@460
   151
lcp@460
   152
\bibitem{huet78}
lcp@460
   153
Huet, G.~P., Lang, B.,
lcp@460
   154
\newblock Proving and applying program transformations expressed with
lcp@460
   155
  second-order patterns,
lcp@460
   156
\newblock {\em Acta Inf. {\bf 11}\/} (1978), 31--55
lcp@460
   157
lcp@460
   158
\bibitem{mural}
lcp@460
   159
Jones, C.~B., Jones, K.~D., Lindsay, P.~A., Moore, R.,
lcp@460
   160
\newblock {\em Mural: A Formal Development Support System},
lcp@460
   161
\newblock Springer, 1991
lcp@460
   162
lcp@460
   163
\bibitem{alf}
lcp@460
   164
Magnusson, L., {Nordstr\"om}, B.,
lcp@460
   165
\newblock The {ALF} proof editor and its proof engine,
lcp@460
   166
\newblock In {\em Types for Proofs and Programs: International Workshop {TYPES
lcp@460
   167
  '93}\/} (published 1994), Springer, pp.~213--237,
lcp@460
   168
\newblock LNCS 806
lcp@460
   169
lcp@460
   170
\bibitem{mw81}
lcp@460
   171
Manna, Z., Waldinger, R.,
lcp@460
   172
\newblock Deductive synthesis of the unification algorithm,
lcp@460
   173
\newblock {\em Sci. Comput. Programming {\bf 1}}, 1 (1981), 5--48
lcp@460
   174
lcp@460
   175
\bibitem{martin-nipkow}
lcp@460
   176
Martin, U., Nipkow, T.,
lcp@460
   177
\newblock Ordered rewriting and confluence,
lcp@460
   178
\newblock In {\em 10th Conf. Auto. Deduct.\/} (1990), M.~E. Stickel, Ed.,
lcp@460
   179
  Springer, pp.~366--380,
lcp@460
   180
\newblock LNCS 449
lcp@460
   181
lcp@460
   182
\bibitem{martinlof84}
lcp@460
   183
Martin-L\"of, P.,
lcp@460
   184
\newblock {\em Intuitionistic type theory},
lcp@460
   185
\newblock Bibliopolis, 1984
lcp@460
   186
lcp@460
   187
\bibitem{melham89}
lcp@460
   188
Melham, T.~F.,
lcp@460
   189
\newblock Automating recursive type definitions in higher order logic,
lcp@460
   190
\newblock In {\em Current Trends in Hardware Verification and Automated Theorem
lcp@460
   191
  Proving}, G.~Birtwistle, P.~A. Subrahmanyam, Eds. Springer, 1989,
lcp@460
   192
  pp.~341--386
lcp@460
   193
lcp@460
   194
\bibitem{miller-mixed}
lcp@460
   195
Miller, D.,
lcp@460
   196
\newblock Unification under a mixed prefix,
lcp@460
   197
\newblock {\em J. Symb. Comput. {\bf 14}}, 4 (1992), 321--358
lcp@460
   198
lcp@460
   199
\bibitem{milner-coind}
lcp@460
   200
Milner, R., Tofte, M.,
lcp@460
   201
\newblock Co-induction in relational semantics,
lcp@460
   202
\newblock {\em Theoretical Comput. Sci. {\bf 87}\/} (1991), 209--220
lcp@460
   203
lcp@460
   204
\bibitem{nipkow-prehofer}
lcp@460
   205
Nipkow, T., Prehofer, C.,
lcp@460
   206
\newblock Type checking type classes,
lcp@460
   207
\newblock In {\em 20th Princ. Prog. Lang.\/} (1993), ACM Press, pp.~409--418,
lcp@460
   208
\newblock Revised version to appear in \bgroup\em J. Func. Prog.\egroup
lcp@460
   209
lcp@460
   210
\bibitem{noel}
lcp@460
   211
{No\"el}, P.,
lcp@460
   212
\newblock Experimenting with {Isabelle} in {ZF} set theory,
lcp@460
   213
\newblock {\em J. Auto. Reas. {\bf 10}}, 1 (1993), 15--58
lcp@460
   214
lcp@460
   215
\bibitem{nordstrom90}
lcp@460
   216
{Nordstr\"om}, B., Petersson, K., Smith, J.,
lcp@460
   217
\newblock {\em Programming in {Martin-L\"of}'s Type Theory. An Introduction},
lcp@460
   218
\newblock Oxford University Press, 1990
lcp@460
   219
lcp@460
   220
\bibitem{paulin92}
lcp@460
   221
Paulin-Mohring, C.,
lcp@460
   222
\newblock Inductive definitions in the system {Coq}: Rules and properties,
lcp@460
   223
\newblock Research Report 92-49, LIP, Ecole Normale Sup\'erieure de Lyon, Dec.
lcp@460
   224
  1992
lcp@460
   225
lcp@460
   226
\bibitem{paulson85}
lcp@460
   227
Paulson, L.~C.,
lcp@460
   228
\newblock Verifying the unification algorithm in {LCF},
lcp@460
   229
\newblock {\em Sci. Comput. Programming {\bf 5}\/} (1985), 143--170
lcp@460
   230
lcp@460
   231
\bibitem{paulson87}
lcp@460
   232
Paulson, L.~C.,
lcp@460
   233
\newblock {\em Logic and Computation: Interactive proof with Cambridge LCF},
lcp@460
   234
\newblock Cambridge Univ. Press, 1987
lcp@460
   235
lcp@460
   236
\bibitem{paulson89}
lcp@460
   237
Paulson, L.~C.,
lcp@460
   238
\newblock The foundation of a generic theorem prover,
lcp@460
   239
\newblock {\em J. Auto. Reas. {\bf 5}}, 3 (1989), 363--397
lcp@460
   240
lcp@460
   241
\bibitem{paulson-COLOG}
lcp@460
   242
Paulson, L.~C.,
lcp@460
   243
\newblock A formulation of the simple theory of types (for {Isabelle}),
lcp@460
   244
\newblock In {\em COLOG-88: International Conference on Computer Logic\/}
lcp@460
   245
  (Tallinn, 1990), P.~Martin-L\"of, G.~Mints, Eds., Estonian Academy of
lcp@460
   246
  Sciences, Springer,
lcp@460
   247
\newblock LNCS 417
lcp@460
   248
lcp@460
   249
\bibitem{paulson700}
lcp@460
   250
Paulson, L.~C.,
lcp@460
   251
\newblock {Isabelle}: The next 700 theorem provers,
lcp@460
   252
\newblock In {\em Logic and Computer Science}, P.~Odifreddi, Ed. Academic
lcp@460
   253
  Press, 1990, pp.~361--386
lcp@460
   254
lcp@460
   255
\bibitem{paulson91}
lcp@460
   256
Paulson, L.~C.,
lcp@460
   257
\newblock {\em {ML} for the Working Programmer},
lcp@460
   258
\newblock Cambridge Univ. Press, 1991
lcp@460
   259
lcp@460
   260
\bibitem{paulson-coind}
lcp@460
   261
Paulson, L.~C.,
lcp@460
   262
\newblock Co-induction and co-recursion in higher-order logic,
lcp@460
   263
\newblock Tech. Rep. 304, Comp. Lab., Univ. Cambridge, July 1993
lcp@460
   264
lcp@460
   265
\bibitem{paulson-fixedpt}
lcp@460
   266
Paulson, L.~C.,
lcp@460
   267
\newblock A fixedpoint approach to implementing (co)inductive definitions,
lcp@460
   268
\newblock Tech. Rep. 320, Comp. Lab., Univ. Cambridge, Dec. 1993
lcp@460
   269
lcp@460
   270
\bibitem{paulson-set-I}
lcp@460
   271
Paulson, L.~C.,
lcp@460
   272
\newblock Set theory for verification: {I}. {From} foundations to functions,
lcp@460
   273
\newblock {\em J. Auto. Reas. {\bf 11}}, 3 (1993), 353--389
lcp@460
   274
lcp@460
   275
\bibitem{paulson-set-II}
lcp@460
   276
Paulson, L.~C.,
lcp@460
   277
\newblock Set theory for verification: {II}. {Induction} and recursion,
lcp@460
   278
\newblock Tech. Rep. 312, Comp. Lab., Univ. Cambridge, 1993
lcp@460
   279
lcp@460
   280
\bibitem{paulson-final}
lcp@460
   281
Paulson, L.~C.,
lcp@460
   282
\newblock A concrete final coalgebra theorem for {ZF} set theory,
lcp@460
   283
\newblock Tech. rep., Comp. Lab., Univ. Cambridge, 1994
lcp@460
   284
lcp@460
   285
\bibitem{pelletier86}
lcp@460
   286
Pelletier, F.~J.,
lcp@460
   287
\newblock Seventy-five problems for testing automatic theorem provers,
lcp@460
   288
\newblock {\em J. Auto. Reas. {\bf 2}\/} (1986), 191--216,
lcp@460
   289
\newblock Errata, JAR 4 (1988), 235--236
lcp@460
   290
lcp@460
   291
\bibitem{plaisted90}
lcp@460
   292
Plaisted, D.~A.,
lcp@460
   293
\newblock A sequent-style model elimination strategy and a positive refinement,
lcp@460
   294
\newblock {\em J. Auto. Reas. {\bf 6}}, 4 (1990), 389--402
lcp@460
   295
lcp@460
   296
\bibitem{quaife92}
lcp@460
   297
Quaife, A.,
lcp@460
   298
\newblock Automated deduction in {von Neumann-Bernays-G\"odel} set theory,
lcp@460
   299
\newblock {\em J. Auto. Reas. {\bf 8}}, 1 (1992), 91--147
lcp@460
   300
lcp@460
   301
\bibitem{sawamura92}
lcp@460
   302
Sawamura, H., Minami, T., Ohashi, K.,
lcp@460
   303
\newblock Proof methods based on sheet of thought in {EUODHILOS},
lcp@460
   304
\newblock Research Report IIAS-RR-92-6E, International Institute for Advanced
lcp@460
   305
  Study of Social Information Science, Fujitsu Laboratories, 1992
lcp@460
   306
lcp@460
   307
\bibitem{suppes72}
lcp@460
   308
Suppes, P.,
lcp@460
   309
\newblock {\em Axiomatic Set Theory},
lcp@460
   310
\newblock Dover, 1972
lcp@460
   311
lcp@460
   312
\bibitem{takeuti87}
lcp@460
   313
Takeuti, G.,
lcp@460
   314
\newblock {\em Proof Theory}, 2nd~ed.,
lcp@460
   315
\newblock North Holland, 1987
lcp@460
   316
lcp@460
   317
\bibitem{thompson91}
lcp@460
   318
Thompson, S.,
lcp@460
   319
\newblock {\em Type Theory and Functional Programming},
lcp@460
   320
\newblock Addison-Wesley, 1991
lcp@460
   321
lcp@460
   322
\bibitem{principia}
lcp@460
   323
Whitehead, A.~N., Russell, B.,
lcp@460
   324
\newblock {\em Principia Mathematica},
lcp@460
   325
\newblock Cambridge Univ. Press, 1962,
lcp@460
   326
\newblock Paperback edition to *56, abridged from the 2nd edition (1927)
lcp@460
   327
lcp@460
   328
\bibitem{wos-bledsoe}
lcp@460
   329
Wos, L.,
lcp@460
   330
\newblock Automated reasoning and {Bledsoe's} dream for the field,
lcp@460
   331
\newblock In {\em Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
lcp@460
   332
  R.~S. Boyer, Ed. Kluwer Academic Publishers, 1991, pp.~297--342
lcp@460
   333
lcp@460
   334
\end{thebibliography}