author | blanchet |
Thu, 12 Jun 2014 17:02:03 +0200 | |
changeset 57241 | 7fca4159117f |
parent 56363 | 89e0264adf79 |
child 57246 | 62746a41cc0c |
permissions | -rw-r--r-- |
6592 | 1 |
% BibTeX database for the Isabelle documentation |
2 |
||
3 |
%publishers |
|
4 |
@string{AP="Academic Press"} |
|
5 |
@string{CUP="Cambridge University Press"} |
|
35078
6fd1052fe463
optimization to quantifiers in Nitpick's handling of simp rules + renamed some SAT solvers
blanchet
parents:
33926
diff
changeset
|
6 |
@string{IEEE="IEEE Computer Society Press"} |
11199 | 7 |
@string{LNCS="Lecture Notes in Computer Science"} |
6592 | 8 |
@string{MIT="MIT Press"} |
9 |
@string{NH="North-Holland"} |
|
10 |
@string{Prentice="Prentice-Hall"} |
|
6607 | 11 |
@string{PH="Prentice-Hall"} |
6592 | 12 |
@string{Springer="Springer-Verlag"} |
13 |
||
14 |
%institutions |
|
11199 | 15 |
@string{CUCL="Computer Laboratory, University of Cambridge"} |
16 |
@string{Edinburgh="Department of Computer Science, University of Edinburgh"} |
|
21074 | 17 |
@string{TUM="Department of Informatics, Technical University of Munich"} |
6592 | 18 |
|
19 |
%journals |
|
8284 | 20 |
@string{AI="Artificial Intelligence"} |
11199 | 21 |
@string{FAC="Formal Aspects of Computing"} |
22 |
@string{JAR="Journal of Automated Reasoning"} |
|
23 |
@string{JCS="Journal of Computer Security"} |
|
24 |
@string{JFP="Journal of Functional Programming"} |
|
25 |
@string{JLC="Journal of Logic and Computation"} |
|
26 |
@string{JLP="Journal of Logic Programming"} |
|
27 |
@string{JSC="Journal of Symbolic Computation"} |
|
28 |
@string{JSL="Journal of Symbolic Logic"} |
|
11246 | 29 |
@string{PROYAL="Proceedings of the Royal Society of London"} |
6592 | 30 |
@string{SIGPLAN="{SIGPLAN} Notices"} |
11246 | 31 |
@string{TISSEC="ACM Transactions on Information and System Security"} |
6592 | 32 |
|
33 |
%conferences |
|
34 |
@string{CADE="International Conference on Automated Deduction"} |
|
35 |
@string{POPL="Symposium on Principles of Programming Languages"} |
|
36 |
@string{TYPES="Types for Proofs and Programs"} |
|
37 |
||
38 |
||
39 |
%A |
|
40 |
||
41 |
@incollection{abramsky90, |
|
42 |
author = {Samson Abramsky}, |
|
43 |
title = {The Lazy Lambda Calculus}, |
|
44 |
pages = {65-116}, |
|
45 |
editor = {David A. Turner}, |
|
46 |
booktitle = {Research Topics in Functional Programming}, |
|
47 |
publisher = {Addison-Wesley}, |
|
48 |
year = 1990} |
|
49 |
||
50 |
@Unpublished{abrial93, |
|
51 |
author = {J. R. Abrial and G. Laffitte}, |
|
33191 | 52 |
title = {Towards the Mechanization of the Proofs of Some Classical |
6592 | 53 |
Theorems of Set Theory}, |
54 |
note = {preprint}, |
|
55 |
year = 1993, |
|
56 |
month = Feb} |
|
57 |
||
58 |
@incollection{aczel77, |
|
59 |
author = {Peter Aczel}, |
|
60 |
title = {An Introduction to Inductive Definitions}, |
|
61 |
pages = {739-782}, |
|
62 |
crossref = {barwise-handbk}} |
|
63 |
||
64 |
@Book{aczel88, |
|
65 |
author = {Peter Aczel}, |
|
66 |
title = {Non-Well-Founded Sets}, |
|
67 |
publisher = {CSLI}, |
|
68 |
year = 1988} |
|
69 |
||
39600 | 70 |
@inproceedings{Aehlig-Haftmann-Nipkow:2008:nbe, |
71 |
author = {Klaus Aehlig and Florian Haftmann and Tobias Nipkow}, |
|
72 |
title = {A Compiled Implementation of Normalization by Evaluation}, |
|
73 |
booktitle = {TPHOLs '08: Proceedings of the 21th International Conference on Theorem Proving in Higher Order Logics}, |
|
74 |
year = {2008}, |
|
75 |
isbn = {978-3-540-71065-3}, |
|
76 |
pages = {352--367}, |
|
77 |
publisher = Springer, |
|
78 |
series = LNCS, |
|
79 |
volume = {5170}, |
|
80 |
editor = {Otmane A\"{\i}t Mohamed and C{\'e}sar Mu{\~n}oz and Sofi{\`e}ne Tahar} |
|
81 |
} |
|
82 |
||
6592 | 83 |
@InProceedings{alf, |
84 |
author = {Lena Magnusson and Bengt {Nordstr\"{o}m}}, |
|
85 |
title = {The {ALF} Proof Editor and Its Proof Engine}, |
|
86 |
crossref = {types93}, |
|
87 |
pages = {213-237}} |
|
88 |
||
33191 | 89 |
@inproceedings{andersson-1993, |
90 |
author = "Arne Andersson", |
|
91 |
title = "Balanced Search Trees Made Simple", |
|
92 |
editor = "F. K. H. A. Dehne and N. Santoro and S. Whitesides", |
|
93 |
booktitle = "WADS 1993", |
|
94 |
series = LNCS, |
|
95 |
volume = {709}, |
|
96 |
pages = "61--70", |
|
97 |
year = 1993, |
|
98 |
publisher = Springer} |
|
99 |
||
6592 | 100 |
@book{andrews86, |
101 |
author = "Peter Andrews", |
|
102 |
title = "An Introduction to Mathematical Logic and Type Theory: to Truth |
|
103 |
through Proof", |
|
104 |
publisher = AP, |
|
105 |
series = "Computer Science and Applied Mathematics", |
|
106 |
year = 1986} |
|
107 |
||
9599 | 108 |
@InProceedings{Aspinall:2000:eProof, |
109 |
author = {David Aspinall}, |
|
110 |
title = {Protocols for Interactive {e-Proof}}, |
|
111 |
booktitle = {Theorem Proving in Higher Order Logics (TPHOLs)}, |
|
112 |
year = 2000, |
|
113 |
note = {Unpublished work-in-progress paper, |
|
14296
bcba1d67f854
updated references to the now-pornographic proofgeneral.org
paulson
parents:
14210
diff
changeset
|
114 |
\url{http://homepages.inf.ed.ac.uk/da/papers/drafts/eproof.ps.gz}} |
9599 | 115 |
} |
14296
bcba1d67f854
updated references to the now-pornographic proofgeneral.org
paulson
parents:
14210
diff
changeset
|
116 |
|
8505 | 117 |
@InProceedings{Aspinall:TACAS:2000, |
118 |
author = {David Aspinall}, |
|
10160 | 119 |
title = {{P}roof {G}eneral: A Generic Tool for Proof Development}, |
11205 | 120 |
booktitle = {Tools and Algorithms for the Construction and Analysis of |
121 |
Systems (TACAS)}, |
|
122 |
year = 2000, |
|
123 |
publisher = Springer, |
|
124 |
series = LNCS, |
|
125 |
volume = 1785, |
|
126 |
pages = "38--42" |
|
8505 | 127 |
} |
128 |
||
7209 | 129 |
@Misc{isamode, |
130 |
author = {David Aspinall}, |
|
8062 | 131 |
title = {Isamode --- {U}sing {I}sabelle with {E}macs}, |
14296
bcba1d67f854
updated references to the now-pornographic proofgeneral.org
paulson
parents:
14210
diff
changeset
|
132 |
note = {\url{http://homepages.inf.ed.ac.uk/da/Isamode/}} |
7209 | 133 |
} |
134 |
||
135 |
@Misc{proofgeneral, |
|
11197 | 136 |
author = {David Aspinall}, |
137 |
title = {{P}roof {G}eneral}, |
|
14296
bcba1d67f854
updated references to the now-pornographic proofgeneral.org
paulson
parents:
14210
diff
changeset
|
138 |
note = {\url{http://proofgeneral.inf.ed.ac.uk/}} |
7209 | 139 |
} |
140 |
||
6592 | 141 |
%B |
142 |
||
44093 | 143 |
@inproceedings{backes-brown-2010, |
42964
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
144 |
title = "Analytic Tableaux for Higher-Order Logic with Choice", |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
145 |
author = "Julian Backes and Chad E. Brown", |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
146 |
booktitle={Automated Reasoning: IJCAR 2010}, |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
147 |
editor={J. Giesl and R. H\"ahnle}, |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
148 |
publisher = Springer, |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
149 |
series = LNCS, |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
150 |
volume = 6173, |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
151 |
pages = "76--90", |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
152 |
year = 2010} |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
153 |
|
10186 | 154 |
@book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow}, |
155 |
title="Term Rewriting and All That",publisher=CUP,year=1998} |
|
156 |
||
37429 | 157 |
@manual{isabelle-locale, |
158 |
author = {Clemens Ballarin}, |
|
159 |
title = {Tutorial to Locales and Locale Interpretation}, |
|
160 |
institution = TUM, |
|
161 |
note = {\url{http://isabelle.in.tum.de/doc/locales.pdf}} |
|
162 |
} |
|
163 |
||
55117 | 164 |
@article{Ballarin2014, |
53370
7a41ec2cc522
Further clarifies sublocale and rewrite morphisms.
ballarin
parents:
53125
diff
changeset
|
165 |
author = {Ballarin, Clemens}, |
7a41ec2cc522
Further clarifies sublocale and rewrite morphisms.
ballarin
parents:
53125
diff
changeset
|
166 |
journal = JAR, |
7a41ec2cc522
Further clarifies sublocale and rewrite morphisms.
ballarin
parents:
53125
diff
changeset
|
167 |
publisher = Springer, |
7a41ec2cc522
Further clarifies sublocale and rewrite morphisms.
ballarin
parents:
53125
diff
changeset
|
168 |
title = {Locales: A Module System for Mathematical Theories}, |
55117 | 169 |
volume = 52, |
170 |
number = 2, |
|
171 |
pages = {123--153}, |
|
53370
7a41ec2cc522
Further clarifies sublocale and rewrite morphisms.
ballarin
parents:
53125
diff
changeset
|
172 |
url = {http://dx.doi.org/10.1007/s10817-013-9284-7}, |
55117 | 173 |
year = {2014}} |
53370
7a41ec2cc522
Further clarifies sublocale and rewrite morphisms.
ballarin
parents:
53125
diff
changeset
|
174 |
|
20482 | 175 |
@InCollection{Barendregt-Geuvers:2001, |
176 |
author = {H. Barendregt and H. Geuvers}, |
|
177 |
title = {Proof Assistants using Dependent Type Systems}, |
|
178 |
booktitle = {Handbook of Automated Reasoning}, |
|
179 |
publisher = {Elsevier}, |
|
180 |
year = 2001, |
|
181 |
editor = {A. Robinson and A. Voronkov} |
|
182 |
} |
|
183 |
||
40942 | 184 |
@inproceedings{cvc3, |
185 |
author = {Clark Barrett and Cesare Tinelli}, |
|
186 |
title = {{CVC3}}, |
|
187 |
booktitle = {CAV}, |
|
188 |
editor = {Werner Damm and Holger Hermanns}, |
|
189 |
volume = {4590}, |
|
190 |
series = LNCS, |
|
191 |
pages = {298--302}, |
|
192 |
publisher = {Springer}, |
|
193 |
year = {2007} |
|
194 |
} |
|
195 |
||
57241 | 196 |
@inproceedings{cvc4, |
197 |
author = {Clark Barrett and |
|
198 |
Christopher L. Conway and |
|
199 |
Morgan Deters and |
|
200 |
Liana Hadarean and |
|
201 |
Dejan Jovanovic and |
|
202 |
Tim King and |
|
203 |
Andrew Reynolds and |
|
204 |
Cesare Tinelli}, |
|
205 |
title = {{CVC4}}, |
|
206 |
booktitle = {CAV 2011}, |
|
207 |
year = {2011}, |
|
208 |
pages = {171--177}, |
|
209 |
editor = {Ganesh Gopalakrishnan and |
|
210 |
Shaz Qadeer}, |
|
211 |
publisher = {Springer}, |
|
212 |
series = LNCS, |
|
213 |
volume = {6806}, |
|
214 |
year = {2011} |
|
215 |
} |
|
216 |
||
6592 | 217 |
@incollection{basin91, |
218 |
author = {David Basin and Matt Kaufmann}, |
|
219 |
title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental |
|
54583 | 220 |
Comparison}, |
6592 | 221 |
crossref = {huet-plotkin91}, |
222 |
pages = {89-119}} |
|
223 |
||
12466 | 224 |
@Unpublished{HOL-Library, |
225 |
author = {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and |
|
226 |
Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and |
|
227 |
Markus Wenzel}, |
|
228 |
title = {The Supplemental {Isabelle/HOL} Library}, |
|
12660 | 229 |
note = {Part of the Isabelle distribution, |
12466 | 230 |
\url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}}, |
12660 | 231 |
year = 2002 |
12466 | 232 |
} |
233 |
||
9567 | 234 |
@InProceedings{Bauer-Wenzel:2000:HB, |
235 |
author = {Gertrud Bauer and Markus Wenzel}, |
|
236 |
title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in |
|
237 |
{I}sabelle/{I}sar}, |
|
238 |
booktitle = {Types for Proofs and Programs: TYPES'99}, |
|
9599 | 239 |
editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m |
240 |
and Jan Smith}, |
|
9567 | 241 |
series = {LNCS}, |
9599 | 242 |
year = 2000 |
9567 | 243 |
} |
6624 | 244 |
|
12878 | 245 |
@InProceedings{Bauer-Wenzel:2001, |
246 |
author = {Gertrud Bauer and Markus Wenzel}, |
|
247 |
title = {Calculational reasoning revisited --- an {Isabelle/Isar} experience}, |
|
248 |
crossref = {tphols2001}} |
|
249 |
||
42964
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
250 |
@inproceedings{leo2, |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
251 |
author = "Christoph Benzm{\"u}ller and Lawrence C. Paulson and Frank Theiss and Arnaud Fietzke", |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
252 |
title = "{LEO-II}---A Cooperative Automatic Theorem Prover for Higher-Order Logic", |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
253 |
editor = "Alessandro Armando and Peter Baumgartner and Gilles Dowek", |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
254 |
booktitle = "Automated Reasoning: IJCAR 2008", |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
255 |
publisher = Springer, |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
256 |
series = LNCS, |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
257 |
volume = 5195, |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
258 |
pages = "162--170", |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
259 |
year = 2008} |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
260 |
|
33926
dd017d9db05f
adding subsection about the predicate compiler to the code generator tutorial
bulwahn
parents:
33856
diff
changeset
|
261 |
@inProceedings{Berghofer-Bulwahn-Haftmann:2009:TPHOL, |
dd017d9db05f
adding subsection about the predicate compiler to the code generator tutorial
bulwahn
parents:
33856
diff
changeset
|
262 |
author = {Berghofer, Stefan and Bulwahn, Lukas and Haftmann, Florian}, |
dd017d9db05f
adding subsection about the predicate compiler to the code generator tutorial
bulwahn
parents:
33856
diff
changeset
|
263 |
booktitle = {Theorem Proving in Higher Order Logics}, |
dd017d9db05f
adding subsection about the predicate compiler to the code generator tutorial
bulwahn
parents:
33856
diff
changeset
|
264 |
pages = {131--146}, |
dd017d9db05f
adding subsection about the predicate compiler to the code generator tutorial
bulwahn
parents:
33856
diff
changeset
|
265 |
title = {Turning Inductive into Equational Specifications}, |
dd017d9db05f
adding subsection about the predicate compiler to the code generator tutorial
bulwahn
parents:
33856
diff
changeset
|
266 |
year = {2009} |
dd017d9db05f
adding subsection about the predicate compiler to the code generator tutorial
bulwahn
parents:
33856
diff
changeset
|
267 |
} |
dd017d9db05f
adding subsection about the predicate compiler to the code generator tutorial
bulwahn
parents:
33856
diff
changeset
|
268 |
|
11619 | 269 |
@INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL, |
270 |
crossref = "tphols2000", |
|
271 |
title = "Proof terms for simply typed higher order logic", |
|
272 |
author = "Stefan Berghofer and Tobias Nipkow", |
|
273 |
pages = "38--52"} |
|
274 |
||
33191 | 275 |
@inproceedings{berghofer-nipkow-2004, |
276 |
author = {Stefan Berghofer and Tobias Nipkow}, |
|
277 |
title = {Random Testing in {I}sabelle/{HOL}}, |
|
278 |
pages = {230--239}, |
|
279 |
editor = "J. Cuellar and Z. Liu", |
|
280 |
booktitle = {{SEFM} 2004}, |
|
281 |
publisher = IEEE, |
|
282 |
year = 2004} |
|
283 |
||
12612 | 284 |
@InProceedings{Berghofer-Nipkow:2002, |
285 |
author = {Stefan Berghofer and Tobias Nipkow}, |
|
286 |
title = {Executing Higher Order Logic}, |
|
287 |
booktitle = {Types for Proofs and Programs: TYPES'2000}, |
|
288 |
editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack}, |
|
289 |
series = LNCS, |
|
290 |
publisher = Springer, |
|
13009 | 291 |
volume = 2277, |
12612 | 292 |
year = 2002} |
293 |
||
6624 | 294 |
@InProceedings{Berghofer-Wenzel:1999:TPHOL, |
295 |
author = {Stefan Berghofer and Markus Wenzel}, |
|
7041 | 296 |
title = {Inductive datatypes in {HOL} --- lessons learned in |
297 |
{F}ormal-{L}ogic {E}ngineering}, |
|
298 |
crossref = {tphols99}} |
|
6624 | 299 |
|
30170 | 300 |
|
301 |
@InProceedings{Bezem-Coquand:2005, |
|
302 |
author = {M.A. Bezem and T. Coquand}, |
|
303 |
title = {Automating {Coherent Logic}}, |
|
304 |
booktitle = {LPAR-12}, |
|
305 |
editor = {G. Sutcliffe and A. Voronkov}, |
|
306 |
volume = 3835, |
|
307 |
series = LNCS, |
|
308 |
publisher = Springer} |
|
309 |
||
6607 | 310 |
@book{Bird-Wadler,author="Richard Bird and Philip Wadler", |
311 |
title="Introduction to Functional Programming",publisher=PH,year=1988} |
|
312 |
||
11209 | 313 |
@book{Bird-Haskell,author="Richard Bird", |
314 |
title="Introduction to Functional Programming using Haskell", |
|
315 |
publisher=PH,year=1998} |
|
316 |
||
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
40942
diff
changeset
|
317 |
@manual{isabelle-nitpick, |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
40942
diff
changeset
|
318 |
author = {Jasmin Christian Blanchette}, |
53647 | 319 |
title = {Picking Nits: A User's Guide to {N}itpick for {I}sabelle\slash {HOL}}, |
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
40942
diff
changeset
|
320 |
institution = TUM, |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
40942
diff
changeset
|
321 |
note = {\url{http://isabelle.in.tum.de/doc/nitpick.pdf}} |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
40942
diff
changeset
|
322 |
} |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
40942
diff
changeset
|
323 |
|
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
40942
diff
changeset
|
324 |
@manual{isabelle-sledgehammer, |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
40942
diff
changeset
|
325 |
author = {Jasmin Christian Blanchette}, |
53647 | 326 |
title = {Hammering Away: A User's Guide to {S}ledgehammer for {I}sabelle\slash {HOL}}, |
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
40942
diff
changeset
|
327 |
institution = TUM, |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
40942
diff
changeset
|
328 |
note = {\url{http://isabelle.in.tum.de/doc/sledgehammer.pdf}} |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
40942
diff
changeset
|
329 |
} |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
40942
diff
changeset
|
330 |
|
36926 | 331 |
@inproceedings{blanchette-nipkow-2010, |
332 |
title = "Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder", |
|
33191 | 333 |
author = "Jasmin Christian Blanchette and Tobias Nipkow", |
36926 | 334 |
crossref = {itp2010}} |
335 |
||
52805 | 336 |
@unpublished{blanchette-et-al-wit, |
52829 | 337 |
author = {J. C. Blanchette and A. Popescu and D. Traytel}, |
52805 | 338 |
title = {Witnessing (Co)datatypes}, |
339 |
year = 2013, |
|
340 |
note = {\url{http://www21.in.tum.de/~traytel/papers/witness/wit.pdf}}} |
|
341 |
||
46643
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
342 |
@inproceedings{why3, |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
343 |
author = {Fran\c{c}ois Bobot and Jean-Christophe Filli\^atre and Claude March\'e and Andrei Paskevich}, |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
344 |
title = {{Why3}: Shepherd Your Herd of Provers}, |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
345 |
editor = "K. Rustan M. Leino and Micha\l{} Moskal", |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
346 |
booktitle = {Boogie 2011}, |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
347 |
pages = "53--64", |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
348 |
year = 2011 |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
349 |
} |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
350 |
|
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
351 |
@inproceedings{alt-ergo, |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
352 |
author = {Fran\c{c}ois Bobot and Sylvain Conchon and Evelyne Contejean and St\'ephane Lescuyer}, |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
353 |
title = {Implementing Polymorphism in {SMT} Solvers}, |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
354 |
booktitle = {SMT '08}, |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
355 |
pages = "1--5", |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
356 |
publisher = "ACM", |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
357 |
series = "ICPS", |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
358 |
year = 2008, |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
359 |
editor = {Clark Barrett and Leonardo de Moura}} |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
360 |
% /BPR |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
361 |
% and Domagoj Babic and Amit Goel |
a88bccd2b567
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
blanchet
parents:
46286
diff
changeset
|
362 |
|
36926 | 363 |
@inproceedings{boehme-nipkow-2010, |
364 |
author={Sascha B\"ohme and Tobias Nipkow}, |
|
365 |
title={Sledgehammer: Judgement Day}, |
|
366 |
booktitle={Automated Reasoning: IJCAR 2010}, |
|
367 |
editor={J. Giesl and R. H\"ahnle}, |
|
368 |
publisher=Springer, |
|
369 |
series=LNCS, |
|
42964
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
370 |
volume = 6173, |
bf45fd2488a2
document primitive support for LEO-II and Satallax
blanchet
parents:
42940
diff
changeset
|
371 |
pages = "107--121", |
36926 | 372 |
year=2010} |
33191 | 373 |
|
6592 | 374 |
@Article{boyer86, |
375 |
author = {Robert Boyer and Ewing Lusk and William McCune and Ross |
|
376 |
Overbeek and Mark Stickel and Lawrence Wos}, |
|
377 |
title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's} |
|
378 |
Axioms}, |
|
379 |
journal = JAR, |
|
380 |
year = 1986, |
|
381 |
volume = 2, |
|
382 |
number = 3, |
|
383 |
pages = {287-327}} |
|
384 |
||
385 |
@book{bm79, |
|
386 |
author = {Robert S. Boyer and J Strother Moore}, |
|
387 |
title = {A Computational Logic}, |
|
388 |
publisher = {Academic Press}, |
|
389 |
year = 1979} |
|
390 |
||
391 |
@book{bm88book, |
|
392 |
author = {Robert S. Boyer and J Strother Moore}, |
|
393 |
title = {A Computational Logic Handbook}, |
|
394 |
publisher = {Academic Press}, |
|
395 |
year = 1988} |
|
396 |
||
44093 | 397 |
@inproceedings{satallax, |
398 |
author = "Chad E. Brown", |
|
399 |
title = "Reducing Higher-Order Theorem Proving to a Sequence of {SAT} Problems", |
|
400 |
booktitle = {Automated Deduction --- CADE-23}, |
|
401 |
publisher = Springer, |
|
402 |
series = LNCS, |
|
403 |
volume = 6803, |
|
404 |
pages = "147--161", |
|
405 |
editor = "Nikolaj Bj{\o}rner and Viorica Sofronie-Stokkermans", |
|
406 |
year = 2011} |
|
407 |
||
6592 | 408 |
@Article{debruijn72, |
409 |
author = {N. G. de Bruijn}, |
|
410 |
title = {Lambda Calculus Notation with Nameless Dummies, |
|
411 |
a Tool for Automatic Formula Manipulation, |
|
412 |
with Application to the {Church-Rosser Theorem}}, |
|
413 |
journal = {Indag. Math.}, |
|
414 |
volume = 34, |
|
415 |
pages = {381-392}, |
|
416 |
year = 1972} |
|
417 |
||
23187 | 418 |
@InProceedings{bulwahnKN07, |
25093 | 419 |
author = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow}, |
420 |
title = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}}, |
|
421 |
crossref = {tphols2007}, |
|
422 |
pages = {38--53} |
|
423 |
} |
|
23187 | 424 |
|
28593 | 425 |
@InProceedings{bulwahn-et-al:2008:imperative, |
33191 | 426 |
author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews}, |
28593 | 427 |
title = {Imperative Functional Programming with {Isabelle/HOL}}, |
428 |
crossref = {tphols2008}, |
|
429 |
} |
|
430 |
% pages = {38--53} |
|
431 |
||
11246 | 432 |
@Article{ban89, |
433 |
author = {M. Burrows and M. Abadi and R. M. Needham}, |
|
434 |
title = {A Logic of Authentication}, |
|
435 |
journal = PROYAL, |
|
436 |
year = 1989, |
|
437 |
volume = 426, |
|
438 |
pages = {233-271}} |
|
439 |
||
6592 | 440 |
%C |
441 |
||
50130 | 442 |
@PhdThesis{Chaieb-thesis, |
443 |
author = {Amine Chaieb}, |
|
444 |
title = {Automated methods for formal proofs in simple arithmetics and algebra}, |
|
445 |
school = {Technische Universit\"at M\"unchen}, |
|
446 |
year = 2008, |
|
447 |
note = {\url{http://www4.in.tum.de/~chaieb/pubs/pdf/diss.pdf}}} |
|
448 |
||
39877 | 449 |
@InProceedings{Chaieb-Wenzel:2007, |
450 |
author = {Amine Chaieb and Makarius Wenzel}, |
|
451 |
title = {Context aware Calculation and Deduction --- |
|
452 |
Ring Equalities via {Gr\"obner Bases} in {Isabelle}}, |
|
453 |
booktitle = {Towards Mechanized Mathematical Assistants (CALCULEMUS 2007)}, |
|
454 |
editor = {Manuel Kauers and Manfred Kerber and Robert Miner and Wolfgang Windsteiger}, |
|
455 |
series = LNAI, |
|
456 |
volume = 4573, |
|
457 |
year = 2007, |
|
458 |
publisher = Springer |
|
459 |
} |
|
460 |
||
6592 | 461 |
@TechReport{camilleri92, |
462 |
author = {J. Camilleri and T. F. Melham}, |
|
463 |
title = {Reasoning with Inductively Defined Relations in the |
|
464 |
{HOL} Theorem Prover}, |
|
465 |
institution = CUCL, |
|
466 |
year = 1992, |
|
467 |
number = 265, |
|
468 |
month = Aug} |
|
469 |
||
470 |
@Book{charniak80, |
|
471 |
author = {E. Charniak and C. K. Riesbeck and D. V. McDermott}, |
|
472 |
title = {Artificial Intelligence Programming}, |
|
473 |
publisher = {Lawrence Erlbaum Associates}, |
|
474 |
year = 1980} |
|
475 |
||
476 |
@article{church40, |
|
477 |
author = "Alonzo Church", |
|
478 |
title = "A Formulation of the Simple Theory of Types", |
|
479 |
journal = JSL, |
|
480 |
year = 1940, |
|
481 |
volume = 5, |
|
482 |
pages = "56-68"} |
|
483 |
||
10191 | 484 |
@book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled", |
485 |
title="Model Checking",publisher=MIT,year=1999} |
|
486 |
||
6592 | 487 |
@PhdThesis{coen92, |
488 |
author = {Martin D. Coen}, |
|
489 |
title = {Interactive Program Derivation}, |
|
490 |
school = {University of Cambridge}, |
|
491 |
note = {Computer Laboratory Technical Report 272}, |
|
492 |
month = nov, |
|
493 |
year = 1992} |
|
494 |
||
495 |
@book{constable86, |
|
496 |
author = {R. L. Constable and others}, |
|
497 |
title = {Implementing Mathematics with the Nuprl Proof |
|
54583 | 498 |
Development System}, |
6592 | 499 |
publisher = Prentice, |
500 |
year = 1986} |
|
501 |
||
502 |
%D |
|
503 |
||
6745 | 504 |
@Book{davey-priestley, |
6592 | 505 |
author = {B. A. Davey and H. A. Priestley}, |
506 |
title = {Introduction to Lattices and Order}, |
|
507 |
publisher = CUP, |
|
508 |
year = 1990} |
|
509 |
||
510 |
@Book{devlin79, |
|
511 |
author = {Keith J. Devlin}, |
|
512 |
title = {Fundamentals of Contemporary Set Theory}, |
|
513 |
publisher = {Springer}, |
|
514 |
year = 1979} |
|
515 |
||
516 |
@book{dummett, |
|
517 |
author = {Michael Dummett}, |
|
518 |
title = {Elements of Intuitionism}, |
|
519 |
year = 1977, |
|
520 |
publisher = {Oxford University Press}} |
|
521 |
||
40942 | 522 |
@misc{yices, |
523 |
author = {Bruno Dutertre and Leonardo de Moura}, |
|
524 |
title = {The {Yices} {SMT} Solver}, |
|
42884 | 525 |
howpublished = "\url{http://yices.csl.sri.com/tool-paper.pdf}", |
40942 | 526 |
year = 2006} |
527 |
||
6592 | 528 |
@incollection{dybjer91, |
529 |
author = {Peter Dybjer}, |
|
10186 | 530 |
title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type |
54583 | 531 |
Theory and Their Set-Theoretic Semantics}, |
6592 | 532 |
crossref = {huet-plotkin91}, |
533 |
pages = {280-306}} |
|
534 |
||
535 |
@Article{dyckhoff, |
|
536 |
author = {Roy Dyckhoff}, |
|
537 |
title = {Contraction-Free Sequent Calculi for Intuitionistic Logic}, |
|
538 |
journal = JSL, |
|
539 |
year = 1992, |
|
540 |
volume = 57, |
|
541 |
number = 3, |
|
542 |
pages = {795-807}} |
|
543 |
||
544 |
%F |
|
545 |
||
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
546 |
@Article{IMPS, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
547 |
author = {William M. Farmer and Joshua D. Guttman and F. Javier |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
548 |
Thayer}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
549 |
title = {{IMPS}: An Interactive Mathematical Proof System}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
550 |
journal = JAR, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
551 |
volume = 11, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
552 |
number = 2, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
553 |
year = 1993, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
554 |
pages = {213-248}} |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
555 |
|
6592 | 556 |
@InProceedings{felty91a, |
557 |
Author = {Amy Felty}, |
|
558 |
Title = {A Logic Program for Transforming Sequent Proofs to Natural |
|
54583 | 559 |
Deduction Proofs}, |
6592 | 560 |
crossref = {extensions91}, |
561 |
pages = {157-178}} |
|
562 |
||
10796 | 563 |
@Article{fleuriot-jcm, |
564 |
author = {Jacques Fleuriot and Lawrence C. Paulson}, |
|
565 |
title = {Mechanizing Nonstandard Real Analysis}, |
|
566 |
journal = {LMS Journal of Computation and Mathematics}, |
|
567 |
year = 2000, |
|
568 |
volume = 3, |
|
569 |
pages = {140-190}, |
|
570 |
note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}} |
|
571 |
} |
|
572 |
||
6592 | 573 |
@TechReport{frost93, |
574 |
author = {Jacob Frost}, |
|
575 |
title = {A Case Study of Co-induction in {Isabelle HOL}}, |
|
576 |
institution = CUCL, |
|
577 |
number = 308, |
|
578 |
year = 1993, |
|
579 |
month = Aug} |
|
580 |
||
581 |
%revised version of frost93 |
|
582 |
@TechReport{frost95, |
|
583 |
author = {Jacob Frost}, |
|
584 |
title = {A Case Study of Co-induction in {Isabelle}}, |
|
585 |
institution = CUCL, |
|
586 |
number = 359, |
|
587 |
year = 1995, |
|
588 |
month = Feb} |
|
589 |
||
590 |
@inproceedings{OBJ, |
|
591 |
author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud |
|
54583 | 592 |
and J. Meseguer}, |
6592 | 593 |
title = {Principles of {OBJ2}}, |
54583 | 594 |
booktitle = POPL, |
6592 | 595 |
year = 1985, |
596 |
pages = {52-66}} |
|
597 |
||
598 |
%G |
|
599 |
||
600 |
@book{gallier86, |
|
601 |
author = {J. H. Gallier}, |
|
54583 | 602 |
title = {Logic for Computer Science: |
6592 | 603 |
Foundations of Automatic Theorem Proving}, |
604 |
year = 1986, |
|
605 |
publisher = {Harper \& Row}} |
|
606 |
||
607 |
@Book{galton90, |
|
608 |
author = {Antony Galton}, |
|
609 |
title = {Logic for Information Technology}, |
|
610 |
publisher = {Wiley}, |
|
611 |
year = 1990} |
|
612 |
||
20506 | 613 |
@Article{Gentzen:1935, |
614 |
author = {G. Gentzen}, |
|
615 |
title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en}, |
|
616 |
journal = {Math. Zeitschrift}, |
|
617 |
year = 1935 |
|
618 |
} |
|
619 |
||
6592 | 620 |
@InProceedings{gimenez-codifying, |
621 |
author = {Eduardo Gim{\'e}nez}, |
|
622 |
title = {Codifying Guarded Definitions with Recursive Schemes}, |
|
623 |
crossref = {types94}, |
|
624 |
pages = {39-59} |
|
625 |
} |
|
626 |
||
9816 | 627 |
@book{girard89, |
628 |
author = {Jean-Yves Girard}, |
|
629 |
title = {Proofs and Types}, |
|
630 |
year = 1989, |
|
54583 | 631 |
publisher = CUP, |
632 |
note = {Translated by Yves Lafont and Paul Taylor}} |
|
9816 | 633 |
|
6592 | 634 |
@Book{mgordon-hol, |
11205 | 635 |
editor = {M. J. C. Gordon and T. F. Melham}, |
42907
dfd4ef8e73f6
updated and re-unified HOL typedef, with some live examples;
wenzelm
parents:
42884
diff
changeset
|
636 |
title = {Introduction to {HOL}: A Theorem Proving Environment for Higher Order Logic}, |
6592 | 637 |
publisher = CUP, |
638 |
year = 1993} |
|
639 |
||
640 |
@book{mgordon79, |
|
641 |
author = {Michael J. C. Gordon and Robin Milner and Christopher P. |
|
642 |
Wadsworth}, |
|
643 |
title = {Edinburgh {LCF}: A Mechanised Logic of Computation}, |
|
644 |
year = 1979, |
|
645 |
publisher = {Springer}, |
|
646 |
series = {LNCS 78}} |
|
647 |
||
6607 | 648 |
@inproceedings{Gunter-HOL92,author={Elsa L. Gunter}, |
649 |
title={Why we can't have {SML} style datatype declarations in {HOL}}, |
|
650 |
booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\ |
|
651 |
IFIP TC10/WG10.2 Intl. Workshop, 1992}, |
|
652 |
editor={L.J.M. Claesen and M.J.C. Gordon}, |
|
653 |
publisher=NH,year=1993,pages={561--568}} |
|
654 |
||
6592 | 655 |
@InProceedings{gunter-trees, |
656 |
author = {Elsa L. Gunter}, |
|
657 |
title = {A Broader Class of Trees for Recursive Type Definitions for |
|
658 |
{HOL}}, |
|
659 |
crossref = {hug93}, |
|
660 |
pages = {141-154}} |
|
661 |
||
662 |
%H |
|
663 |
||
53125 | 664 |
@inproceedings{Haftmann-Kraus-Kuncar-Nipkow:2013:data_refinement, |
665 |
author = {Florian Haftmann and Alexander Krauss and Ond\v{r}ej Kun\v{c}ar and Tobias Nipkow}, |
|
666 |
title = {Data Refinement in Isabelle/HOL}, |
|
667 |
booktitle = {Interactive Theorem Proving (ITP 2013)}, |
|
668 |
pages = {100-115}, |
|
669 |
year = 2013, |
|
670 |
publisher = Springer, |
|
671 |
series = {Lecture Notes in Computer Science}, |
|
672 |
volume = {7998}, |
|
673 |
editor = {S. Blazy and C. Paulin-Mohring and D. Pichardie} |
|
24193 | 674 |
} |
675 |
||
37429 | 676 |
@inproceedings{Haftmann-Nipkow:2010:code, |
677 |
author = {Florian Haftmann and Tobias Nipkow}, |
|
678 |
title = {Code Generation via Higher-Order Rewrite Systems}, |
|
679 |
booktitle = {Functional and Logic Programming: 10th International Symposium: FLOPS 2010}, |
|
680 |
year = 2010, |
|
38437 | 681 |
publisher = Springer, |
682 |
series = LNCS, |
|
37429 | 683 |
editor = {Matthias Blume and Naoki Kobayashi and Germ{\'a}n Vidal}, |
38437 | 684 |
volume = 6009 |
23956 | 685 |
} |
686 |
||
53125 | 687 |
@InProceedings{Haftmann-Wenzel:2006:classes, |
688 |
author = {Florian Haftmann and Makarius Wenzel}, |
|
689 |
title = {Constructive Type Classes in {Isabelle}}, |
|
690 |
editor = {T. Altenkirch and C. McBride}, |
|
691 |
booktitle = {Types for Proofs and Programs, TYPES 2006}, |
|
692 |
publisher = {Springer}, |
|
693 |
series = {LNCS}, |
|
694 |
volume = {4502}, |
|
695 |
year = {2007} |
|
696 |
} |
|
697 |
||
30115 | 698 |
@InProceedings{Haftmann-Wenzel:2009, |
699 |
author = {Florian Haftmann and Makarius Wenzel}, |
|
700 |
title = {Local theory specifications in {Isabelle/Isar}}, |
|
701 |
editor = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo}, |
|
702 |
booktitle = {Types for Proofs and Programs, TYPES 2008}, |
|
703 |
publisher = {Springer}, |
|
704 |
series = {LNCS}, |
|
32572 | 705 |
volume = {5497}, |
30115 | 706 |
year = {2009} |
707 |
} |
|
708 |
||
45258 | 709 |
@inproceedings{hindleymilner, |
710 |
author = {L. Damas and H. Milner}, |
|
711 |
title = {Principal type schemes for functional programs}, |
|
712 |
booktitle = {ACM Symp. Principles of Programming Languages}, |
|
713 |
year = 1982 |
|
714 |
} |
|
715 |
||
22290 | 716 |
@manual{isabelle-classes, |
24193 | 717 |
author = {Florian Haftmann}, |
718 |
title = {Haskell-style type classes with {Isabelle}/{Isar}}, |
|
719 |
institution = TUM, |
|
720 |
note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}} |
|
721 |
} |
|
22290 | 722 |
|
723 |
@manual{isabelle-codegen, |
|
24193 | 724 |
author = {Florian Haftmann}, |
725 |
title = {Code generation from Isabelle theories}, |
|
726 |
institution = TUM, |
|
727 |
note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}} |
|
728 |
} |
|
22290 | 729 |
|
6592 | 730 |
@Book{halmos60, |
731 |
author = {Paul R. Halmos}, |
|
732 |
title = {Naive Set Theory}, |
|
733 |
publisher = {Van Nostrand}, |
|
734 |
year = 1960} |
|
735 |
||
11207 | 736 |
@book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn}, |
737 |
title={Dynamic Logic},publisher=MIT,year=2000} |
|
738 |
||
6592 | 739 |
@Book{hennessy90, |
740 |
author = {Matthew Hennessy}, |
|
741 |
title = {The Semantics of Programming Languages: An Elementary |
|
742 |
Introduction Using Structural Operational Semantics}, |
|
743 |
publisher = {Wiley}, |
|
744 |
year = 1990} |
|
745 |
||
42940 | 746 |
@article{waldmeister, |
747 |
author = {Thomas Hillenbrand and Arnim Buch and Rolan Vogt and Bernd L\"ochner}, |
|
748 |
title = "Waldmeister: High-Performance Equational Deduction", |
|
749 |
journal = JAR, |
|
750 |
volume = 18, |
|
751 |
number = 2, |
|
752 |
pages = {265--270}, |
|
753 |
year = 1997} |
|
754 |
||
10244 | 755 |
@book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman}, |
756 |
title={Introduction to Automata Theory, Languages, and Computation.}, |
|
757 |
publisher={Addison-Wesley},year=1979} |
|
758 |
||
6592 | 759 |
@Article{haskell-report, |
760 |
author = {Paul Hudak and Simon Peyton Jones and Philip Wadler}, |
|
761 |
title = {Report on the Programming Language {Haskell}: A |
|
762 |
Non-strict, Purely Functional Language}, |
|
763 |
journal = SIGPLAN, |
|
764 |
year = 1992, |
|
765 |
volume = 27, |
|
766 |
number = 5, |
|
767 |
month = May, |
|
768 |
note = {Version 1.2}} |
|
769 |
||
770 |
@Article{haskell-tutorial, |
|
771 |
author = {Paul Hudak and Joseph H. Fasel}, |
|
772 |
title = {A Gentle Introduction to {Haskell}}, |
|
773 |
journal = SIGPLAN, |
|
774 |
year = 1992, |
|
775 |
volume = 27, |
|
776 |
number = 5, |
|
777 |
month = May} |
|
778 |
||
42884 | 779 |
@inproceedings{sine, |
780 |
author = "Kry\v{s}tof Hoder and Andrei Voronkov", |
|
781 |
title = "Sine Qua Non for Large Theory Reasoning", |
|
782 |
booktitle = {Automated Deduction --- CADE-23}, |
|
783 |
publisher = Springer, |
|
784 |
series = LNCS, |
|
44093 | 785 |
volume = 6803, |
786 |
pages = "299--314", |
|
42884 | 787 |
editor = "Nikolaj Bj{\o}rner and Viorica Sofronie-Stokkermans", |
44093 | 788 |
year = 2011} |
38602 | 789 |
|
11209 | 790 |
@book{Hudak-Haskell,author={Paul Hudak}, |
791 |
title={The Haskell School of Expression},publisher=CUP,year=2000} |
|
792 |
||
6592 | 793 |
@article{huet75, |
794 |
author = {G. P. Huet}, |
|
795 |
title = {A Unification Algorithm for Typed $\lambda$-Calculus}, |
|
796 |
journal = TCS, |
|
797 |
volume = 1, |
|
798 |
year = 1975, |
|
799 |
pages = {27-57}} |
|
800 |
||
801 |
@article{huet78, |
|
802 |
author = {G. P. Huet and B. Lang}, |
|
54583 | 803 |
title = {Proving and Applying Program Transformations Expressed with |
6592 | 804 |
Second-Order Patterns}, |
805 |
journal = acta, |
|
806 |
volume = 11, |
|
54583 | 807 |
year = 1978, |
6592 | 808 |
pages = {31-55}} |
809 |
||
810 |
@inproceedings{huet88, |
|
10186 | 811 |
author = {G{\'e}rard Huet}, |
6592 | 812 |
title = {Induction Principles Formalized in the {Calculus of |
54583 | 813 |
Constructions}}, |
6592 | 814 |
booktitle = {Programming of Future Generation Computers}, |
815 |
editor = {K. Fuchi and M. Nivat}, |
|
816 |
year = 1988, |
|
54583 | 817 |
pages = {205-216}, |
6592 | 818 |
publisher = {Elsevier}} |
819 |
||
54334
409d7f7247f4
update documentation of Lifting/Transfer and Quotient
kuncar
parents:
53769
diff
changeset
|
820 |
@inproceedings{Huffman-Kuncar:2013:lifting_transfer, |
409d7f7247f4
update documentation of Lifting/Transfer and Quotient
kuncar
parents:
53769
diff
changeset
|
821 |
author = {Brian Huffman and Ond\v{r}ej Kun\v{c}ar}, |
409d7f7247f4
update documentation of Lifting/Transfer and Quotient
kuncar
parents:
53769
diff
changeset
|
822 |
title = {{Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL}}, |
409d7f7247f4
update documentation of Lifting/Transfer and Quotient
kuncar
parents:
53769
diff
changeset
|
823 |
booktitle = {Certified Programs and Proofs (CPP 2013)}, |
409d7f7247f4
update documentation of Lifting/Transfer and Quotient
kuncar
parents:
53769
diff
changeset
|
824 |
year = 2013, |
409d7f7247f4
update documentation of Lifting/Transfer and Quotient
kuncar
parents:
53769
diff
changeset
|
825 |
publisher = Springer, |
409d7f7247f4
update documentation of Lifting/Transfer and Quotient
kuncar
parents:
53769
diff
changeset
|
826 |
series = {Lecture Notes in Computer Science}, |
409d7f7247f4
update documentation of Lifting/Transfer and Quotient
kuncar
parents:
53769
diff
changeset
|
827 |
volume = {8307}, |
409d7f7247f4
update documentation of Lifting/Transfer and Quotient
kuncar
parents:
53769
diff
changeset
|
828 |
} |
409d7f7247f4
update documentation of Lifting/Transfer and Quotient
kuncar
parents:
53769
diff
changeset
|
829 |
|
10186 | 830 |
@Book{Huth-Ryan-book, |
831 |
author = {Michael Huth and Mark Ryan}, |
|
832 |
title = {Logic in Computer Science. Modelling and reasoning about systems}, |
|
833 |
publisher = CUP, |
|
834 |
year = 2000} |
|
835 |
||
7041 | 836 |
@InProceedings{Harrison:1996:MizarHOL, |
837 |
author = {J. Harrison}, |
|
838 |
title = {A {Mizar} Mode for {HOL}}, |
|
839 |
pages = {203--220}, |
|
840 |
crossref = {tphols96}} |
|
841 |
||
36926 | 842 |
@misc{metis, |
843 |
author = "Joe Hurd", |
|
844 |
title = "Metis Theorem Prover", |
|
845 |
note = "\url{http://www.gilith.com/software/metis/}"} |
|
846 |
||
22290 | 847 |
%J |
848 |
||
849 |
@article{haskell-revised-report, |
|
850 |
author = {Simon {Peyton Jones} and others}, |
|
851 |
title = {The {Haskell} 98 Language and Libraries: The Revised Report}, |
|
852 |
journal = {Journal of Functional Programming}, |
|
853 |
volume = 13, |
|
854 |
number = 1, |
|
855 |
pages = {0--255}, |
|
856 |
month = {Jan}, |
|
857 |
year = 2003, |
|
858 |
note = {\url{http://www.haskell.org/definition/}}} |
|
859 |
||
33191 | 860 |
@book{jackson-2006, |
861 |
author = "Daniel Jackson", |
|
862 |
title = "Software Abstractions: Logic, Language, and Analysis", |
|
863 |
publisher = MIT, |
|
864 |
year = 2006} |
|
865 |
||
6592 | 866 |
%K |
867 |
||
6670 | 868 |
@InProceedings{kammueller-locales, |
54583 | 869 |
author = {Florian Kamm{\"u}ller and Markus Wenzel and |
6670 | 870 |
Lawrence C. Paulson}, |
871 |
title = {Locales: A Sectioning Concept for {Isabelle}}, |
|
872 |
crossref = {tphols99}} |
|
873 |
||
8284 | 874 |
@book{Knuth3-75, |
875 |
author={Donald E. Knuth}, |
|
876 |
title={The Art of Computer Programming, Volume 3: Sorting and Searching}, |
|
877 |
publisher={Addison-Wesley}, |
|
878 |
year=1975} |
|
879 |
||
880 |
@Article{korf85, |
|
881 |
author = {R. E. Korf}, |
|
882 |
title = {Depth-First Iterative-Deepening: an Optimal Admissible |
|
883 |
Tree Search}, |
|
884 |
journal = AI, |
|
885 |
year = 1985, |
|
886 |
volume = 27, |
|
887 |
pages = {97-109}} |
|
6607 | 888 |
|
45339 | 889 |
@inproceedings{korovin-2009, |
890 |
title = "Instantiation-Based Automated Reasoning: From Theory to Practice", |
|
891 |
author = "Konstantin Korovin", |
|
892 |
editor = "Renate A. Schmidt", |
|
893 |
booktitle = {Automated Deduction --- CADE-22}, |
|
894 |
series = "LNAI", |
|
895 |
volume = {5663}, |
|
896 |
pages = "163--166", |
|
897 |
year = 2009, |
|
898 |
publisher = "Springer"} |
|
899 |
||
900 |
@inproceedings{korovin-sticksel-2010, |
|
901 |
author = {Konstantin Korovin and |
|
902 |
Christoph Sticksel}, |
|
903 |
title = {{iP}rover-{E}q: An Instantiation-Based Theorem Prover with Equality}, |
|
904 |
pages = {196--202}, |
|
905 |
booktitle={Automated Reasoning: IJCAR 2010}, |
|
906 |
editor={J. Giesl and R. H\"ahnle}, |
|
907 |
publisher = Springer, |
|
908 |
series = LNCS, |
|
909 |
volume = 6173, |
|
910 |
year = 2010} |
|
911 |
||
23187 | 912 |
@InProceedings{krauss2006, |
913 |
author = {Alexander Krauss}, |
|
914 |
title = {Partial Recursive Functions in {Higher-Order Logic}}, |
|
915 |
crossref = {ijcar2006}, |
|
916 |
pages = {589--603}} |
|
917 |
||
33856 | 918 |
@PhdThesis{krauss_phd, |
919 |
author = {Alexander Krauss}, |
|
920 |
title = {Automating Recursive Definitions and Termination Proofs in Higher-Order Logic}, |
|
921 |
school = {Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen}, |
|
922 |
year = {2009}, |
|
923 |
address = {Germany} |
|
924 |
} |
|
925 |
||
24524 | 926 |
@manual{isabelle-function, |
927 |
author = {Alexander Krauss}, |
|
928 |
title = {Defining Recursive Functions in {Isabelle/HOL}}, |
|
929 |
institution = TUM, |
|
25280 | 930 |
note = {\url{http://isabelle.in.tum.de/doc/functions.pdf}} |
24524 | 931 |
} |
932 |
||
6592 | 933 |
@Book{kunen80, |
934 |
author = {Kenneth Kunen}, |
|
935 |
title = {Set Theory: An Introduction to Independence Proofs}, |
|
936 |
publisher = NH, |
|
937 |
year = 1980} |
|
938 |
||
11246 | 939 |
%L |
940 |
||
22290 | 941 |
@manual{OCaml, |
942 |
author = {Xavier Leroy and others}, |
|
943 |
title = {The Objective Caml system -- Documentation and user's manual}, |
|
944 |
note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}} |
|
945 |
||
52078 | 946 |
@misc{agsyHOL, |
947 |
author = "Fredrik Lindblad", |
|
948 |
title = "{agsyHOL}", |
|
949 |
note = "\url{https://github.com/frelindb/agsyHOL}"} |
|
950 |
||
38602 | 951 |
@incollection{lochbihler-2010, |
54146 | 952 |
title = "Coinductive", |
38602 | 953 |
author = "Andreas Lochbihler", |
954 |
booktitle = "The Archive of Formal Proofs", |
|
955 |
editor = "Gerwin Klein and Tobias Nipkow and Lawrence C. Paulson", |
|
956 |
publisher = "\url{http://afp.sourceforge.net/entries/Coinductive.shtml}", |
|
957 |
month = "Feb.", |
|
958 |
year = 2010} |
|
959 |
||
43579 | 960 |
@book{loveland-78, |
961 |
author = "D. W. Loveland", |
|
962 |
title = "Automated Theorem Proving: A Logical Basis", |
|
963 |
year = 1978, |
|
964 |
publisher = "North-Holland Publishing Co."} |
|
965 |
||
11246 | 966 |
@InProceedings{lowe-fdr, |
967 |
author = {Gavin Lowe}, |
|
968 |
title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key |
|
969 |
Protocol using {CSP} and {FDR}}, |
|
54583 | 970 |
booktitle = {Tools and Algorithms for the Construction and Analysis |
11246 | 971 |
of Systems: second international workshop, TACAS '96}, |
972 |
editor = {T. Margaria and B. Steffen}, |
|
973 |
series = {LNCS 1055}, |
|
974 |
year = 1996, |
|
975 |
publisher = {Springer}, |
|
976 |
pages = {147-166}} |
|
977 |
||
6592 | 978 |
%M |
979 |
||
980 |
@Article{mw81, |
|
981 |
author = {Zohar Manna and Richard Waldinger}, |
|
982 |
title = {Deductive Synthesis of the Unification Algorithm}, |
|
983 |
journal = SCP, |
|
984 |
year = 1981, |
|
985 |
volume = 1, |
|
986 |
number = 1, |
|
987 |
pages = {5-48}} |
|
988 |
||
989 |
@InProceedings{martin-nipkow, |
|
990 |
author = {Ursula Martin and Tobias Nipkow}, |
|
991 |
title = {Ordered Rewriting and Confluence}, |
|
992 |
crossref = {cade10}, |
|
993 |
pages = {366-380}} |
|
994 |
||
995 |
@book{martinlof84, |
|
10186 | 996 |
author = {Per Martin-L{\"o}f}, |
6592 | 997 |
title = {Intuitionistic type theory}, |
998 |
year = 1984, |
|
999 |
publisher = {Bibliopolis}} |
|
1000 |
||
1001 |
@incollection{melham89, |
|
1002 |
author = {Thomas F. Melham}, |
|
1003 |
title = {Automating Recursive Type Definitions in Higher Order |
|
54583 | 1004 |
Logic}, |
6592 | 1005 |
pages = {341-386}, |
1006 |
crossref = {birtwistle89}} |
|
1007 |
||
29728 | 1008 |
@Article{Miller:1991, |
1009 |
author = {Dale Miller}, |
|
1010 |
title = {A Logic Programming Language with Lambda-Abstraction, Function Variables, |
|
1011 |
and Simple Unification}, |
|
1012 |
journal = {Journal of Logic and Computation}, |
|
1013 |
year = 1991, |
|
1014 |
volume = 1, |
|
1015 |
number = 4 |
|
1016 |
} |
|
1017 |
||
6592 | 1018 |
@Article{miller-mixed, |
1019 |
Author = {Dale Miller}, |
|
1020 |
Title = {Unification Under a Mixed Prefix}, |
|
1021 |
journal = JSC, |
|
1022 |
volume = 14, |
|
1023 |
number = 4, |
|
1024 |
pages = {321-358}, |
|
1025 |
Year = 1992} |
|
1026 |
||
1027 |
@Article{milner78, |
|
1028 |
author = {Robin Milner}, |
|
1029 |
title = {A Theory of Type Polymorphism in Programming}, |
|
1030 |
journal = "J. Comp.\ Sys.\ Sci.", |
|
1031 |
year = 1978, |
|
1032 |
volume = 17, |
|
1033 |
pages = {348-375}} |
|
1034 |
||
1035 |
@TechReport{milner-ind, |
|
1036 |
author = {Robin Milner}, |
|
1037 |
title = {How to Derive Inductions in {LCF}}, |
|
1038 |
institution = Edinburgh, |
|
1039 |
year = 1980, |
|
1040 |
type = {note}} |
|
1041 |
||
1042 |
@Article{milner-coind, |
|
1043 |
author = {Robin Milner and Mads Tofte}, |
|
1044 |
title = {Co-induction in Relational Semantics}, |
|
1045 |
journal = TCS, |
|
1046 |
year = 1991, |
|
1047 |
volume = 87, |
|
1048 |
pages = {209-220}} |
|
1049 |
||
1050 |
@Book{milner89, |
|
1051 |
author = {Robin Milner}, |
|
1052 |
title = {Communication and Concurrency}, |
|
1053 |
publisher = Prentice, |
|
1054 |
year = 1989} |
|
1055 |
||
10970 | 1056 |
@book{SML,author="Robin Milner and Mads Tofte and Robert Harper", |
1057 |
title="The Definition of Standard ML",publisher=MIT,year=1990} |
|
1058 |
||
6592 | 1059 |
@PhdThesis{monahan84, |
1060 |
author = {Brian Q. Monahan}, |
|
1061 |
title = {Data Type Proofs using Edinburgh {LCF}}, |
|
1062 |
school = {University of Edinburgh}, |
|
1063 |
year = 1984} |
|
1064 |
||
6607 | 1065 |
@article{MuellerNvOS99, |
1066 |
author= |
|
11564 | 1067 |
{Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch}, |
11197 | 1068 |
title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}} |
6607 | 1069 |
|
9599 | 1070 |
@Manual{Muzalewski:Mizar, |
1071 |
title = {An Outline of {PC} {Mizar}}, |
|
1072 |
author = {Micha{\l} Muzalewski}, |
|
1073 |
organization = {Fondation of Logic, Mathematics and Informatics |
|
1074 |
--- Mizar Users Group}, |
|
1075 |
year = 1993, |
|
1076 |
note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}} |
|
1077 |
} |
|
1078 |
||
6592 | 1079 |
%N |
1080 |
||
1081 |
@InProceedings{NaraschewskiW-TPHOLs98, |
|
1082 |
author = {Wolfgang Naraschewski and Markus Wenzel}, |
|
54583 | 1083 |
title = |
7041 | 1084 |
{Object-Oriented Verification based on Record Subtyping in |
1085 |
Higher-Order Logic}, |
|
1086 |
crossref = {tphols98}} |
|
6592 | 1087 |
|
1088 |
@inproceedings{nazareth-nipkow, |
|
1089 |
author = {Dieter Nazareth and Tobias Nipkow}, |
|
1090 |
title = {Formal Verification of Algorithm {W}: The Monomorphic Case}, |
|
1091 |
crossref = {tphols96}, |
|
1092 |
pages = {331-345}, |
|
1093 |
year = 1996} |
|
1094 |
||
11246 | 1095 |
@Article{needham-schroeder, |
1096 |
author = "Roger M. Needham and Michael D. Schroeder", |
|
1097 |
title = "Using Encryption for Authentication in Large Networks |
|
1098 |
of Computers", |
|
1099 |
journal = cacm, |
|
1100 |
volume = 21, |
|
1101 |
number = 12, |
|
1102 |
pages = "993-999", |
|
1103 |
month = dec, |
|
1104 |
year = 1978} |
|
1105 |
||
6592 | 1106 |
@inproceedings{nipkow-W, |
1107 |
author = {Wolfgang Naraschewski and Tobias Nipkow}, |
|
1108 |
title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}}, |
|
1109 |
booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96}, |
|
10186 | 1110 |
editor = {E. Gim{\'e}nez and C. Paulin-Mohring}, |
6592 | 1111 |
publisher = Springer, |
1112 |
series = LNCS, |
|
1113 |
volume = 1512, |
|
1114 |
pages = {317-332}, |
|
1115 |
year = 1998} |
|
1116 |
||
8892 | 1117 |
@InCollection{nipkow-sorts93, |
1118 |
author = {T. Nipkow}, |
|
1119 |
title = {Order-Sorted Polymorphism in {Isabelle}}, |
|
1120 |
booktitle = {Logical Environments}, |
|
1121 |
publisher = CUP, |
|
1122 |
year = 1993, |
|
1123 |
editor = {G. Huet and G. Plotkin}, |
|
1124 |
pages = {164--188} |
|
1125 |
} |
|
1126 |
||
1127 |
@Misc{nipkow-types93, |
|
1128 |
author = {Tobias Nipkow}, |
|
1129 |
title = {Axiomatic Type Classes (in {I}sabelle)}, |
|
1130 |
howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen}, |
|
1131 |
year = 1993 |
|
1132 |
} |
|
1133 |
||
6592 | 1134 |
@inproceedings{Nipkow-CR, |
1135 |
author = {Tobias Nipkow}, |
|
1136 |
title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})}, |
|
1137 |
booktitle = {Automated Deduction --- CADE-13}, |
|
1138 |
editor = {M. McRobbie and J.K. Slaney}, |
|
1139 |
publisher = Springer, |
|
1140 |
series = LNCS, |
|
1141 |
volume = 1104, |
|
1142 |
pages = {733-747}, |
|
1143 |
year = 1996} |
|
1144 |
||
1145 |
% WAS Nipkow-LICS-93 |
|
1146 |
@InProceedings{nipkow-patterns, |
|
1147 |
title = {Functional Unification of Higher-Order Patterns}, |
|
1148 |
author = {Tobias Nipkow}, |
|
1149 |
pages = {64-74}, |
|
1150 |
crossref = {lics8}, |
|
6745 | 1151 |
url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}}, |
6592 | 1152 |
keywords = {unification}} |
1153 |
||
1154 |
@article{nipkow-IMP, |
|
1155 |
author = {Tobias Nipkow}, |
|
1156 |
title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook}, |
|
1157 |
journal = FAC, |
|
1158 |
volume = 10, |
|
1159 |
pages = {171-186}, |
|
1160 |
year = 1998} |
|
1161 |
||
15429 | 1162 |
@inproceedings{Nipkow-TYPES02, |
1163 |
author = {Tobias Nipkow}, |
|
1164 |
title = {{Structured Proofs in Isar/HOL}}, |
|
1165 |
booktitle = {Types for Proofs and Programs (TYPES 2002)}, |
|
1166 |
editor = {H. Geuvers and F. Wiedijk}, |
|
1167 |
year = 2003, |
|
1168 |
publisher = Springer, |
|
1169 |
series = LNCS, |
|
1170 |
volume = 2646, |
|
1171 |
pages = {259-278}} |
|
1172 |
||
6607 | 1173 |
@manual{isabelle-HOL, |
1174 |
author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel}, |
|
1175 |
title = {{Isabelle}'s Logics: {HOL}}, |
|
10186 | 1176 |
institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t |
1177 |
M{\"u}nchen and Computer Laboratory, University of Cambridge}, |
|
8892 | 1178 |
note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}} |
6607 | 1179 |
|
6592 | 1180 |
@article{nipkow-prehofer, |
1181 |
author = {Tobias Nipkow and Christian Prehofer}, |
|
1182 |
title = {Type Reconstruction for Type Classes}, |
|
1183 |
journal = JFP, |
|
1184 |
volume = 5, |
|
1185 |
number = 2, |
|
1186 |
year = 1995, |
|
1187 |
pages = {201-224}} |
|
1188 |
||
23956 | 1189 |
@InProceedings{Nipkow-Prehofer:1993, |
1190 |
author = {T. Nipkow and C. Prehofer}, |
|
1191 |
title = {Type checking type classes}, |
|
1192 |
booktitle = {ACM Symp.\ Principles of Programming Languages}, |
|
1193 |
year = 1993 |
|
1194 |
} |
|
1195 |
||
14147 | 1196 |
@Book{isa-tutorial, |
1197 |
author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel}, |
|
33191 | 1198 |
title = {Isabelle/{HOL}: A Proof Assistant for Higher-Order Logic}, |
1199 |
publisher = Springer, |
|
14147 | 1200 |
year = 2002, |
33191 | 1201 |
series = LNCS, |
1202 |
volume = 2283} |
|
14147 | 1203 |
|
6592 | 1204 |
@Article{noel, |
1205 |
author = {Philippe No{\"e}l}, |
|
1206 |
title = {Experimenting with {Isabelle} in {ZF} Set Theory}, |
|
1207 |
journal = JAR, |
|
1208 |
volume = 10, |
|
1209 |
number = 1, |
|
1210 |
pages = {15-58}, |
|
1211 |
year = 1993} |
|
1212 |
||
1213 |
@book{nordstrom90, |
|
10186 | 1214 |
author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith}, |
1215 |
title = {Programming in {Martin-L{\"o}f}'s Type Theory. An |
|
54583 | 1216 |
Introduction}, |
1217 |
publisher = {Oxford University Press}, |
|
6592 | 1218 |
year = 1990} |
1219 |
||
1220 |
%O |
|
1221 |
||
38814 | 1222 |
@TechReport{scala-overview-tech-report, |
1223 |
author = {Martin Odersky and al.}, |
|
1224 |
title = {An Overview of the Scala Programming Language}, |
|
1225 |
institution = {EPFL Lausanne, Switzerland}, |
|
1226 |
year = 2004, |
|
1227 |
number = {IC/2004/64} |
|
1228 |
} |
|
1229 |
||
46286 | 1230 |
@Article{Oppen:1980, |
1231 |
author = {D. C. Oppen}, |
|
1232 |
title = {Pretty Printing}, |
|
1233 |
journal = {ACM Transactions on Programming Languages and Systems}, |
|
1234 |
year = 1980, |
|
1235 |
volume = 2, |
|
1236 |
number = 4} |
|
1237 |
||
6592 | 1238 |
@Manual{pvs-language, |
1239 |
title = {The {PVS} specification language}, |
|
1240 |
author = {S. Owre and N. Shankar and J. M. Rushby}, |
|
1241 |
organization = {Computer Science Laboratory, SRI International}, |
|
1242 |
address = {Menlo Park, CA}, |
|
6745 | 1243 |
note = {Beta release}, |
6592 | 1244 |
year = 1993, |
1245 |
month = apr, |
|
6619 | 1246 |
url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}} |
6592 | 1247 |
|
1248 |
%P |
|
1249 |
||
1250 |
% replaces paulin92 |
|
1251 |
@InProceedings{paulin-tlca, |
|
1252 |
author = {Christine Paulin-Mohring}, |
|
1253 |
title = {Inductive Definitions in the System {Coq}: Rules and |
|
1254 |
Properties}, |
|
1255 |
crossref = {tlca93}, |
|
1256 |
pages = {328-345}} |
|
1257 |
||
50122 | 1258 |
@Article{paulson:1983, |
1259 |
author = {L. C. Paulson}, |
|
1260 |
title = {A higher-order implementation of rewriting}, |
|
1261 |
journal = {Science of Computer Programming}, |
|
1262 |
year = 1983, |
|
1263 |
volume = 3, |
|
1264 |
pages = {119--149}, |
|
1265 |
note = {\url{http://www.cl.cam.ac.uk/~lp15/papers/Reports/TR035-lcp-rewriting.pdf}}} |
|
1266 |
||
6592 | 1267 |
@InProceedings{paulson-CADE, |
1268 |
author = {Lawrence C. Paulson}, |
|
1269 |
title = {A Fixedpoint Approach to Implementing (Co)Inductive |
|
1270 |
Definitions}, |
|
1271 |
pages = {148-161}, |
|
1272 |
crossref = {cade12}} |
|
1273 |
||
1274 |
@InProceedings{paulson-COLOG, |
|
1275 |
author = {Lawrence C. Paulson}, |
|
1276 |
title = {A Formulation of the Simple Theory of Types (for |
|
54583 | 1277 |
{Isabelle})}, |
6592 | 1278 |
pages = {246-274}, |
1279 |
crossref = {colog88}, |
|
6619 | 1280 |
url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}} |
6592 | 1281 |
|
1282 |
@Article{paulson-coind, |
|
1283 |
author = {Lawrence C. Paulson}, |
|
1284 |
title = {Mechanizing Coinduction and Corecursion in Higher-Order |
|
1285 |
Logic}, |
|
1286 |
journal = JLC, |
|
1287 |
year = 1997, |
|
1288 |
volume = 7, |
|
1289 |
number = 2, |
|
1290 |
month = mar, |
|
1291 |
pages = {175-204}} |
|
1292 |
||
12616 | 1293 |
@manual{isabelle-intro, |
1294 |
author = {Lawrence C. Paulson}, |
|
39852 | 1295 |
title = {Old Introduction to {Isabelle}}, |
12616 | 1296 |
institution = CUCL, |
1297 |
note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}} |
|
1298 |
||
1299 |
@manual{isabelle-logics, |
|
1300 |
author = {Lawrence C. Paulson}, |
|
1301 |
title = {{Isabelle's} Logics}, |
|
1302 |
institution = CUCL, |
|
1303 |
note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}} |
|
1304 |
||
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1305 |
@manual{isabelle-ref, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1306 |
author = {Lawrence C. Paulson}, |
39852 | 1307 |
title = {The Old {Isabelle} Reference Manual}, |
8892 | 1308 |
institution = CUCL, |
1309 |
note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}} |
|
6607 | 1310 |
|
1311 |
@manual{isabelle-ZF, |
|
6592 | 1312 |
author = {Lawrence C. Paulson}, |
1313 |
title = {{Isabelle}'s Logics: {FOL} and {ZF}}, |
|
8892 | 1314 |
institution = CUCL, |
1315 |
note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}} |
|
6592 | 1316 |
|
1317 |
@article{paulson-found, |
|
1318 |
author = {Lawrence C. Paulson}, |
|
1319 |
title = {The Foundation of a Generic Theorem Prover}, |
|
1320 |
journal = JAR, |
|
1321 |
volume = 5, |
|
1322 |
number = 3, |
|
1323 |
pages = {363-397}, |
|
1324 |
year = 1989, |
|
6619 | 1325 |
url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}} |
6592 | 1326 |
|
1327 |
%replaces paulson-final |
|
1328 |
@Article{paulson-mscs, |
|
1329 |
author = {Lawrence C. Paulson}, |
|
54583 | 1330 |
title = {Final Coalgebras as Greatest Fixed Points |
7991 | 1331 |
in {ZF} Set Theory}, |
6592 | 1332 |
journal = {Mathematical Structures in Computer Science}, |
1333 |
year = 1999, |
|
1334 |
volume = 9, |
|
23505 | 1335 |
number = 5, |
1336 |
pages = {545-567}} |
|
6592 | 1337 |
|
1338 |
@InCollection{paulson-generic, |
|
1339 |
author = {Lawrence C. Paulson}, |
|
1340 |
title = {Generic Automatic Proof Tools}, |
|
1341 |
crossref = {wos-fest}, |
|
1342 |
chapter = 3} |
|
1343 |
||
1344 |
@Article{paulson-gr, |
|
1345 |
author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski}, |
|
1346 |
title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of |
|
1347 |
Choice}, |
|
1348 |
journal = JAR, |
|
1349 |
year = 1996, |
|
1350 |
volume = 17, |
|
1351 |
number = 3, |
|
1352 |
month = dec, |
|
1353 |
pages = {291-323}} |
|
1354 |
||
14210 | 1355 |
@InCollection{paulson-fixedpt-milner, |
1356 |
author = {Lawrence C. Paulson}, |
|
1357 |
title = {A Fixedpoint Approach to (Co)inductive and |
|
1358 |
(Co)datatype Definitions}, |
|
1359 |
pages = {187-211}, |
|
1360 |
crossref = {milner-fest}} |
|
1361 |
||
1362 |
@book{milner-fest, |
|
54583 | 1363 |
title = {Proof, Language, and Interaction: |
14210 | 1364 |
Essays in Honor of {Robin Milner}}, |
54583 | 1365 |
booktitle = {Proof, Language, and Interaction: |
14210 | 1366 |
Essays in Honor of {Robin Milner}}, |
33191 | 1367 |
publisher = MIT, |
14210 | 1368 |
year = 2000, |
1369 |
editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}} |
|
1370 |
||
6592 | 1371 |
@InCollection{paulson-handbook, |
1372 |
author = {Lawrence C. Paulson}, |
|
1373 |
title = {Designing a Theorem Prover}, |
|
1374 |
crossref = {handbk-lics2}, |
|
1375 |
pages = {415-475}} |
|
1376 |
||
1377 |
@Book{paulson-isa-book, |
|
1378 |
author = {Lawrence C. Paulson}, |
|
1379 |
title = {Isabelle: A Generic Theorem Prover}, |
|
1380 |
publisher = {Springer}, |
|
1381 |
year = 1994, |
|
1382 |
note = {LNCS 828}} |
|
1383 |
||
12878 | 1384 |
@Book{isabelle-hol-book, |
1385 |
author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel}, |
|
1386 |
title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic}, |
|
1387 |
publisher = {Springer}, |
|
1388 |
year = 2002, |
|
1389 |
note = {LNCS 2283}} |
|
1390 |
||
6592 | 1391 |
@InCollection{paulson-markt, |
1392 |
author = {Lawrence C. Paulson}, |
|
1393 |
title = {Tool Support for Logics of Programs}, |
|
1394 |
booktitle = {Mathematical Methods in Program Development: |
|
1395 |
Summer School Marktoberdorf 1996}, |
|
1396 |
publisher = {Springer}, |
|
1397 |
pages = {461-498}, |
|
1398 |
year = {Published 1997}, |
|
1399 |
editor = {Manfred Broy}, |
|
1400 |
series = {NATO ASI Series F}} |
|
1401 |
||
1402 |
%replaces Paulson-ML and paulson91 |
|
1403 |
@book{paulson-ml2, |
|
1404 |
author = {Lawrence C. Paulson}, |
|
1405 |
title = {{ML} for the Working Programmer}, |
|
1406 |
year = 1996, |
|
1407 |
edition = {2nd}, |
|
1408 |
publisher = CUP} |
|
1409 |
||
1410 |
@article{paulson-natural, |
|
1411 |
author = {Lawrence C. Paulson}, |
|
1412 |
title = {Natural Deduction as Higher-order Resolution}, |
|
1413 |
journal = JLP, |
|
1414 |
volume = 3, |
|
1415 |
pages = {237-258}, |
|
1416 |
year = 1986, |
|
6619 | 1417 |
url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}} |
6592 | 1418 |
|
1419 |
@Article{paulson-set-I, |
|
1420 |
author = {Lawrence C. Paulson}, |
|
1421 |
title = {Set Theory for Verification: {I}. {From} |
|
1422 |
Foundations to Functions}, |
|
1423 |
journal = JAR, |
|
1424 |
volume = 11, |
|
1425 |
number = 3, |
|
1426 |
pages = {353-389}, |
|
1427 |
year = 1993, |
|
14385 | 1428 |
url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}} |
6592 | 1429 |
|
1430 |
@Article{paulson-set-II, |
|
1431 |
author = {Lawrence C. Paulson}, |
|
1432 |
title = {Set Theory for Verification: {II}. {Induction} and |
|
1433 |
Recursion}, |
|
1434 |
journal = JAR, |
|
1435 |
volume = 15, |
|
1436 |
number = 2, |
|
1437 |
pages = {167-215}, |
|
1438 |
year = 1995, |
|
6619 | 1439 |
url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}} |
6592 | 1440 |
|
1441 |
@article{paulson85, |
|
1442 |
author = {Lawrence C. Paulson}, |
|
1443 |
title = {Verifying the Unification Algorithm in {LCF}}, |
|
1444 |
journal = SCP, |
|
1445 |
volume = 5, |
|
1446 |
pages = {143-170}, |
|
1447 |
year = 1985} |
|
1448 |
||
11564 | 1449 |
%replaces Paulson-LCF |
6592 | 1450 |
@book{paulson87, |
1451 |
author = {Lawrence C. Paulson}, |
|
1452 |
title = {Logic and Computation: Interactive proof with Cambridge |
|
54583 | 1453 |
LCF}, |
6592 | 1454 |
year = 1987, |
1455 |
publisher = CUP} |
|
1456 |
||
1457 |
@incollection{paulson700, |
|
1458 |
author = {Lawrence C. Paulson}, |
|
1459 |
title = {{Isabelle}: The Next 700 Theorem Provers}, |
|
1460 |
crossref = {odifreddi90}, |
|
1461 |
pages = {361-386}, |
|
6619 | 1462 |
url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}} |
6592 | 1463 |
|
1464 |
% replaces paulson-ns and paulson-security |
|
1465 |
@Article{paulson-jcs, |
|
1466 |
author = {Lawrence C. Paulson}, |
|
1467 |
title = {The Inductive Approach to Verifying Cryptographic Protocols}, |
|
1468 |
journal = JCS, |
|
1469 |
year = 1998, |
|
1470 |
volume = 6, |
|
1471 |
pages = {85-128}} |
|
1472 |
||
11246 | 1473 |
@Article{paulson-tls, |
1474 |
author = {Lawrence C. Paulson}, |
|
1475 |
title = {Inductive Analysis of the {Internet} Protocol {TLS}}, |
|
1476 |
journal = TISSEC, |
|
1477 |
month = aug, |
|
1478 |
year = 1999, |
|
1479 |
volume = 2, |
|
1480 |
number = 3, |
|
1481 |
pages = {332-351}} |
|
21074 | 1482 |
|
1483 |
@Article{paulson-yahalom, |
|
1484 |
author = {Lawrence C. Paulson}, |
|
1485 |
title = {Relations Between Secrets: |
|
1486 |
Two Formal Analyses of the {Yahalom} Protocol}, |
|
1487 |
journal = JCS, |
|
23505 | 1488 |
volume = 9, |
1489 |
number = 3, |
|
1490 |
pages = {197-216}, |
|
1491 |
year = 2001}} |
|
11246 | 1492 |
|
6592 | 1493 |
@article{pelletier86, |
1494 |
author = {F. J. Pelletier}, |
|
1495 |
title = {Seventy-five Problems for Testing Automatic Theorem |
|
54583 | 1496 |
Provers}, |
6592 | 1497 |
journal = JAR, |
1498 |
volume = 2, |
|
1499 |
pages = {191-216}, |
|
1500 |
year = 1986, |
|
1501 |
note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}} |
|
1502 |
||
42907
dfd4ef8e73f6
updated and re-unified HOL typedef, with some live examples;
wenzelm
parents:
42884
diff
changeset
|
1503 |
@InCollection{pitts93, |
dfd4ef8e73f6
updated and re-unified HOL typedef, with some live examples;
wenzelm
parents:
42884
diff
changeset
|
1504 |
author = {A. Pitts}, |
dfd4ef8e73f6
updated and re-unified HOL typedef, with some live examples;
wenzelm
parents:
42884
diff
changeset
|
1505 |
title = {The {HOL} Logic}, |
dfd4ef8e73f6
updated and re-unified HOL typedef, with some live examples;
wenzelm
parents:
42884
diff
changeset
|
1506 |
editor = {M. J. C. Gordon and T. F. Melham}, |
dfd4ef8e73f6
updated and re-unified HOL typedef, with some live examples;
wenzelm
parents:
42884
diff
changeset
|
1507 |
booktitle = {Introduction to {HOL}: A Theorem Proving Environment for Higher Order Logic}, |
dfd4ef8e73f6
updated and re-unified HOL typedef, with some live examples;
wenzelm
parents:
42884
diff
changeset
|
1508 |
pages = {191--232}, |
dfd4ef8e73f6
updated and re-unified HOL typedef, with some live examples;
wenzelm
parents:
42884
diff
changeset
|
1509 |
publisher = CUP, |
dfd4ef8e73f6
updated and re-unified HOL typedef, with some live examples;
wenzelm
parents:
42884
diff
changeset
|
1510 |
year = 1993} |
dfd4ef8e73f6
updated and re-unified HOL typedef, with some live examples;
wenzelm
parents:
42884
diff
changeset
|
1511 |
|
54583 | 1512 |
@Article{pitts94, |
6592 | 1513 |
author = {Andrew M. Pitts}, |
1514 |
title = {A Co-induction Principle for Recursively Defined Domains}, |
|
1515 |
journal = TCS, |
|
54583 | 1516 |
volume = 124, |
6592 | 1517 |
pages = {195-219}, |
54583 | 1518 |
year = 1994} |
6592 | 1519 |
|
1520 |
@Article{plaisted90, |
|
1521 |
author = {David A. Plaisted}, |
|
1522 |
title = {A Sequent-Style Model Elimination Strategy and a Positive |
|
1523 |
Refinement}, |
|
1524 |
journal = JAR, |
|
1525 |
year = 1990, |
|
1526 |
volume = 6, |
|
1527 |
number = 4, |
|
1528 |
pages = {389-402}} |
|
1529 |
||
1530 |
%Q |
|
1531 |
||
1532 |
@Article{quaife92, |
|
1533 |
author = {Art Quaife}, |
|
1534 |
title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set |
|
1535 |
Theory}, |
|
1536 |
journal = JAR, |
|
1537 |
year = 1992, |
|
1538 |
volume = 8, |
|
1539 |
number = 1, |
|
1540 |
pages = {91-147}} |
|
1541 |
||
1542 |
%R |
|
1543 |
||
1544 |
@TechReport{rasmussen95, |
|
1545 |
author = {Ole Rasmussen}, |
|
1546 |
title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting |
|
1547 |
Experiment}, |
|
1548 |
institution = {Computer Laboratory, University of Cambridge}, |
|
1549 |
year = 1995, |
|
1550 |
number = 364, |
|
1551 |
month = may, |
|
6619 | 1552 |
url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}} |
6592 | 1553 |
|
1554 |
@Book{reeves90, |
|
1555 |
author = {Steve Reeves and Michael Clarke}, |
|
1556 |
title = {Logic for Computer Science}, |
|
1557 |
publisher = {Addison-Wesley}, |
|
1558 |
year = 1990} |
|
1559 |
||
36926 | 1560 |
@article{riazanov-voronkov-2002, |
1561 |
author = "Alexander Riazanov and Andrei Voronkov", |
|
1562 |
title = "The Design and Implementation of {Vampire}", |
|
1563 |
journal = "Journal of AI Communications", |
|
1564 |
year = 2002, |
|
1565 |
volume = 15, |
|
1566 |
number ="2/3", |
|
1567 |
pages = "91--110"} |
|
1568 |
||
11209 | 1569 |
@book{Rosen-DMA,author={Kenneth H. Rosen}, |
1570 |
title={Discrete Mathematics and Its Applications}, |
|
1571 |
publisher={McGraw-Hill},year=1998} |
|
1572 |
||
7041 | 1573 |
@InProceedings{Rudnicki:1992:MizarOverview, |
1574 |
author = {P. Rudnicki}, |
|
1575 |
title = {An Overview of the {MIZAR} Project}, |
|
1576 |
booktitle = {1992 Workshop on Types for Proofs and Programs}, |
|
1577 |
year = 1992, |
|
1578 |
organization = {Chalmers University of Technology}, |
|
1579 |
publisher = {Bastad} |
|
1580 |
} |
|
1581 |
||
6592 | 1582 |
%S |
1583 |
||
1584 |
@inproceedings{saaltink-fme, |
|
1585 |
author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and |
|
1586 |
Dan Craigen and Irwin Meisels}, |
|
54583 | 1587 |
title = {An {EVES} Data Abstraction Example}, |
6592 | 1588 |
pages = {578-596}, |
1589 |
crossref = {fme93}} |
|
1590 |
||
29728 | 1591 |
@Article{Schroeder-Heister:1984, |
1592 |
author = {Peter Schroeder-Heister}, |
|
1593 |
title = {A Natural Extension of Natural Deduction}, |
|
1594 |
journal = {Journal of Symbolic Logic}, |
|
1595 |
year = 1984, |
|
1596 |
volume = 49, |
|
1597 |
number = 4 |
|
1598 |
} |
|
1599 |
||
36926 | 1600 |
@article{schulz-2002, |
1601 |
author = "Stephan Schulz", |
|
1602 |
title = "E---A Brainiac Theorem Prover", |
|
1603 |
journal = "Journal of AI Communications", |
|
1604 |
year = 2002, |
|
1605 |
volume = 15, |
|
1606 |
number ="2/3", |
|
1607 |
pages = "111--126"} |
|
1608 |
||
6592 | 1609 |
@inproceedings{slind-tfl, |
1610 |
author = {Konrad Slind}, |
|
1611 |
title = {Function Definition in Higher Order Logic}, |
|
23187 | 1612 |
crossref = {tphols96}, |
1613 |
pages = {381-397}} |
|
6592 | 1614 |
|
38602 | 1615 |
@inproceedings{snark, |
1616 |
author = {M. Stickel and R. Waldinger and M. Lowry and T. Pressburger and I. Underwood}, |
|
1617 |
title = {Deductive composition of astronomical software from subroutine libraries}, |
|
1618 |
pages = "341--355", |
|
1619 |
crossref = {cade12}} |
|
1620 |
||
6592 | 1621 |
@book{suppes72, |
1622 |
author = {Patrick Suppes}, |
|
1623 |
title = {Axiomatic Set Theory}, |
|
1624 |
year = 1972, |
|
1625 |
publisher = {Dover}} |
|
1626 |
||
36926 | 1627 |
@inproceedings{sutcliffe-2000, |
1628 |
author = "Geoff Sutcliffe", |
|
1629 |
title = "System Description: {SystemOnTPTP}", |
|
39219 | 1630 |
editor = "David McAllester", |
36926 | 1631 |
booktitle = {Automated Deduction --- {CADE}-17 International Conference}, |
1632 |
series = "Lecture Notes in Artificial Intelligence", |
|
1633 |
volume = {1831}, |
|
1634 |
pages = "406--410", |
|
1635 |
year = 2000, |
|
1636 |
publisher = Springer} |
|
1637 |
||
42535
3c1f302b3ee6
added support for ToFoF prover for experimenting with the TPTP TFF (typed first-order) format
blanchet
parents:
42215
diff
changeset
|
1638 |
@misc{tofof, |
3c1f302b3ee6
added support for ToFoF prover for experimenting with the TPTP TFF (typed first-order) format
blanchet
parents:
42215
diff
changeset
|
1639 |
author = "Geoff Sutcliffe", |
3c1f302b3ee6
added support for ToFoF prover for experimenting with the TPTP TFF (typed first-order) format
blanchet
parents:
42215
diff
changeset
|
1640 |
title = "{ToFoF}", |
3c1f302b3ee6
added support for ToFoF prover for experimenting with the TPTP TFF (typed first-order) format
blanchet
parents:
42215
diff
changeset
|
1641 |
note = "\url{http://www.cs.miami.edu/~tptp/ATPSystems/ToFoF/}"} |
3c1f302b3ee6
added support for ToFoF prover for experimenting with the TPTP TFF (typed first-order) format
blanchet
parents:
42215
diff
changeset
|
1642 |
|
39867
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1643 |
@Article{Sutter:2005, |
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1644 |
author = {H. Sutter}, |
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1645 |
title = {The Free Lunch Is Over --- A Fundamental Turn Toward Concurrency in Software}, |
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1646 |
journal = {Dr. Dobb's Journal}, |
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1647 |
year = 2005, |
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1648 |
volume = 30, |
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1649 |
number = 3} |
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1650 |
|
6592 | 1651 |
@InCollection{szasz93, |
1652 |
author = {Nora Szasz}, |
|
1653 |
title = {A Machine Checked Proof that {Ackermann's} Function is not |
|
1654 |
Primitive Recursive}, |
|
1655 |
crossref = {huet-plotkin93}, |
|
1656 |
pages = {317-338}} |
|
1657 |
||
7041 | 1658 |
@TechReport{Syme:1997:DECLARE, |
1659 |
author = {D. Syme}, |
|
1660 |
title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic}, |
|
1661 |
institution = {University of Cambridge Computer Laboratory}, |
|
1662 |
year = 1997, |
|
1663 |
number = 416 |
|
1664 |
} |
|
1665 |
||
1666 |
@PhdThesis{Syme:1998:thesis, |
|
1667 |
author = {D. Syme}, |
|
1668 |
title = {Declarative Theorem Proving for Operational Semantics}, |
|
1669 |
school = {University of Cambridge}, |
|
1670 |
year = 1998, |
|
1671 |
note = {Submitted} |
|
1672 |
} |
|
1673 |
||
1674 |
@InProceedings{Syme:1999:TPHOL, |
|
1675 |
author = {D. Syme}, |
|
1676 |
title = {Three Tactic Theorem Proving}, |
|
1677 |
crossref = {tphols99}} |
|
1678 |
||
6592 | 1679 |
%T |
1680 |
||
1681 |
@book{takeuti87, |
|
1682 |
author = {G. Takeuti}, |
|
1683 |
title = {Proof Theory}, |
|
1684 |
year = 1987, |
|
1685 |
publisher = NH, |
|
1686 |
edition = {2nd}} |
|
1687 |
||
1688 |
@Book{thompson91, |
|
1689 |
author = {Simon Thompson}, |
|
1690 |
title = {Type Theory and Functional Programming}, |
|
1691 |
publisher = {Addison-Wesley}, |
|
1692 |
year = 1991} |
|
1693 |
||
11209 | 1694 |
@book{Thompson-Haskell,author={Simon Thompson}, |
1695 |
title={Haskell: The Craft of Functional Programming}, |
|
1696 |
publisher={Addison-Wesley},year=1999} |
|
1697 |
||
33191 | 1698 |
@misc{kodkod-2009, |
1699 |
author = "Emina Torlak", |
|
1700 |
title = {Kodkod: Constraint Solver for Relational Logic}, |
|
1701 |
note = "\url{http://alloy.mit.edu/kodkod/}"} |
|
1702 |
||
1703 |
@misc{kodkod-2009-options, |
|
1704 |
author = "Emina Torlak", |
|
1705 |
title = "Kodkod {API}: Class {Options}", |
|
1706 |
note = "\url{http://alloy.mit.edu/kodkod/docs/kodkod/engine/config/Options.html}"} |
|
1707 |
||
1708 |
@inproceedings{torlak-jackson-2007, |
|
1709 |
title = "Kodkod: A Relational Model Finder", |
|
1710 |
author = "Emina Torlak and Daniel Jackson", |
|
1711 |
editor = "Orna Grumberg and Michael Huth", |
|
1712 |
booktitle = "TACAS 2007", |
|
1713 |
series = LNCS, |
|
1714 |
volume = {4424}, |
|
1715 |
pages = "632--647", |
|
1716 |
year = 2007, |
|
1717 |
publisher = Springer} |
|
1718 |
||
54337 | 1719 |
@inproceedings{traytel-berghofer-nipkow-2011, |
1720 |
author = {Dmitriy Traytel and Stefan Berghofer and Tobias Nipkow}, |
|
1721 |
title = {{Extending Hindley-Milner Type Inference with Coercive Structural Subtyping}}, |
|
43994 | 1722 |
year = 2011, |
54337 | 1723 |
editor = {Hongseok Yang}, |
1724 |
booktitle = "APLAS 2011", |
|
1725 |
series = LNCS, |
|
1726 |
volume = {7078}, |
|
1727 |
pages = "89--104"} |
|
52805 | 1728 |
|
1729 |
@inproceedings{traytel-et-al-2012, |
|
1730 |
author = "Dmitriy Traytel and Andrei Popescu and Jasmin Christian Blanchette", |
|
1731 |
title = {Foundational, Compositional (Co)datatypes for Higher-Order |
|
1732 |
Logic---{C}ategory Theory Applied to Theorem Proving}, |
|
1733 |
year = {2012}, |
|
1734 |
pages = {596--605}, |
|
1735 |
booktitle = {LICS 2012}, |
|
1736 |
publisher = {IEEE} |
|
43994 | 1737 |
} |
1738 |
||
7041 | 1739 |
@Unpublished{Trybulec:1993:MizarFeatures, |
1740 |
author = {A. Trybulec}, |
|
1741 |
title = {Some Features of the {Mizar} Language}, |
|
1742 |
note = {Presented at a workshop in Turin, Italy}, |
|
1743 |
year = 1993 |
|
1744 |
} |
|
1745 |
||
6592 | 1746 |
%V |
1747 |
||
1748 |
@Unpublished{voelker94, |
|
10186 | 1749 |
author = {Norbert V{\"o}lker}, |
6592 | 1750 |
title = {The Verification of a Timer Program using {Isabelle/HOL}}, |
6745 | 1751 |
url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}}, |
6592 | 1752 |
year = 1994, |
1753 |
month = aug} |
|
1754 |
||
1755 |
%W |
|
1756 |
||
23956 | 1757 |
@inproceedings{wadler89how, |
1758 |
author = {P. Wadler and S. Blott}, |
|
1759 |
title = {How to make ad-hoc polymorphism less ad-hoc}, |
|
1760 |
booktitle = {ACM Symp.\ Principles of Programming Languages}, |
|
1761 |
year = 1989 |
|
1762 |
} |
|
1763 |
||
33191 | 1764 |
@phdthesis{weber-2008, |
1765 |
author = "Tjark Weber", |
|
1766 |
title = "SAT-Based Finite Model Generation for Higher-Order Logic", |
|
1767 |
school = {Dept.\ of Informatics, T.U. M\"unchen}, |
|
1768 |
type = "{Ph.D.}\ thesis", |
|
1769 |
year = 2008} |
|
1770 |
||
8505 | 1771 |
@Misc{x-symbol, |
1772 |
author = {Christoph Wedler}, |
|
1773 |
title = {Emacs package ``{X-Symbol}''}, |
|
13141 | 1774 |
note = {\url{http://x-symbol.sourceforge.net}} |
8505 | 1775 |
} |
1776 |
||
36926 | 1777 |
@misc{weidenbach-et-al-2009, |
1778 |
author = "Christoph Weidenbach and Dilyana Dimova and Arnaud Fietzke and Rohit Kumar and Martin Suda and Patrick Wischnewski", |
|
1779 |
title = "{SPASS} Version 3.5", |
|
1780 |
note = {\url{http://www.spass-prover.org/publications/spass.pdf}}} |
|
1781 |
||
7858 | 1782 |
@manual{isabelle-sys, |
1783 |
author = {Markus Wenzel and Stefan Berghofer}, |
|
1784 |
title = {The {Isabelle} System Manual}, |
|
8892 | 1785 |
institution = {TU Munich}, |
1786 |
note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}} |
|
7858 | 1787 |
|
1788 |
@manual{isabelle-isar-ref, |
|
28837 | 1789 |
author = {Makarius Wenzel}, |
7966 | 1790 |
title = {The {Isabelle/Isar} Reference Manual}, |
8892 | 1791 |
institution = {TU Munich}, |
1792 |
note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}} |
|
1793 |
||
28837 | 1794 |
@manual{isabelle-implementation, |
1795 |
author = {Makarius Wenzel}, |
|
1796 |
title = {The {Isabelle/Isar} Implementation}, |
|
1797 |
institution = {TU Munich}, |
|
1798 |
note = {\url{http://isabelle.in.tum.de/doc/implementation.pdf}}} |
|
1799 |
||
7041 | 1800 |
@InProceedings{Wenzel:1999:TPHOL, |
1801 |
author = {Markus Wenzel}, |
|
1802 |
title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents}, |
|
1803 |
crossref = {tphols99}} |
|
6624 | 1804 |
|
1805 |
@InProceedings{Wenzel:1997:TPHOL, |
|
1806 |
author = {Markus Wenzel}, |
|
1807 |
title = {Type Classes and Overloading in Higher-Order Logic}, |
|
7041 | 1808 |
crossref = {tphols97}} |
1809 |
||
14147 | 1810 |
@phdthesis{Wenzel-PhD, |
1811 |
author={Markus Wenzel}, |
|
1812 |
title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents}, |
|
1813 |
school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen}, |
|
1814 |
year=2002, |
|
12901 | 1815 |
note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}} |
7041 | 1816 |
|
29715 | 1817 |
@Article{Wenzel-Wiedijk:2002, |
1818 |
author = {Freek Wiedijk and Markus Wenzel}, |
|
1819 |
title = {A comparison of the mathematical proof languages {Mizar} and {Isar}.}, |
|
1820 |
journal = {Journal of Automated Reasoning}, |
|
1821 |
year = 2002, |
|
1822 |
volume = 29, |
|
1823 |
number = {3-4} |
|
1824 |
} |
|
1825 |
||
1826 |
@InCollection{Wenzel-Paulson:2006, |
|
1827 |
author = {Markus Wenzel and Lawrence C. Paulson}, |
|
1828 |
title = {{Isabelle/Isar}}, |
|
1829 |
booktitle = {The Seventeen Provers of the World}, |
|
1830 |
year = 2006, |
|
1831 |
editor = {F. Wiedijk}, |
|
1832 |
series = {LNAI 3600} |
|
1833 |
} |
|
1834 |
||
27060 | 1835 |
@InCollection{Wenzel:2006:Festschrift, |
1836 |
author = {Makarius Wenzel}, |
|
1837 |
title = {{Isabelle/Isar} --- a generic framework for human-readable proof documents}, |
|
1838 |
booktitle = {From Insight to Proof --- Festschrift in Honour of Andrzej Trybulec}, |
|
1839 |
publisher = {University of Bia{\l}ystok}, |
|
1840 |
year = 2007, |
|
1841 |
editor = {R. Matuszewski and A. Zalewska}, |
|
1842 |
volume = {10(23)}, |
|
1843 |
series = {Studies in Logic, Grammar, and Rhetoric}, |
|
1844 |
note = {\url{http://www.in.tum.de/~wenzelm/papers/isar-framework.pdf}} |
|
1845 |
} |
|
1846 |
||
39829 | 1847 |
@InProceedings{Wenzel-Chaieb:2007b, |
1848 |
author = {Makarius Wenzel and Amine Chaieb}, |
|
1849 |
title = {{SML} with antiquotations embedded into {Isabelle/Isar}}, |
|
1850 |
booktitle = {Workshop on Programming Languages for Mechanized Mathematics |
|
1851 |
(satellite of CALCULEMUS 2007). Hagenberg, Austria}, |
|
1852 |
editor = {Jacques Carette and Freek Wiedijk}, |
|
1853 |
month = {June}, |
|
1854 |
year = {2007} |
|
1855 |
} |
|
1856 |
||
39867
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1857 |
@InProceedings{Wenzel:2009, |
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1858 |
author = {M. Wenzel}, |
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1859 |
title = {Parallel Proof Checking in {Isabelle/Isar}}, |
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1860 |
booktitle = {ACM SIGSAM Workshop on Programming Languages for Mechanized Mathematics Systems (PLMMS 2009)}, |
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1861 |
year = 2009, |
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1862 |
editor = {Dos Reis, G. and L. Th\'ery}, |
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1863 |
publisher = {ACM Digital Library}} |
a8363532cd4d
somewhat modernized version of "Thread-safe programming";
wenzelm
parents:
39852
diff
changeset
|
1864 |
|
53769 | 1865 |
@InProceedings{Wenzel:2010, |
1866 |
author = {Makarius Wenzel}, |
|
1867 |
title = {Asynchronous Proof Processing with {Isabelle/Scala} and {Isabelle/jEdit}}, |
|
1868 |
booktitle = {User Interfaces for Theorem Provers (UITP 2010), FLOC 2010 Satellite Workshop}, |
|
1869 |
year = 2010, |
|
1870 |
editor = {C. Sacerdoti Coen and D. Aspinall}, |
|
1871 |
series = {ENTCS}, |
|
1872 |
month = {July}, |
|
1873 |
publisher = {Elsevier}, |
|
1874 |
url = {http://www.lri.fr/~wenzel/papers/async-isabelle-scala.pdf}} |
|
1875 |
||
1876 |
@InProceedings{Wenzel:2011:CICM, |
|
1877 |
author = {M. Wenzel}, |
|
1878 |
title = {Isabelle as Document-oriented Proof Assistant}, |
|
1879 |
editor = {J. H. Davenport and W. M. Farmer and F. Rabe and J. Urban}, |
|
1880 |
booktitle = {Conference on Intelligent Computer Mathematics / Mathematical Knowledge Management (CICM/MKM 2011)}, |
|
1881 |
year = 2011, |
|
1882 |
volume = {6824}, |
|
1883 |
series = {LNAI}, |
|
1884 |
publisher = {Springer}} |
|
1885 |
||
51058 | 1886 |
@InProceedings{Wenzel:2012, |
1887 |
author = {Makarius Wenzel}, |
|
1888 |
title = {{Isabelle/jEdit} --- a {Prover IDE} within the {PIDE} framework}, |
|
1889 |
booktitle = {Conference on Intelligent Computer Mathematics (CICM 2012)}, |
|
1890 |
year = 2012, |
|
1891 |
editor = {J. Jeuring and others}, |
|
1892 |
volume = 7362, |
|
1893 |
series = {LNAI}, |
|
1894 |
publisher = {Springer}} |
|
1895 |
||
53769 | 1896 |
@InProceedings{Wenzel:2012:UITP-EPTCS, |
1897 |
author = {Makarius Wenzel}, |
|
1898 |
title = {{READ-EVAL-PRINT} in Parallel and Asynchronous Proof-checking}, |
|
1899 |
booktitle = {User Interfaces for Theorem Provers (UITP 2012)}, |
|
1900 |
year = 2013, |
|
1901 |
series = {EPTCS} |
|
1902 |
} |
|
1903 |
||
1904 |
@inproceedings{Wenzel:2013:ITP, |
|
1905 |
author = {Makarius Wenzel}, |
|
1906 |
title = {Shared-Memory Multiprocessing for Interactive Theorem Proving}, |
|
1907 |
booktitle = {Interactive Theorem Proving - 4th International Conference, |
|
1908 |
ITP 2013, Rennes, France, July 22-26, 2013. Proceedings}, |
|
1909 |
editor = {Sandrine Blazy and |
|
1910 |
Christine Paulin-Mohring and |
|
1911 |
David Pichardie}, |
|
1912 |
year = {2013}, |
|
1913 |
ee = {http://dx.doi.org/10.1007/978-3-642-39634-2_30}, |
|
1914 |
publisher = {Springer}, |
|
1915 |
series = {Lecture Notes in Computer Science}, |
|
1916 |
volume = {7998}, |
|
1917 |
} |
|
1918 |
||
6592 | 1919 |
@book{principia, |
1920 |
author = {A. N. Whitehead and B. Russell}, |
|
1921 |
title = {Principia Mathematica}, |
|
1922 |
year = 1962, |
|
54583 | 1923 |
publisher = CUP, |
6592 | 1924 |
note = {Paperback edition to *56, |
1925 |
abridged from the 2nd edition (1927)}} |
|
1926 |
||
9599 | 1927 |
@Misc{Wiedijk:1999:Mizar, |
1928 |
author = {Freek Wiedijk}, |
|
1929 |
title = {Mizar: An Impression}, |
|
1930 |
howpublished = {Unpublished paper}, |
|
1931 |
year = 1999, |
|
1932 |
note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}} |
|
1933 |
} |
|
1934 |
||
1935 |
@Misc{Wiedijk:2000:MV, |
|
1936 |
author = {Freek Wiedijk}, |
|
1937 |
title = {The Mathematical Vernacular}, |
|
1938 |
howpublished = {Unpublished paper}, |
|
1939 |
year = 2000, |
|
1940 |
note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}} |
|
1941 |
} |
|
1942 |
||
40073 | 1943 |
@misc{wikipedia-2009-aa-trees, |
1944 |
key = "Wikipedia", |
|
1945 |
title = "Wikipedia: {AA} Tree", |
|
1946 |
note = "\url{http://en.wikipedia.org/wiki/AA_tree}"} |
|
1947 |
||
6592 | 1948 |
@book{winskel93, |
1949 |
author = {Glynn Winskel}, |
|
1950 |
title = {The Formal Semantics of Programming Languages}, |
|
1951 |
publisher = MIT,year=1993} |
|
1952 |
||
1953 |
@InCollection{wos-bledsoe, |
|
1954 |
author = {Larry Wos}, |
|
1955 |
title = {Automated Reasoning and {Bledsoe's} Dream for the Field}, |
|
1956 |
crossref = {bledsoe-fest}, |
|
1957 |
pages = {297-342}} |
|
1958 |
||
7989 | 1959 |
@InProceedings{Zammit:1999:TPHOL, |
1960 |
author = {Vincent Zammit}, |
|
1961 |
title = {On the Implementation of an Extensible Declarative Proof Language}, |
|
1962 |
crossref = {tphols99}} |
|
1963 |
||
1964 |
%Z |
|
1965 |
||
40073 | 1966 |
@misc{z3, |
1967 |
key = "Z3", |
|
1968 |
title = "Z3: An Efficient {SMT} Solver", |
|
1969 |
note = "\url{http://research.microsoft.com/en-us/um/redmond/projects/z3/}"} |
|
1970 |
||
6592 | 1971 |
|
1972 |
% CROSS REFERENCES |
|
1973 |
||
1974 |
@book{handbk-lics2, |
|
1975 |
editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum}, |
|
1976 |
title = {Handbook of Logic in Computer Science}, |
|
1977 |
booktitle = {Handbook of Logic in Computer Science}, |
|
1978 |
publisher = {Oxford University Press}, |
|
1979 |
year = 1992, |
|
1980 |
volume = 2} |
|
1981 |
||
1982 |
@book{types93, |
|
1983 |
editor = {Henk Barendregt and Tobias Nipkow}, |
|
1984 |
title = TYPES # {: International Workshop {TYPES '93}}, |
|
1985 |
booktitle = TYPES # {: International Workshop {TYPES '93}}, |
|
1986 |
year = {published 1994}, |
|
1987 |
publisher = {Springer}, |
|
1988 |
series = {LNCS 806}} |
|
1989 |
||
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1990 |
@book{barwise-handbk, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1991 |
editor = {J. Barwise}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1992 |
title = {Handbook of Mathematical Logic}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1993 |
booktitle = {Handbook of Mathematical Logic}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1994 |
year = 1977, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1995 |
publisher = NH} |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1996 |
|
6592 | 1997 |
@Proceedings{tlca93, |
1998 |
title = {Typed Lambda Calculi and Applications}, |
|
1999 |
booktitle = {Typed Lambda Calculi and Applications}, |
|
2000 |
editor = {M. Bezem and J.F. Groote}, |
|
2001 |
year = 1993, |
|
2002 |
publisher = {Springer}, |
|
2003 |
series = {LNCS 664}} |
|
2004 |
||
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2005 |
@book{birtwistle89, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2006 |
editor = {Graham Birtwistle and P. A. Subrahmanyam}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2007 |
title = {Current Trends in Hardware Verification and Automated |
54583 | 2008 |
Theorem Proving}, |
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2009 |
booktitle = {Current Trends in Hardware Verification and Automated |
54583 | 2010 |
Theorem Proving}, |
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2011 |
publisher = {Springer}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2012 |
year = 1989} |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2013 |
|
6592 | 2014 |
@book{bledsoe-fest, |
2015 |
title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}}, |
|
2016 |
booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}}, |
|
2017 |
publisher = {Kluwer Academic Publishers}, |
|
2018 |
year = 1991, |
|
2019 |
editor = {Robert S. Boyer}} |
|
2020 |
||
2021 |
@Proceedings{cade12, |
|
2022 |
editor = {Alan Bundy}, |
|
54583 | 2023 |
title = {Automated Deduction --- {CADE}-12 |
6592 | 2024 |
International Conference}, |
54583 | 2025 |
booktitle = {Automated Deduction --- {CADE}-12 |
6592 | 2026 |
International Conference}, |
2027 |
year = 1994, |
|
2028 |
series = {LNAI 814}, |
|
2029 |
publisher = {Springer}} |
|
2030 |
||
2031 |
@book{types94, |
|
10186 | 2032 |
editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith}, |
6592 | 2033 |
title = TYPES # {: International Workshop {TYPES '94}}, |
2034 |
booktitle = TYPES # {: International Workshop {TYPES '94}}, |
|
2035 |
year = 1995, |
|
2036 |
publisher = {Springer}, |
|
2037 |
series = {LNCS 996}} |
|
2038 |
||
2039 |
@book{huet-plotkin91, |
|
10186 | 2040 |
editor = {{G{\'e}rard} Huet and Gordon Plotkin}, |
6592 | 2041 |
title = {Logical Frameworks}, |
2042 |
booktitle = {Logical Frameworks}, |
|
2043 |
publisher = CUP, |
|
2044 |
year = 1991} |
|
2045 |
||
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2046 |
@book{huet-plotkin93, |
10186 | 2047 |
editor = {{G{\'e}rard} Huet and Gordon Plotkin}, |
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2048 |
title = {Logical Environments}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2049 |
booktitle = {Logical Environments}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2050 |
publisher = CUP, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2051 |
year = 1993} |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2052 |
|
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2053 |
@Proceedings{hug93, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2054 |
editor = {J. Joyce and C. Seger}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2055 |
title = {Higher Order Logic Theorem Proving and Its |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2056 |
Applications: HUG '93}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2057 |
booktitle = {Higher Order Logic Theorem Proving and Its |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2058 |
Applications: HUG '93}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2059 |
year = {Published 1994}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2060 |
publisher = {Springer}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2061 |
series = {LNCS 780}} |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2062 |
|
6592 | 2063 |
@proceedings{colog88, |
10186 | 2064 |
editor = {P. Martin-L{\"o}f and G. Mints}, |
6592 | 2065 |
title = {COLOG-88: International Conference on Computer Logic}, |
2066 |
booktitle = {COLOG-88: International Conference on Computer Logic}, |
|
2067 |
year = {Published 1990}, |
|
2068 |
publisher = {Springer}, |
|
2069 |
organization = {Estonian Academy of Sciences}, |
|
2070 |
address = {Tallinn}, |
|
2071 |
series = {LNCS 417}} |
|
2072 |
||
2073 |
@book{odifreddi90, |
|
2074 |
editor = {P. Odifreddi}, |
|
2075 |
title = {Logic and Computer Science}, |
|
2076 |
booktitle = {Logic and Computer Science}, |
|
2077 |
publisher = {Academic Press}, |
|
2078 |
year = 1990} |
|
2079 |
||
2080 |
@proceedings{extensions91, |
|
2081 |
editor = {Peter Schroeder-Heister}, |
|
2082 |
title = {Extensions of Logic Programming}, |
|
2083 |
booktitle = {Extensions of Logic Programming}, |
|
2084 |
year = 1991, |
|
54583 | 2085 |
series = {LNAI 475}, |
6592 | 2086 |
publisher = {Springer}} |
2087 |
||
2088 |
@proceedings{cade10, |
|
2089 |
editor = {Mark E. Stickel}, |
|
2090 |
title = {10th } # CADE, |
|
2091 |
booktitle = {10th } # CADE, |
|
2092 |
year = 1990, |
|
2093 |
publisher = {Springer}, |
|
2094 |
series = {LNAI 449}} |
|
2095 |
||
2096 |
@Proceedings{lics8, |
|
2097 |
editor = {M. Vardi}, |
|
2098 |
title = {Eighth Annual Symposium on Logic in Computer Science}, |
|
2099 |
booktitle = {Eighth Annual Symposium on Logic in Computer Science}, |
|
2100 |
publisher = IEEE, |
|
2101 |
year = 1993} |
|
2102 |
||
2103 |
@book{wos-fest, |
|
54583 | 2104 |
title = {Automated Reasoning and its Applications: |
6592 | 2105 |
Essays in Honor of {Larry Wos}}, |
54583 | 2106 |
booktitle = {Automated Reasoning and its Applications: |
6592 | 2107 |
Essays in Honor of {Larry Wos}}, |
33191 | 2108 |
publisher = MIT, |
6592 | 2109 |
year = 1997, |
2110 |
editor = {Robert Veroff}} |
|
2111 |
||
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2112 |
@proceedings{fme93, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2113 |
editor = {J. C. P. Woodcock and P. G. Larsen}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2114 |
title = {FME '93: Industrial-Strength Formal Methods}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2115 |
booktitle = {FME '93: Industrial-Strength Formal Methods}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2116 |
year = 1993, |
13009 | 2117 |
publisher = Springer, |
2118 |
series = LNCS, |
|
2119 |
volume = 670} |
|
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
2120 |
|
6592 | 2121 |
@Proceedings{tphols96, |
2122 |
title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96}, |
|
2123 |
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96}, |
|
2124 |
editor = {J. von Wright and J. Grundy and J. Harrison}, |
|
13009 | 2125 |
publisher = Springer, |
2126 |
series = LNCS, |
|
2127 |
volume = 1125, |
|
6592 | 2128 |
year = 1996} |
6670 | 2129 |
|
7041 | 2130 |
@Proceedings{tphols97, |
2131 |
title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97}, |
|
2132 |
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97}, |
|
2133 |
editor = {Elsa L. Gunter and Amy Felty}, |
|
13009 | 2134 |
publisher = Springer, |
2135 |
series = LNCS, |
|
2136 |
volume = 1275, |
|
7041 | 2137 |
year = 1997} |
2138 |
||
2139 |
@Proceedings{tphols98, |
|
2140 |
title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98}, |
|
2141 |
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98}, |
|
2142 |
editor = {Jim Grundy and Malcom Newey}, |
|
13009 | 2143 |
publisher = Springer, |
2144 |
series = LNCS, |
|
2145 |
volume = 1479, |
|
7041 | 2146 |
year = 1998} |
2147 |
||
6670 | 2148 |
@Proceedings{tphols99, |
2149 |
title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99}, |
|
2150 |
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99}, |
|
7350 | 2151 |
editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and |
2152 |
Paulin, C. and Thery, L.}, |
|
13009 | 2153 |
publisher = Springer, |
2154 |
series = LNCS, |
|
2155 |
volume = 1690, |
|
6670 | 2156 |
year = 1999} |
2157 |
||
12878 | 2158 |
@Proceedings{tphols2000, |
2159 |
title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000}, |
|
2160 |
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000}, |
|
2161 |
editor = {J. Harrison and M. Aagaard}, |
|
13009 | 2162 |
publisher = Springer, |
2163 |
series = LNCS, |
|
2164 |
volume = 1869, |
|
12878 | 2165 |
year = 2000} |
2166 |
||
2167 |
@Proceedings{tphols2001, |
|
2168 |
title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001}, |
|
2169 |
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001}, |
|
2170 |
editor = {R. J. Boulton and P. B. Jackson}, |
|
13009 | 2171 |
publisher = Springer, |
2172 |
series = LNCS, |
|
2173 |
volume = 2152, |
|
12878 | 2174 |
year = 2001} |
22317 | 2175 |
|
23187 | 2176 |
@Proceedings{ijcar2006, |
2177 |
title = {Automated Reasoning: {IJCAR} 2006}, |
|
2178 |
booktitle = {Automated Reasoning: {IJCAR} 2006}, |
|
2179 |
editor = {U. Furbach and N. Shankar}, |
|
2180 |
publisher = Springer, |
|
2181 |
series = LNCS, |
|
2182 |
volume = 4130, |
|
2183 |
year = 2006} |
|
2184 |
||
25093 | 2185 |
@Proceedings{tphols2007, |
2186 |
title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007}, |
|
2187 |
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007}, |
|
2188 |
editor = {K. Schneider and J. Brandt}, |
|
2189 |
publisher = Springer, |
|
2190 |
series = LNCS, |
|
2191 |
volume = 4732, |
|
2192 |
year = 2007} |
|
2193 |
||
28593 | 2194 |
@Proceedings{tphols2008, |
2195 |
title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008}, |
|
2196 |
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008}, |
|
2197 |
publisher = Springer, |
|
2198 |
series = LNCS, |
|
2199 |
year = 2008} |
|
2200 |
% editor = |
|
2201 |
% volume = 4732, |
|
2202 |
||
36926 | 2203 |
@Proceedings{itp2010, |
2204 |
title = {Interactive Theorem Proving: {ITP}-10}, |
|
2205 |
booktitle = {Interactive Theorem Proving: {ITP}-10}, |
|
2206 |
editor = "Matt Kaufmann and Lawrence Paulson", |
|
2207 |
publisher = Springer, |
|
2208 |
series = LNCS, |
|
2209 |
year = 2010} |
|
2210 |
||
22317 | 2211 |
@unpublished{classes_modules, |
23956 | 2212 |
title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison}, |
22317 | 2213 |
author = {Stefan Wehr et. al.} |
2214 |
} |
|
56363
89e0264adf79
document value generation for quickcheck's testers
Andreas Lochbihler
parents:
55117
diff
changeset
|
2215 |
|
89e0264adf79
document value generation for quickcheck's testers
Andreas Lochbihler
parents:
55117
diff
changeset
|
2216 |
@inproceedings{runciman-naylor-lindblad, |
89e0264adf79
document value generation for quickcheck's testers
Andreas Lochbihler
parents:
55117
diff
changeset
|
2217 |
author = {Runciman, Colin and Naylor, Matthew and Lindblad, Fredrik}, |
89e0264adf79
document value generation for quickcheck's testers
Andreas Lochbihler
parents:
55117
diff
changeset
|
2218 |
title = {Smallcheck and {Lazy Smallcheck}: Automatic Exhaustive Testing for Small Values}, |
89e0264adf79
document value generation for quickcheck's testers
Andreas Lochbihler
parents:
55117
diff
changeset
|
2219 |
booktitle = {Proceedings of the First ACM SIGPLAN Symposium on Haskell (Haskell 2008)}, |
89e0264adf79
document value generation for quickcheck's testers
Andreas Lochbihler
parents:
55117
diff
changeset
|
2220 |
year = {2008}, |
89e0264adf79
document value generation for quickcheck's testers
Andreas Lochbihler
parents:
55117
diff
changeset
|
2221 |
pages = {37--48}, |
89e0264adf79
document value generation for quickcheck's testers
Andreas Lochbihler
parents:
55117
diff
changeset
|
2222 |
publisher = {ACM}, |
89e0264adf79
document value generation for quickcheck's testers
Andreas Lochbihler
parents:
55117
diff
changeset
|
2223 |
} |
89e0264adf79
document value generation for quickcheck's testers
Andreas Lochbihler
parents:
55117
diff
changeset
|
2224 |