-
Notifications
You must be signed in to change notification settings - Fork 6
/
thesis.bib
3177 lines (2959 loc) · 122 KB
/
thesis.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
@inproceedings{randomaccesslists,
author = {Okasaki, Chris},
title = {Purely functional random-access lists},
booktitle = {FPCA '95: Proc. of the 7th Intl. Conf. on Functional Programming Languages and Computer Architecture, La Jolla, CA, Jun. 25--28, 1995},
year = {1995},
OPTisbn = {0-89791-719-7},
pages = {86--95},
location= {La Jolla, CA},
OPTdoi = {http://doi.acm.org/10.1145/224164.224187},
publisher = {ACM},
address = {New York},
}
@InProceedings{DBLP:conf/iclp/NearBF08,
title = "{\alphatap}: {A} Declarative Theorem Prover for
First-Order Classical Logic",
author = "Joseph P. Near and William E. Byrd and Daniel P.
Friedman",
bibdate = "2008-12-17",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/conf/iclp/iclp2008.html#NearBF08",
booktitle = "{ICLP} '08: Proc. of the 24th Intl. Conf. on Logic Programming, Udine, Italy, Dec. 9--13, 2008",
publisher = "Springer",
year = "2008",
volume = "5366",
editor = "Maria Garcia de la Banda and Enrico Pontelli",
ISBN = "978-3-540-89981-5",
pages = "238--252",
series = "LNCS",
OPTURL = "http://dx.doi.org/10.1007/978-3-540-89982-2",
}
@INPROCEEDINGS{Comon91disunification:a,
author = {Hubert Comon},
title = {Disunification: a Survey},
booktitle = {Computational Logic: Essays in Honor of Alan Robinson},
year = {1991},
pages = {322--359},
address = {Cambridge, MA},
publisher = {MIT Press}
}
@article{ComonEquational1989,
author = {Comon,, Hubert and Lescanne,, Pierre},
title = {Equational problems and disunification},
journal = {J. Symb. Comput.},
volume = {7},
number = {3-4},
year = {1989},
OPTissn = {0747-7171},
pages = {371--425},
OPTdoi = {http://dx.doi.org/10.1016/S0747-7171(89)80017-3},
publisher = {Academic Press},
address = {Duluth},
}
@inproceedings{Byrd:2006fk,
Author = {William E. Byrd and Daniel P. Friedman},
Booktitle = {Proc. of the 2006 Scheme and Functional Programming Workshop, Portland, Sep. 17, 2006},
Date-Added = {2006-09-24 00:39:43 -0400},
Date-Modified = {2006-09-29 09:53:41 -0400},
Editor = {Robby Findler},
Local-Url = {file://localhost/Users/williambyrd/iu/papers/12-byrd.pdf},
Pages = {105--117},
Series = {University of Chicago Technical Report TR-2006-06},
Title = {From Variadic Functions to Variadic Relations: A {miniKanren} Perspective},
Year = {2006}}
@inproceedings{CheneyU04,
Address = {Saint-Malo, France},
Author = {James Cheney and Christian Urban},
Bibdate = {2004-12-13},
Bibsource = {DBLP, http://dblp.uni-trier.de/db/conf/iclp/iclp2004.html#CheneyU04},
Booktitle = {{ICLP} '04: Proc. of the 20th Intl. Conf. on Logic Programming, Saint-Malo, France, Sep. 6--10, 2004},
Month = sep # {~6--10,},
Date-Added = {2007-01-11 11:09:27 -0500},
Date-Modified = {2007-02-05 22:55:32 -0500},
Editor = {Bart Demoen and Vladimir Lifschitz},
OPTIsbn = {3-540-22671-0},
Local-Url = {file://localhost/Users/williambyrd/iu/papers/cheney04alphaprolog.pdf},
Pages = {269--283},
Publisher = {Springer},
Series = {LNCS},
Title = {{$\alpha$}{Prolog}: {A} Logic Programming Language with Names, Binding and $\alpha$-Equivalence},
Volume = {3132},
Year = {2004}}
@PhdThesis{CheneyThesis,
author = {James Cheney},
title = {Nominal Logic Programming},
school = {Cornell University},
year = {2004},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
month = aug,
OPTnote = {},
OPTannote = {}
}
@article{Pitts03,
Address = {Orlando},
Author = {Andrew M. Pitts},
Cdate = {2004-12-23},
Date-Added = {2007-01-11 10:59:16 -0500},
Date-Modified = {2007-02-05 22:53:42 -0500},
Editor = {Albert R. Meyer},
Journal = {Inf.~Comput.},
Mdate = {2005-08-18},
Number = {2},
Pages = {165--193},
Publisher = {Academic Press},
Title = {Nominal logic, a first order theory of names and binding},
OPTUrl = {http://dx.doi.org/10.1016/S0890-5401(03)00138-X},
Volume = {186},
Year = {2003}}
@Book{stoy,
author = {Joseph E. Stoy},
ALTeditor = {},
title = {Denotational Semantics: The {S}cott-{S}trachey Approach to Programming Language Theory},
publisher = {MIT Press},
year = {1979},
OPTkey = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{Urban-Pitts-Gabbay/04,
Address = {Amsterdam},
Author = {Christian Urban and Andrew M. Pitts and Murdoch J. Gabbay},
Cdate = {2005-06-09},
Date-Added = {2007-01-11 10:52:59 -0500},
Date-Modified = {2007-01-11 10:53:41 -0500},
Editor = {G. Ausiello and D. Sannella},
Journal = {Theor.~Comput.~Sci.},
Keywords = {abstract syntax, alpha-conversion, binding operations, unification},
Local-Url = {file://localhost/Users/williambyrd/Desktop/urban03nominal.pdf},
Mdate = {2005-08-18},
Number = {1-3},
Pages = {473--497},
Publisher = {Elsevier},
Title = {Nominal unification},
OPTUrl = {http://dx.doi.org/10.1016/j.tcs.2004.06.016},
Volume = {323},
Year = {2004}
}
@article{implnomunif,
author = {Calv\`{e}s, Christophe and Fern\'{a}ndez, Maribel},
title = {Implementing Nominal Unification},
journal = {Electr. Notes Theor. Comput. Sci.},
volume = {176},
number = {1},
year = {2007},
OPTissn = {1571-0661},
pages = {25--37},
OPTdoi = {http://dx.doi.org/10.1016/j.entcs.2006.09.027},
publisher = {Elsevier},
address = {Amsterdam},
}
@article{DBLP:journals/tcs/CalvesF08,
author = {Christophe Calv{\`e}s and
Maribel Fern{\'a}ndez},
title = {A polynomial nominal unification algorithm},
journal = {Theor. Comput. Sci.},
volume = {403},
number = {2-3},
year = {2008},
pages = {285-306},
ee = {http://dx.doi.org/10.1016/j.tcs.2008.05.012},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@book{Steele:1990:CLL,
author = "Guy L. {Steele Jr.}",
title = "{COMMON LISP}: {T}he Language",
edition = "Second",
pages = "xxiii + 1029",
year = "1990",
publisher = {Digital Press},
}
@inproceedings{ShinwellPG03,
Author = {Mark R. Shinwell and Andrew M. Pitts and Murdoch Gabbay},
Bibdate = {2006-02-13},
Bibsource = {DBLP, http://dblp.uni-trier.de/db/conf/icfp/icfp2003.html#ShinwellPG03},
Booktitle = {{ICFP} '03: Proc. of the 8th {ACM} {SIGPLAN} Intl. Conf. on Functional Programming, Uppsala, Sweden, Aug. 25--29, 2003},
Date-Added = {2007-01-11 10:55:28 -0500},
Date-Modified = {2007-02-05 22:52:07 -0500},
Editor = {Colin Runciman and Olin Shivers},
OPTIsbn = {1-58113-756-7},
Local-Url = {file://localhost/Users/williambyrd/iu/papers/freshml.pdf},
Pages = {263--274},
Publisher = {ACM Press},
Title = {Fresh{ML}: programming with binders made simple},
OPTUrl = {http://doi.acm.org/10.1145/944705.944729},
Year = {2003}}
@Manual{pottier06,
title = {C$\alpha$ml Reference Manual},
OPTkey = {},
author = {Fran\c{c}ois Pottier},
organization = {INRIA},
OPTaddress = {},
edition = {{2006-12-14}},
month = dec,
year = {2006},
OPTnote = {},
OPTannote = {}
}
@inproceedings{hinze2000,
Address = {New York},
Author = {Ralf Hinze},
Booktitle = {{ICFP} '00: Proc. of the 5th {ACM} {SIGPLAN} Intl. Conf. on Functional Programming, Montr\'{e}al, Sep. 18--21, 2000},
Date-Added = {2006-06-09 12:11:11 -0400},
Date-Modified = {2006-08-09 16:01:11 -0400},
OPTMonth = sep # {~18--21,},
Pages = {186--197},
Publisher = {ACM Press},
OPTSeries = {ACM Sigplan Notices},
Title = {Deriving backtracking monad transformers},
OPTVolume = {35.9},
Year = {2000}}
@inproceedings{Wadler85,
Editor = {Jean-Pierre Jouannaud},
Address = {Nancy, France},
Author = {Philip Wadler},
Booktitle = {Proc. of the 2nd Conf. on Functional Programming Languages and Computer Architecture, Nancy, France, Sep. 1985},
Date-Added = {2006-06-09 12:03:06 -0400},
Date-Modified = {2006-08-08 21:12:16 -0400},
Month = sep # {~16--19,},
Pages = {113--128},
Publisher = {Springer},
Series = {LNCS},
Volume = {201},
Title = {How to Replace Failure by a List of Successes: {A} Method for Exception Handling, Backtracking, and Pattern Matching in Lazy Functional Languages},
Year = {1985}}
@inproceedings{Lazysml98,
Author = {David B. MacQueen and Philip Wadler and Walid Taha},
Booktitle = {Proc. of the 1998 {ACM} Workshop on ML,
Baltimore, Sep. 26, 1998},
Date-Added = {2006-06-09 17:48:34 -0400},
Date-Modified = {2006-06-09 17:48:41 -0400},
Month = sep,
Note = {Baltimore, MD},
Pages = {24--30},
Title = {How to add laziness to a strict language without even being odd},
Year = {1998}}
@article{moggi91notions,
author = {Moggi,, Eugenio},
title = {Notions of computation and monads},
journal = {Inf.~Comput.},
volume = {93},
number = {1},
year = {1991},
OPTissn = {0890-5401},
pages = {55--92},
OPTdoi = {http://dx.doi.org/10.1016/0890-5401(91)90052-4},
publisher = {Academic Press},
address = {Duluth},
}
@inproceedings{Wadler92,
Address = {Albuquerque},
Author = {Philip Wadler},
Booktitle = {POPL '92: Conf. Record of the 19th Annual {ACM} {SIGPLAN}-{SIGACT} Symp. on Principles of Programming Languages, Albuquerque, Jan. 1992},
Date-Added = {2006-06-09 12:10:22 -0400},
Date-Modified = {2007-01-12 14:31:18 -0500},
Local-Url = {file://localhost/Users/williambyrd/iu/papers/wadler92essence.pdf},
Month = jan # {,},
Pages = {1--14},
Publisher = {ACM Press},
Title = {The Essence of Functional Programming},
Year = {1992}}
@inproceedings{oai:CiteSeerPSU:392916,
Author = {Erik Hilsdale and Daniel P. Friedman},
Booktitle = {Scheme and Functional Programming 2000,
Montr\'{e}al, Sep. 17, 2000},
Date-Added = {2006-09-29 10:01:15 -0400},
Date-Modified = {2006-09-29 10:02:20 -0400},
Language = {en},
Local-Url = {file://localhost/Users/williambyrd/iu/papers/hilsdale.pdf},
Month = sep # {~5,},
Oai = {oai:CiteSeerPSU:392916},
Rights = {unrestricted},
Title = {Writing Macros in Continuation-Passing Style},
OPTUrl = {http://citeseer.ist.psu.edu/392916.html; http://www.cs.rice.edu/~matthias/Scheme2000/hilsdale.ps},
Year = 2000}
@Book{barendregt84,
author = {Henk Barendregt},
ALTeditor = {},
title = {The Lambda Calculus, its Syntax and Semantics},
publisher = {North-Holland},
year = {1984},
OPTkey = {},
OPTvolume = {},
number = {103},
series = {Studies in Logic and the Foundations of Mathematics},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@Misc{r6rs,
author = {Michael Sperber and R. Kent Dybvig and Matthew Flatt and \mbox{van Straaten, A.} (eds.)},
title = {Revised${}^6$ Report on the Algorithmic Language {Scheme}},
month = sep,
year = 2007,
url = "http://www.r6rs.org/"
}
@inproceedings{pfenning1988hoa,
title={{Higher-order abstract syntax}},
author={Pfenning, F. and Elliot, C.},
booktitle={PLDI '88: Proc. of the {ACM} {SIGPLAN} 1988 Conf. on Programming Language Design and Implementation, Atlanta, Jun. 22--24, 1988},
OPTvolume={23},
OPTnumber={7},
pages={199--208},
year={1988},
publisher={ACM},
address={New York},
location={Montreal}
}
@book{fitting1996fol,
title={{First-Order Logic and Automated Theorem Proving}},
author={Fitting, M.},
year={1996},
publisher={Springer}
}
@article{paulson99generic,
author = "Paulson, L. C.",
title = "A Generic Tableau Prover and its Integration with {Isabelle}",
journal = "J. of Univ. Comp. Sci.",
volume = "5",
number = "3",
pages = "73--87",
year = "1999",
OPTurl = "citeseer.ist.psu.edu/paulson98generic.html"
}
@article{pelletier1986sfp,
title={{Seventy-five problems for testing automatic theorem provers}},
author={Pelletier, F. J.},
journal={J. Auto. Reason.},
volume={2},
number={2},
pages={191--216},
year={1986},
publisher={Springer}
}
@techreport{lisitsalambdald,
title={{$\lambda${leanTAP}: lean deduction in $\lambda${P}rolog}},
author={Lisitsa, A.},
year={2003},
institution={ULCS-03-017, University of Liverpool, Department of Computer Science}
}
@article{beckert95leantap,
author = "Bernhard Beckert and Joachim Posegga",
title = "{leanTAP}: Lean Tableau-based Deduction",
journal = "J. Auto. Reason.",
volume = "15",
number = "3",
pages = "339--358",
year = "1995",
OPTurl = "citeseer.ist.psu.edu/beckert95leantap.html"
}
@article{cheneyurban08,
author = {Cheney,, James and Urban,, Christian},
title = {Nominal logic programming},
journal = {ACM Trans. Program. Lang. and Syst.},
volume = {30},
number = {5},
year = {2008},
OPTissn = {0164-0925},
pages = {1--47},
OPTdoi = {http://doi.acm.org/10.1145/1387673.1387675},
publisher = {ACM},
address = {New York},
}
@InProceedings{pitts01nominal,
author = "Andrew M. Pitts",
editor = "N. Kobayashi and B. C. Pierce",
title = "Nominal Logic: A First Order Theory of Names and Binding",
booktitle = "TACS '01: Proc. of the 4th Intl. Symp. on Theoretical Aspects of Computer Software, Sendai, Japan, Oct. 29--31, 2001",
series = "{LNCS}",
volume = "2215",
pages = "219--242",
year = "2001",
publisher = "Springer",
address = "London",
}
@article{jaffar94constraint,
author = "Joxan Jaffar and Michael J. Maher",
title = "Constraint Logic Programming: A Survey",
journal = "J. Log. Program.",
volume = "19/20",
pages = "503--581",
year = "1994",
OPTurl = "citeseer.ist.psu.edu/article/jaffar94constraint.html" }
@misc{beckert-leantsupsuppfaq,
author = "Bernhard Beckert and Joachim Posegga",
title = "The {leanTAP}-{FAQ}: Frequently Asked Questions about {\leantap}",
howpublished = "\url{http://www.uni-koblenz.de/~beckert/pub/LeanTAP_FAQ.pdf}" }
@inproceedings{alphamk,
author = {William E. Byrd and Daniel P. Friedman},
editor = {Danny Dub\'{e}},
pages = "79--90 (\textit{see also} \mbox{\url{http://www.cs.indiana.edu/~webyrd}} \textit{for improvements})",
booktitle = {Proc. of the 2007 Workshop on Scheme and Functional Programming, Freiburg, Germany, Sep. 30, 2007},
title = "{\alphakanren}: A Fresh Name in Nominal Logic Programming",
series = {Universit\'{e} Laval Technical Report DIUL-RT-0701},
year = {2007}
}
@inproceedings{stickel1988ptt,
title={{A {P}rolog technology theorem prover}},
author={Stickel, M.E.},
booktitle={CADE '88: Proc. of the 9th Intl. Conf. on Automated Deduction, Argonne, IL, May 23--26, 1988},
pages={752--753},
year={1988},
location= {Argonne, IL},
editor = {Ewing Lusk and Ross Overbeek},
publisher={Springer}
}
@inproceedings{manthey1988stp,
title={{{SATCHMO}: A theorem prover implemented in {P}rolog}},
author={Manthey, R. and Bry, F.},
booktitle={CADE '88: Proc. of the 9th Intl. Conf. on Automated Deduction, Argonne, IL, May 23--26, 1988},
pages={415--434},
year={1988},
address= {Argonne, IL},
editor = {Ewing Lusk and Ross Overbeek},
publisher={Springer}
}
@inproceedings{felty1988stp,
title={{Specifying theorem provers in a higher-order logic programming language}},
author={Felty, A. and Miller, D.},
booktitle={CADE '88: Proc. of the 9th Intl. Conf. on Automated Deduction, Argonne, IL, May 23--26, 1988},
pages={61--80},
year={1988},
location= {Argonne, IL},
editor = {Ewing Lusk and Ross Overbeek},
publisher={Springer}
}
@InProceedings{pfenning1999sdt,
title={{System description: {Twelf}---a meta-logical framework for deductive systems}},
author={Pfenning, F. and Schurmann, C.},
booktitle={CADE '99: Proc. of the 16th Intl. Conf. on Automated Deduction, Trento, Italy, Jul. 7--10, 1999},
pages={202--206},
year={1999},
editor = {Ganzinger, Harald},
address= {Trento, Italy},
publisher={Springer}
}
@article{stucliffe1994tpl,
title={{The {TPTP} Problem Library}},
author={Sutcliffe, G. and Suttner, C.},
journal={J. Auto. Reason.},
volume={21},
number={2},
pages={135--277},
year={1998},
publisher={Lib}
}
@article{christiansen1998arc,
title={{Automated reasoning with a constraint-based metainterpreter}},
author={Christiansen, H.},
journal={J. Log. Program.},
volume={37},
number={1-3},
pages={213--254},
year={1998},
address = {Amsterdam},
publisher={Elsevier}
}
@book{kowalski79,
author = {Robert A. Kowalski},
title = {Logic for Problem Solving},
year = {1979},
OPTisbn = {0444003657},
publisher = {Prentice Hall PTR},
address = {Upper Saddle River, NJ},
}
@book{mellish1981agm,
title={{The Automatic Generation of Mode Declarations for {P}rolog Programs.}},
author={Mellish, C. S.},
year={1981},
publisher={Dept. of Artificial Intelligence, University of Edinburgh}
}
@techreport{Asanovic:EECS-2006-183,
Author = {Asanovic, Krste and Bodik, Ras and Catanzaro, Bryan Christopher and Gebis, Joseph James and Husbands, Parry and Keutzer, Kurt and Patterson, David A. and Plishker, William Lester and Shalf, John and Williams, Samuel Webb and Yelick, Katherine A.},
Title = {The Landscape of Parallel Computing Research: A View from {B}erkeley},
Institution = {EECS Department, University of California, Berkeley},
Year = {2006},
Month = dec,
URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-183.html},
Number = {UCB/EECS-2006-183}
}
@InCollection{FBaade01,
title = "Unification Theory",
author = "Franz Baader and Wayne Snyder",
bibdate = "2002-01-03",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/books/collections/RobinsonV01.html#BaaderS01",
booktitle = "Handbook of Automated Reasoning",
publisher = "Elsevier and MIT Press",
address = {Amsterdam and Cambridge, MA},
year = "2001",
editor = "John Alan Robinson and Andrei Voronkov",
OPTISBN = "0-444-50813-9; 0-262-18223-8",
pages = "445--532",
}
@book{lloyd:lp,
Address = {New York},
Author = {John Wylie Lloyd},
Date-Added = {2006-03-08 22:17:45 -0500},
Date-Modified = {2006-03-08 22:17:45 -0500},
Edition = {Second Extended},
Publisher = {Springer},
Title = {Foundations of Logic Programming},
Year = {1987}
}
@Misc{Spivey-algebras,
author = "Michael Spivey",
title = "Algebras for combinatorial search",
howpublished = "Oxford University Computing Laboratory",
month = jul,
year = "2006",
url = "http://spivey.oriel.ox.ac.uk/mike/msfp.pdf"
}
@inproceedings{backtracking,
Author = {Oleg Kiselyov and Chung-chieh Shan and D. P. Friedman and A. Sabry},
Bibdate = {2006-02-13},
Bibsource = {DBLP, http://dblp.uni-trier.de/db/conf/icfp/icfp2005.html#KiselyovSFS05},
Booktitle = {{ICFP} '05: Proc. of the 10th {ACM} {SIGPLAN} Intl. Conf. on Functional Programming, Tallinn, Estonia, Sep. 26--28, 2005},
editor = {Olivier Danvy and Benjamin C. Pierce},
location = "{T}allinn, {E}stonia",
month = sep,
Date-Added = {2006-08-09 14:56:36 -0400},
Date-Modified = {2006-08-09 15:07:38 -0400},
OPTisbn = {1-59593-064-7},
Pages = {192--203},
Title = {Backtracking, interleaving, and terminating monad transformers},
OPTUrl = {http://doi.acm.org/10.1145/1086365.1086390},
Year = {2005}
}
@Article{PLOTKIN76,
author = "Gordon D. Plotkin",
title = "A Powerdomain Construction",
journal = "SIAM J. on Comp.",
volume = "5",
number = "3",
month = sep,
year = "1976",
pages = "452--487",
checked = "5 July 1990",
}
@InProceedings{ICALP::FriedmanW1976,
title = "{CONS} Should Not Evaluate its Arguments",
author = "D. P. Friedman and D. S. Wise",
pages = "257--284",
booktitle = "Third Intl. Colloq. on Automata, Languages
and Programming, University of Edinburgh, Jul. 20--23, 1976",
editor = "S. Michaelson and R. Milner",
address = "University of Edinburgh",
month = "20--23~" # jul,
year = "1976",
publisher = "Edinburgh University Press",
}
@InProceedings{ferns81,
author = "Daniel P. Friedman and David S. Wise",
title = "Fancy ferns require little care",
pages = "124--156",
booktitle = "Symp. on Functional Languages and Computer Architecture, G{\"{o}}teborg, Sweden, 1981",
month = jun,
editor = "S{\"{o}}ren Holmstr{\"{o}}m and Bengt Nordstr{\"{o}}m and {\AA}ke Wikstr{\"{o}}m",
publisher = "Laboratory for Programming Methodology, University of G{\"{o}}teborg and Chalmers University of Technology",
address = "G{\"{o}}teborg, Sweden",
year = "1981",
}
@InProceedings{Friedman79b,
author = "Daniel P. Friedman and David S. Wise",
editor = "Gilles Kahn",
title = "An Approach to Fair Applicative Multiprogramming",
booktitle = "Proc. of the Intl. Symp. on Semantics of Concurrent Computation, Evian, France, Jul. 2--4, 1979",
series = "{LNCS}",
volume = "70",
pages = "203--225",
publisher = "Springer",
location = "Evian, France",
month = jul,
year = "1979",
keywords = "RBBRS702/RBBRS1066, Rdf,",
}
@InProceedings{DFried80,
author = "Daniel P. Friedman and David S. Wise",
title = "An indeterminate constructor for applicative
programming",
pages = "245--250",
booktitle = "{POPL} '80: Conf. Record of the 7th Annual {ACM} Symp. on Principles of Programming Languages, Las Vegas, Jan. 1980",
OPTISBN = "0-89791-011-7",
month = jan,
location = "Las Vegas",
publisher = "ACM Press",
address = "New York",
year = "1980",
}
@Comment \bibitem{DFried80}
@Comment D. P. Friedman, D. S. Wise, An indeterminate constructor for applicative
@Comment programming, in: Conf. Record at 7th Annual ACM Symp. on
@Comment Principles of Programming Languages, Las Vegas, 1980.
@Article{RDybvi89,
title = "Engines From Continuations",
author = "R. Kent Dybvig and Robert Hieb",
journal = "Comput. Lang",
year = "1989",
number = "2",
volume = "14",
bibdate = "2003-11-27",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/journals/cl/cl14.html#DybvigH89",
pages = "109--123",
}
@Comment \bibitem{RDybvi89}
@Comment R. K. Dybvig, R. Hieb, Engines from continuations, in: Computer Languages, 14, 2, 1989, 109--123.
@article{hieb94subcontinuations,
author = "Robert Hieb and Kent Dybvig and Claude W. {Anderson, {III}}",
title = "Subcontinuations",
journal = "Lisp and Symb. Comp.",
volume = "7",
number = "1",
pages = "83--110",
year = "1994"
}
@Article{CHayne87,
author = "Christopher T. Haynes and Daniel P. Friedman",
title = "Abstracting Timed Preemption with Engines",
journal = "J. Comp. Lang.",
volume = "12",
number = "2",
pages = "109--121",
publisher = "Pergamon Press",
year = "1987",
keywords = "engines",
}
@Comment \bibitem{CHayne87}
@Comment C. T. Haynes, D. P. Friedman, Abstracting timed preemption with engines,
@Comment in: Journal of Computer Languages 12, 2, 1987, 109--121.
@InProceedings{JMcCar63,
author = "John McCarthy",
title = "A Basis for a Mathematical Theory of Computation",
booktitle = "Computer Programming and Formal Systems",
publisher = "North Holland",
editor = "P. Braffort and D. Hirschberg",
pages = "33--69",
year = "1963",
}
@Comment \bibitem{JMcCar63}
@Comment J. McCarthy, A basis for a mathematical theory of computation, in:
@Comment Computer Programming and Formal Systems, North-Holland, Amsterdam, 1963, 33--70.
@Article{Kelsey-Clinger-Rees98,
author = "Richard Kelsey and William Clinger and Jonathan Rees
(Editors)",
title = "Revised$^{5}$ Report on the Algorithmic Language
{Scheme}",
journal = "ACM SIGPLAN Notices",
year = "1998",
volume = "33",
number = "9",
month = sep,
pages = "26--76",
OPTURL = "ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/standards/r5rs-html.tar.gz",
annote = "31 references.",
}
@book{trs,
author = {Daniel P. Friedman and William E. Byrd and Oleg Kiselyov},
title = {The Reasoned Schemer},
year = {2005},
OPTisbn = {0262562146},
publisher = {MIT Press},
address = {Cambridge, MA}
}
@misc{kanrensite,
author = "Daniel P. Friedman and Oleg Kiselyov",
title = "A Declarative Applicative Logic Programming System",
howpublished = "\mbox{\url{http://kanren.sourceforge.net}}",
year = 2005
}
@INCOLLECTION{CombinatorsforLP,
author = {J. Michael Spivey and Silvija Seres},
title = {Combinators for logic programming},
crossref = {fop},
pages = {177--200},
}
@InProceedings{numbers-Curry,
author = "Bernd Bra{\ss}el and Sebastian Fischer and Frank Huch",
title = "Declaring Numbers",
pages = "23--36",
year = "2007",
editor = "Rachid Echahed",
booktitle = {WFLP '07: Proc. of 16th Intl. Workshop on Functional and (Constraint) Logic Programming, Paris, June 25, 2007},
OPTurl = "http://www-ps.informatik.uni-kiel.de/~sebf/data/pub/wflp07.pdf"
}
% url = {\url{http://www-ps.informatik.uni-kiel.de/~sebf/data/pub/wflp07.pdf}},
% editor = "Rachid Echahed",
@InProceedings{lightweight-resources,
author = "Oleg Kiselyov and Chung-chieh Shan",
title = "Lightweight Static Resources:
Sexy Types for Embedded and Systems Programming",
crossref = "tfp2007-draft",
OPTurl = "http://okmij.org/ftp/Computation/resource-aware-prog/"
}
% url = {\url{http://okmij.org/ftp/Computation/resource-aware-prog/}},
@InCollection{lakin2007,
author = {M. R. Lakin and A. M. Pitts},
title = {A Metalanguage for Structural Operational Semantics},
crossref = "TFP2007",
pages = {19--35},
}
@proceedings{TFP2007,
editor = {Marco T. Moraz\'an},
title = {TFP '07: Proc. of the 8th Symp. on Trends
in Functional Programming, New York City, 2--4
Apr. 2007},
booktitle = {Trends in Functional Programming},
publisher = {Intellect/The University of Chicago Press},
OPTseries = {Trends in Functional Programming},
volume = {8},
year = {2008},
OPTisbn = {978-1-84150-196-3}
}
@Proceedings{tfp2007-draft,
editor = {Marco T. Moraz\'an},
title = "Draft Proc. of {TFP} 2007:
6th Symp. on Trends in Functional Programming",
booktitle = "Draft Proc. of the 8th Symp. on Trends
in Functional Programming, , New York City, 2--4
Apr. 2007",
publisher = "Seton Hall University",
year = 2007,
note = "TR-SHU-CS-2007-04-1",
url = "http://cs.shu.edu/tfp2007/draftProcDocument.pdf",
location = "New York"
}
% publisher = "Department of Mathematics and Computer Science,
% Seton Hall University",
@misc{hallgren01fun,
author = "Thomas Hallgren",
title = "Fun with functional dependencies",
text = "T. Hallgren. Fun with functional dependencies. In Joint Winter Meeting
of the Departments of Science and Computer Engineering, Chalmers University
of Technology and Goteborg University, Varberg, Sweden, Jan. 2001. //www.cs.chalmers.se/~hallgren/Papers/wm01.html.",
howpublished = {\url{http://www.cs.chalmers.se/~hallgren/Papers/wm01.html}},
year = "2001",
OPTurl = "citeseer.ist.psu.edu/hallgren00fun.html"
}
@InProceedings{Antoy-defn-tree,
author = "Sergio Antoy",
title = "Definitional Trees",
booktitle = "Algebraic and Logic Programming",
year = "1992",
pages = "143--157",
volume = "632",
series = "{LNCS}",
}
@Book{ hennessy-computer,
author = {Hennessy, John L. and Patterson, David A.},
title = {Computer Architecture: A Quantitative Approach},
publisher = "Morgan Kaufmann",
year = 2002,
edition = "Third"
}
@inproceedings{ColussiMM95,
author = {Livio Colussi and
Elena Marchiori and
Massimo Marchiori},
title = {On Termination of Constraint Logic Programs},
pages = {431-448},
booktitle = {Principles and Practice of Constraint Programming},
series = {LNCS},
volume = {976},
year = {1995},
OPTisbn = {3-540-60299-2},
}
@InProceedings{Kowalski74a,
author = "Robert Kowalski",
editor = "J. L. Rosenfeld",
title = "Predicate Logic as Programming Language",
booktitle = "Information Processing",
pages = "569--574",
publisher = "North-Holland",
year = "1974",
}
@article{Eiter:1997:DD,
author = "Thomas Eiter and Georg Gottlob and Heikki Mannila",
title = "Disjunctive {Datalog}",
journal = "ACM Trans. Database Syst.",
volume = "22",
number = "3",
pages = "364--418",
month = sep,
year = "1997",
}
@Book{hilbertstenth,
author = {Yuri V. Matiyasevich},
title = {Hilbert's Tenth Problem},
address = {Cambridge, MA},
publisher = {MIT Press},
year = {1993}
}
@article{npt,
author= {Oleg Kiselyov},
title= {Number-parameterized types},
journal= "The {M}onad.{R}eader",
volume = "5",
year= 2005,
url = "http://www.haskell.org/tmrwiki/NumberParamTypes"
}
% url = "\{http://www.haskell.org/tmrwiki/NumberParamTypes}",
@book{apt03principles,
author = {Krzysztof R. Apt},
title = {Principles of Constraint Programming},
publisher = {Cambridge University Press},
year = {2003}
}
@INPROCEEDINGS{Boulton92tassel.experience,
Author = {Richard Boulton and Andrew Gordon and Mike Gordon and John Harrison and John Herbert and John Van Tassel},
title = {Experience with Embedding Hardware Description Languages in {HOL}},
booktitle = {Theorem Provers in Circuit Design: Proc. of the IFIP TC10/WG 10.2 Intl. Conf., Nijmegen, The Netherlands, Jun. 22--24, 1992},
year = {1992},
location="Nijmegen, The Netherlands",
pages = {129--156},
publisher = {North-Holland}
}
@INPROCEEDINGS{FriedmanWise78,
Author = {Daniel P. Friedman and David S. Wise},
title = {Sting-unless: a conditional, interlock-free store instruction},
publisher = {University of Illinois, Urbana-Champaign},
booktitle = {16th Annual Allerton Conf. on Communication, Control, and Computing, University of Illinois (Urbana-Champaign)},
editors = {M. B. Pursley and Jr. J. B. Cruz},
year = {1978},
pages = {578--584}
}
%%
%% Parallel Implementation of DSI
%%
@phdthesis{Jeschke-PHD-95,
author = {Eric R. Jeschke},
title = {An Architecture for Parallel Symbolic Processing Based on Suspending Construction},
school = {Indiana University Computer Science Department},
year = 1995,
month = may,
note = {Technical Report No. 445, 152 pages.},
OPTurl = {http://www.cs.indiana.edu/Research/techreports/}
}
@book{Filman-Friedman-84,
author = {Robert E. Filman and Daniel P. Friedman},
title = {Coordinated Computing: Tools and Techniques for Distributed Software},
publisher = {McGraw-Hill},
year = {1984},
abstract = {The book is a comparative survey of descriptive constructs
for concurrency.
Chapter 5 presents an approach to applicative system description, and
develops several examples, including one taken from [J83]. Much of
the material presented in Chapter 5 reflects research surrounding
the suspended-construction model of Friedman and Wise.}
}
%%
%% In Friedman&Fillman
%%
@article{Johnson-83,
author = {Steven D. Johnson},
title = {Circuits and systems: Implementing communication with streams},
journal = {IMACS Trans. on Sci. Comp., Vol. II},
editor = {M. Ruschitzka},
year = {1983},
pages = {311--319},
abstract = {The article relates the executable specification of software
systems to the
modeling of circuit behavior. The example, a system of two communicating
terminals, illustrates a use of {\tt frons} to specify asynchronous
communication. This example is reproduced in Chapter 5 of {\it Coordinated
Computing} by Friedman and Filman.}
}
@inproceedings{occurcheck,
author = {Apt,, Krzysztof R. and Pellegrini,, Alessandro},
title = {Why the Occur-Check is Not a Problem},
booktitle = {PLILP '92: Proc. of the 4th Intl. Symp. on Programming Language Implementation and Logic Programming, Leuven, Belgium, Aug. 26--28, 1992},
year = {1992},
OPTisbn = {3-540-55844-6},
pages = {69--86},
publisher = {Springer},
address = {London},
editor = {Maurice Bruynooghe and Martin Wirsing},
}
@mastersthesis{Johnson-77,
author = {Steven D. Johnson},
title = {An Interpretive Model for a Language Based on Suspended Construction},
school = {Indiana University Computer Science Department},
year = {1977},
note = {Indiana University Computer Science Department Technical Report No. 68},
OPTurl = {http://www.cs.indiana.edu/Research/techreports/},
abstract = {The first implementation of a Daisy-like interpreter.
This language, called ``The Interpreter,'' supported major
semantic constructs, including functional combination and
{\tt frons}. However, it did not permit data recursion. Storage
management was by incremental reference counting, an a number
of internal algorithms (e.g., multiset promotion) exploited
the reference count, implementing in-place effects when the count
was one.}
}
@misc{schelog,
Author = {Dorai Sitaram},
Date-Added = {2006-08-03 14:51:51 -0400},
Date-Modified = {2006-08-05 11:42:34 -0400},
Howpublished = {\newline \noindent \url{http://www.ccs.neu.edu/home/dorai/schelog/schelog.html}},
OPTLastchecked = {Aug 3, 2006},
year = {1993},
Title = {Programming in {S}chelog},
OPTUrldate = {Jun 1, 2003}
}