47 publisher = {Addison-Wesley}, |
47 publisher = {Addison-Wesley}, |
48 year = 1990} |
48 year = 1990} |
49 |
49 |
50 @Unpublished{abrial93, |
50 @Unpublished{abrial93, |
51 author = {J. R. Abrial and G. Laffitte}, |
51 author = {J. R. Abrial and G. Laffitte}, |
52 title = {Towards the Mechanization of the Proofs of some Classical |
52 title = {Towards the Mechanization of the Proofs of Some Classical |
53 Theorems of Set Theory}, |
53 Theorems of Set Theory}, |
54 note = {preprint}, |
54 note = {preprint}, |
55 year = 1993, |
55 year = 1993, |
56 month = Feb} |
56 month = Feb} |
57 |
57 |
70 @InProceedings{alf, |
70 @InProceedings{alf, |
71 author = {Lena Magnusson and Bengt {Nordstr\"{o}m}}, |
71 author = {Lena Magnusson and Bengt {Nordstr\"{o}m}}, |
72 title = {The {ALF} Proof Editor and Its Proof Engine}, |
72 title = {The {ALF} Proof Editor and Its Proof Engine}, |
73 crossref = {types93}, |
73 crossref = {types93}, |
74 pages = {213-237}} |
74 pages = {213-237}} |
|
75 |
|
76 @inproceedings{andersson-1993, |
|
77 author = "Arne Andersson", |
|
78 title = "Balanced Search Trees Made Simple", |
|
79 editor = "F. K. H. A. Dehne and N. Santoro and S. Whitesides", |
|
80 booktitle = "WADS 1993", |
|
81 series = LNCS, |
|
82 volume = {709}, |
|
83 pages = "61--70", |
|
84 year = 1993, |
|
85 publisher = Springer} |
75 |
86 |
76 @book{andrews86, |
87 @book{andrews86, |
77 author = "Peter Andrews", |
88 author = "Peter Andrews", |
78 title = "An Introduction to Mathematical Logic and Type Theory: to Truth |
89 title = "An Introduction to Mathematical Logic and Type Theory: to Truth |
79 through Proof", |
90 through Proof", |
165 crossref = "tphols2000", |
176 crossref = "tphols2000", |
166 title = "Proof terms for simply typed higher order logic", |
177 title = "Proof terms for simply typed higher order logic", |
167 author = "Stefan Berghofer and Tobias Nipkow", |
178 author = "Stefan Berghofer and Tobias Nipkow", |
168 pages = "38--52"} |
179 pages = "38--52"} |
169 |
180 |
|
181 @inproceedings{berghofer-nipkow-2004, |
|
182 author = {Stefan Berghofer and Tobias Nipkow}, |
|
183 title = {Random Testing in {I}sabelle/{HOL}}, |
|
184 pages = {230--239}, |
|
185 editor = "J. Cuellar and Z. Liu", |
|
186 booktitle = {{SEFM} 2004}, |
|
187 publisher = IEEE, |
|
188 year = 2004} |
|
189 |
170 @InProceedings{Berghofer-Nipkow:2002, |
190 @InProceedings{Berghofer-Nipkow:2002, |
171 author = {Stefan Berghofer and Tobias Nipkow}, |
191 author = {Stefan Berghofer and Tobias Nipkow}, |
172 title = {Executing Higher Order Logic}, |
192 title = {Executing Higher Order Logic}, |
173 booktitle = {Types for Proofs and Programs: TYPES'2000}, |
193 booktitle = {Types for Proofs and Programs: TYPES'2000}, |
174 editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack}, |
194 editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack}, |
197 title="Introduction to Functional Programming",publisher=PH,year=1988} |
217 title="Introduction to Functional Programming",publisher=PH,year=1988} |
198 |
218 |
199 @book{Bird-Haskell,author="Richard Bird", |
219 @book{Bird-Haskell,author="Richard Bird", |
200 title="Introduction to Functional Programming using Haskell", |
220 title="Introduction to Functional Programming using Haskell", |
201 publisher=PH,year=1998} |
221 publisher=PH,year=1998} |
|
222 |
|
223 @inproceedings{blanchette-nipkow-2009, |
|
224 title = "Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder (Extended Abstract)", |
|
225 author = "Jasmin Christian Blanchette and Tobias Nipkow", |
|
226 booktitle = "{TAP} 2009: Short Papers", |
|
227 editor = "Catherine Dubois", |
|
228 publisher = "ETH Technical Report 630", |
|
229 year = 2009} |
202 |
230 |
203 @Article{boyer86, |
231 @Article{boyer86, |
204 author = {Robert Boyer and Ewing Lusk and William McCune and Ross |
232 author = {Robert Boyer and Ewing Lusk and William McCune and Ross |
205 Overbeek and Mark Stickel and Lawrence Wos}, |
233 Overbeek and Mark Stickel and Lawrence Wos}, |
206 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's} |
234 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's} |
239 crossref = {tphols2007}, |
267 crossref = {tphols2007}, |
240 pages = {38--53} |
268 pages = {38--53} |
241 } |
269 } |
242 |
270 |
243 @InProceedings{bulwahn-et-al:2008:imperative, |
271 @InProceedings{bulwahn-et-al:2008:imperative, |
244 author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews}, |
272 author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews}, |
245 title = {Imperative Functional Programming with {Isabelle/HOL}}, |
273 title = {Imperative Functional Programming with {Isabelle/HOL}}, |
246 crossref = {tphols2008}, |
274 crossref = {tphols2008}, |
247 } |
275 } |
248 % pages = {38--53} |
276 % pages = {38--53} |
249 |
277 |
594 number = 1, |
622 number = 1, |
595 pages = {0--255}, |
623 pages = {0--255}, |
596 month = {Jan}, |
624 month = {Jan}, |
597 year = 2003, |
625 year = 2003, |
598 note = {\url{http://www.haskell.org/definition/}}} |
626 note = {\url{http://www.haskell.org/definition/}}} |
|
627 |
|
628 @book{jackson-2006, |
|
629 author = "Daniel Jackson", |
|
630 title = "Software Abstractions: Logic, Language, and Analysis", |
|
631 publisher = MIT, |
|
632 year = 2006} |
599 |
633 |
600 %K |
634 %K |
601 |
635 |
602 @InProceedings{kammueller-locales, |
636 @InProceedings{kammueller-locales, |
603 author = {Florian Kamm{\"u}ller and Markus Wenzel and |
637 author = {Florian Kamm{\"u}ller and Markus Wenzel and |
876 year = 1993 |
910 year = 1993 |
877 } |
911 } |
878 |
912 |
879 @Book{isa-tutorial, |
913 @Book{isa-tutorial, |
880 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel}, |
914 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel}, |
881 title = {Isabelle/HOL: A Proof Assistant for Higher-Order Logic}, |
915 title = {Isabelle/{HOL}: A Proof Assistant for Higher-Order Logic}, |
882 publisher = {Springer}, |
916 publisher = Springer, |
883 year = 2002, |
917 year = 2002, |
884 note = {LNCS Tutorial 2283}} |
918 series = LNCS, |
|
919 volume = 2283} |
885 |
920 |
886 @Article{noel, |
921 @Article{noel, |
887 author = {Philippe No{\"e}l}, |
922 author = {Philippe No{\"e}l}, |
888 title = {Experimenting with {Isabelle} in {ZF} Set Theory}, |
923 title = {Experimenting with {Isabelle} in {ZF} Set Theory}, |
889 journal = JAR, |
924 journal = JAR, |
1019 @book{milner-fest, |
1054 @book{milner-fest, |
1020 title = {Proof, Language, and Interaction: |
1055 title = {Proof, Language, and Interaction: |
1021 Essays in Honor of {Robin Milner}}, |
1056 Essays in Honor of {Robin Milner}}, |
1022 booktitle = {Proof, Language, and Interaction: |
1057 booktitle = {Proof, Language, and Interaction: |
1023 Essays in Honor of {Robin Milner}}, |
1058 Essays in Honor of {Robin Milner}}, |
1024 publisher = {MIT Press}, |
1059 publisher = MIT, |
1025 year = 2000, |
1060 year = 2000, |
1026 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}} |
1061 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}} |
1027 |
1062 |
1028 @InCollection{paulson-handbook, |
1063 @InCollection{paulson-handbook, |
1029 author = {Lawrence C. Paulson}, |
1064 author = {Lawrence C. Paulson}, |
1234 year = 1984, |
1269 year = 1984, |
1235 volume = 49, |
1270 volume = 49, |
1236 number = 4 |
1271 number = 4 |
1237 } |
1272 } |
1238 |
1273 |
|
1274 @misc{sledgehammer-2009, |
|
1275 key = "Sledgehammer", |
|
1276 title = "The {S}ledgehammer: Let Automatic Theorem Provers |
|
1277 Write Your {I}s\-a\-belle Scripts", |
|
1278 note = "\url{http://www.cl.cam.ac.uk/research/hvg/Isabelle/sledgehammer.html}"} |
|
1279 |
1239 @inproceedings{slind-tfl, |
1280 @inproceedings{slind-tfl, |
1240 author = {Konrad Slind}, |
1281 author = {Konrad Slind}, |
1241 title = {Function Definition in Higher Order Logic}, |
1282 title = {Function Definition in Higher Order Logic}, |
1242 crossref = {tphols96}, |
1283 crossref = {tphols96}, |
1243 pages = {381-397}} |
1284 pages = {381-397}} |
1293 |
1334 |
1294 @book{Thompson-Haskell,author={Simon Thompson}, |
1335 @book{Thompson-Haskell,author={Simon Thompson}, |
1295 title={Haskell: The Craft of Functional Programming}, |
1336 title={Haskell: The Craft of Functional Programming}, |
1296 publisher={Addison-Wesley},year=1999} |
1337 publisher={Addison-Wesley},year=1999} |
1297 |
1338 |
|
1339 @misc{kodkod-2009, |
|
1340 author = "Emina Torlak", |
|
1341 title = {Kodkod: Constraint Solver for Relational Logic}, |
|
1342 note = "\url{http://alloy.mit.edu/kodkod/}"} |
|
1343 |
|
1344 @misc{kodkod-2009-options, |
|
1345 author = "Emina Torlak", |
|
1346 title = "Kodkod {API}: Class {Options}", |
|
1347 note = "\url{http://alloy.mit.edu/kodkod/docs/kodkod/engine/config/Options.html}"} |
|
1348 |
|
1349 @inproceedings{torlak-jackson-2007, |
|
1350 title = "Kodkod: A Relational Model Finder", |
|
1351 author = "Emina Torlak and Daniel Jackson", |
|
1352 editor = "Orna Grumberg and Michael Huth", |
|
1353 booktitle = "TACAS 2007", |
|
1354 series = LNCS, |
|
1355 volume = {4424}, |
|
1356 pages = "632--647", |
|
1357 year = 2007, |
|
1358 publisher = Springer} |
|
1359 |
1298 @Unpublished{Trybulec:1993:MizarFeatures, |
1360 @Unpublished{Trybulec:1993:MizarFeatures, |
1299 author = {A. Trybulec}, |
1361 author = {A. Trybulec}, |
1300 title = {Some Features of the {Mizar} Language}, |
1362 title = {Some Features of the {Mizar} Language}, |
1301 note = {Presented at a workshop in Turin, Italy}, |
1363 note = {Presented at a workshop in Turin, Italy}, |
1302 year = 1993 |
1364 year = 1993 |
1317 author = {P. Wadler and S. Blott}, |
1379 author = {P. Wadler and S. Blott}, |
1318 title = {How to make ad-hoc polymorphism less ad-hoc}, |
1380 title = {How to make ad-hoc polymorphism less ad-hoc}, |
1319 booktitle = {ACM Symp.\ Principles of Programming Languages}, |
1381 booktitle = {ACM Symp.\ Principles of Programming Languages}, |
1320 year = 1989 |
1382 year = 1989 |
1321 } |
1383 } |
|
1384 |
|
1385 @phdthesis{weber-2008, |
|
1386 author = "Tjark Weber", |
|
1387 title = "SAT-Based Finite Model Generation for Higher-Order Logic", |
|
1388 school = {Dept.\ of Informatics, T.U. M\"unchen}, |
|
1389 type = "{Ph.D.}\ thesis", |
|
1390 year = 2008} |
1322 |
1391 |
1323 @Misc{x-symbol, |
1392 @Misc{x-symbol, |
1324 author = {Christoph Wedler}, |
1393 author = {Christoph Wedler}, |
1325 title = {Emacs package ``{X-Symbol}''}, |
1394 title = {Emacs package ``{X-Symbol}''}, |
1326 note = {\url{http://x-symbol.sourceforge.net}} |
1395 note = {\url{http://x-symbol.sourceforge.net}} |
1568 @book{wos-fest, |
1637 @book{wos-fest, |
1569 title = {Automated Reasoning and its Applications: |
1638 title = {Automated Reasoning and its Applications: |
1570 Essays in Honor of {Larry Wos}}, |
1639 Essays in Honor of {Larry Wos}}, |
1571 booktitle = {Automated Reasoning and its Applications: |
1640 booktitle = {Automated Reasoning and its Applications: |
1572 Essays in Honor of {Larry Wos}}, |
1641 Essays in Honor of {Larry Wos}}, |
1573 publisher = {MIT Press}, |
1642 publisher = MIT, |
1574 year = 1997, |
1643 year = 1997, |
1575 editor = {Robert Veroff}} |
1644 editor = {Robert Veroff}} |
1576 |
1645 |
1577 @proceedings{fme93, |
1646 @proceedings{fme93, |
1578 editor = {J. C. P. Woodcock and P. G. Larsen}, |
1647 editor = {J. C. P. Woodcock and P. G. Larsen}, |
1667 |
1736 |
1668 @unpublished{classes_modules, |
1737 @unpublished{classes_modules, |
1669 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison}, |
1738 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison}, |
1670 author = {Stefan Wehr et. al.} |
1739 author = {Stefan Wehr et. al.} |
1671 } |
1740 } |
|
1741 |
|
1742 @misc{wikipedia-2009-aa-trees, |
|
1743 key = "Wikipedia", |
|
1744 title = "Wikipedia: {AA} Tree", |
|
1745 note = "\url{http://en.wikipedia.org/wiki/AA_tree}"} |