16 %institutions |
16 %institutions |
17 @string{CUCL="Comp. Lab., Univ. Camb."} |
17 @string{CUCL="Comp. Lab., Univ. Camb."} |
18 @string{Edinburgh="Dept. Comp. Sci., Univ. Edinburgh"} |
18 @string{Edinburgh="Dept. Comp. Sci., Univ. Edinburgh"} |
19 |
19 |
20 %journals |
20 %journals |
|
21 @string{AI="Artificial Intelligence"} |
21 @string{FAC="Formal Aspects Comput."} |
22 @string{FAC="Formal Aspects Comput."} |
22 @string{JAR="J. Auto. Reas."} |
23 @string{JAR="J. Auto. Reas."} |
23 @string{JCS="J. Comput. Secur."} |
24 @string{JCS="J. Comput. Secur."} |
24 @string{JFP="J. Func. Prog."} |
25 @string{JFP="J. Func. Prog."} |
25 @string{JLC="J. Logic and Comput."} |
26 @string{JLC="J. Logic and Comput."} |
388 author = {Florian Kamm{\"u}ller and Markus Wenzel and |
389 author = {Florian Kamm{\"u}ller and Markus Wenzel and |
389 Lawrence C. Paulson}, |
390 Lawrence C. Paulson}, |
390 title = {Locales: A Sectioning Concept for {Isabelle}}, |
391 title = {Locales: A Sectioning Concept for {Isabelle}}, |
391 crossref = {tphols99}} |
392 crossref = {tphols99}} |
392 |
393 |
393 @book{Knuth3-75,author={Donald E. Knuth}, |
394 @book{Knuth3-75, |
394 title={The Art of Computer Programming, Volume 3: Sorting and Searching}, |
395 author={Donald E. Knuth}, |
395 publisher={Addison-Wesley},year=1975} |
396 title={The Art of Computer Programming, Volume 3: Sorting and Searching}, |
|
397 publisher={Addison-Wesley}, |
|
398 year=1975} |
|
399 |
|
400 @Article{korf85, |
|
401 author = {R. E. Korf}, |
|
402 title = {Depth-First Iterative-Deepening: an Optimal Admissible |
|
403 Tree Search}, |
|
404 journal = AI, |
|
405 year = 1985, |
|
406 volume = 27, |
|
407 pages = {97-109}} |
396 |
408 |
397 @Book{kunen80, |
409 @Book{kunen80, |
398 author = {Kenneth Kunen}, |
410 author = {Kenneth Kunen}, |
399 title = {Set Theory: An Introduction to Independence Proofs}, |
411 title = {Set Theory: An Introduction to Independence Proofs}, |
400 publisher = NH, |
412 publisher = NH, |