Skip to content

Commit db0fb5b

Browse files
masintermasinter
committed
deploy: fe70f7b 
1 parent ded0a72 commit db0fb5b

File tree

2 files changed

+105
-33
lines changed

2 files changed

+105
-33
lines changed

‎data/bibliography.json

+102-30
Original file line numberDiff line numberDiff line change
@@ -40,7 +40,7 @@
4040
]
4141
},
4242
"key": "WJ7DBZTL",
43-
"version": 6836,
43+
"version": 6845,
4444
"itemType": "conferencePaper",
4545
"creators": [
4646
{
@@ -74,14 +74,17 @@
7474
},
7575
{
7676
"tag": "Reviewed by SHFT - UofA (Eleanor Young)"
77+
},
78+
{
79+
"tag": "early programming"
7780
}
7881
],
7982
"collections": [
8083
"MV55NAER"
8184
],
8285
"relations": {},
8386
"dateAdded": "2021-06-02T19:14:08Z",
84-
"dateModified": "2024-07-30T02:46:06Z"
87+
"dateModified": "2024-07-30T03:35:45Z"
8588
}
8689
],
8790
"1960": [
@@ -105,7 +108,7 @@
105108
]
106109
},
107110
"key": "Y8FT8NIV",
108-
"version": 6841,
111+
"version": 6842,
109112
"itemType": "document",
110113
"creators": [
111114
{
@@ -130,6 +133,9 @@
130133
{
131134
"tag": "PDP-1 LISP"
132135
},
136+
{
137+
"tag": "Reviewed by SHFT - UofA (Eleanor Young)"
138+
},
133139
{
134140
"tag": "documentation"
135141
},
@@ -142,7 +148,7 @@
142148
],
143149
"relations": {},
144150
"dateAdded": "2021-05-31T19:41:44Z",
145-
"dateModified": "2024-07-30T02:50:32Z"
151+
"dateModified": "2024-07-30T03:16:31Z"
146152
},
147153
{
148154
"target": "UFJLXXCL",
@@ -181,7 +187,7 @@
181187
]
182188
},
183189
"key": "UFJLXXCL",
184-
"version": 1704,
190+
"version": 6844,
185191
"itemType": "journalArticle",
186192
"creators": [
187193
{
@@ -207,6 +213,12 @@
207213
"rights": "",
208214
"extra": "",
209215
"tags": [
216+
{
217+
"tag": "LISP"
218+
},
219+
{
220+
"tag": "early programming"
221+
},
210222
{
211223
"tag": "sz"
212224
}
@@ -216,7 +228,7 @@
216228
],
217229
"relations": {},
218230
"dateAdded": "2021-04-25T21:00:55Z",
219-
"dateModified": "2021-06-02T18:12:52Z"
231+
"dateModified": "2024-07-30T03:35:40Z"
220232
}
221233
],
222234
"1963": [
@@ -257,7 +269,7 @@
257269
]
258270
},
259271
"key": "EIATQTVR",
260-
"version": 1978,
272+
"version": 6854,
261273
"itemType": "journalArticle",
262274
"creators": [
263275
{
@@ -283,6 +295,15 @@
283295
"rights": "",
284296
"extra": "",
285297
"tags": [
298+
{
299+
"tag": "Heuristics"
300+
},
301+
{
302+
"tag": "LISP"
303+
},
304+
{
305+
"tag": "Reviewed by SHFT - UofA (Eleanor Young)"
306+
},
286307
{
287308
"tag": "sz"
288309
}
@@ -292,7 +313,7 @@
292313
],
293314
"relations": {},
294315
"dateAdded": "2021-04-25T21:00:55Z",
295-
"dateModified": "2021-05-29T19:59:29Z"
316+
"dateModified": "2024-07-30T04:19:26Z"
296317
}
297318
],
298319
"1965": [
@@ -687,11 +708,11 @@
687708
"target": "36TCME67",
688709
"id": "9296070/36TCME67",
689710
"type": "report",
690-
"title": "Storage management in LISP",
711+
"title": "Storage Management in LISP",
691712
"publisher": "BOLT BERANEK AND NEWMAN INC",
692713
"publisher-place": "Cambridge, MA",
693714
"event-place": "Cambridge, MA",
694-
"abstract": "Storage allocation, maintenance, and reclamation are handled automatically in LISP systems. Storage is allocated as needed, and a garbage collection process periodically reclaims storage no longer in use. A number of different garbage collection algorithms are described. A common property of most of these algorithms is that during garbage collection all other computation ceases. This is an untenable situation for programs which must respond to real time interrupts. The paper concludes with a proposal for an incremental garbage collection scheme which allows simultaneous computation and storage reclamation. Author",
715+
"abstract": "Storage allocation, maintenance, and reclamation are handled automatically in LISP systems. Storage is allocated as needed, and a garbage collection process periodically reclaims storage no longer in use. A number of different garbage collection algorithms are described. A common property of most of these algorithms is that during garbage collection all other computation ceases. This is an untenable situation for programs which must respond to real time interrupts. The paper concludes with a proposal for an incremental garbage collection scheme which allows simultaneous computation and storage reclamation.",
695716
"note": "Section: Technical Reports",
696717
"language": "en",
697718
"author": [
@@ -719,7 +740,7 @@
719740
]
720741
},
721742
"key": "36TCME67",
722-
"version": 2153,
743+
"version": 6865,
723744
"itemType": "report",
724745
"creators": [
725746
{
@@ -745,6 +766,18 @@
745766
"rights": "",
746767
"extra": "Section: Technical Reports",
747768
"tags": [
769+
{
770+
"tag": "LISP"
771+
},
772+
{
773+
"tag": "Reviewed by SHFT - UofA (Eleanor Young)"
774+
},
775+
{
776+
"tag": "garbage collection"
777+
},
778+
{
779+
"tag": "memory management"
780+
},
748781
{
749782
"tag": "sz"
750783
}
@@ -754,7 +787,7 @@
754787
],
755788
"relations": {},
756789
"dateAdded": "2021-06-02T17:49:56Z",
757-
"dateModified": "2021-07-26T02:23:33Z"
790+
"dateModified": "2024-07-30T04:32:27Z"
758791
},
759792
{
760793
"target": "6RAE6DBF",
@@ -1843,7 +1876,7 @@
18431876
]
18441877
},
18451878
"key": "I2U8XT9Z",
1846-
"version": 1781,
1879+
"version": 6885,
18471880
"itemType": "journalArticle",
18481881
"creators": [
18491882
{
@@ -1870,16 +1903,28 @@
18701903
"rights": "",
18711904
"extra": "",
18721905
"tags": [
1906+
{
1907+
"tag": "Reviewed by SHFT - UofA (Abhik Hasnain)"
1908+
},
1909+
{
1910+
"tag": "news bulletin"
1911+
},
1912+
{
1913+
"tag": "programming"
1914+
},
18731915
{
18741916
"tag": "sz"
1917+
},
1918+
{
1919+
"tag": "technical overview"
18751920
}
18761921
],
18771922
"collections": [
18781923
"TVX6WEZX"
18791924
],
18801925
"relations": {},
18811926
"dateAdded": "2021-04-25T19:54:39Z",
1882-
"dateModified": "2021-06-02T19:23:50Z"
1927+
"dateModified": "2024-07-31T02:59:24Z"
18831928
},
18841929
{
18851930
"target": "9SDF3BWD",
@@ -2956,7 +3001,7 @@
29563001
"target": "QQ4WARPF",
29573002
"id": "9296070/QQ4WARPF",
29583003
"type": "article-journal",
2959-
"title": "INTERLISP documentation",
3004+
"title": "INTERLISP Documentation Bulletin",
29603005
"container-title": "ACM SIGART Bulletin",
29613006
"page": "5-22",
29623007
"issue": "44",
@@ -2988,7 +3033,7 @@
29883033
]
29893034
},
29903035
"key": "QQ4WARPF",
2991-
"version": 3117,
3036+
"version": 6880,
29923037
"itemType": "journalArticle",
29933038
"creators": [
29943039
{
@@ -3017,7 +3062,13 @@
30173062
"extra": "",
30183063
"tags": [
30193064
{
3020-
"tag": "interlisp"
3065+
"tag": "Interlisp"
3066+
},
3067+
{
3068+
"tag": "Reviewed by SHFT - UofA (Abhik Hasnain)"
3069+
},
3070+
{
3071+
"tag": "news bulletin"
30213072
},
30223073
{
30233074
"tag": "s2z"
@@ -3034,7 +3085,7 @@
30343085
]
30353086
},
30363087
"dateAdded": "2021-04-15T23:18:51Z",
3037-
"dateModified": "2023-10-04T05:40:28Z"
3088+
"dateModified": "2024-07-31T02:53:40Z"
30383089
},
30393090
{
30403091
"target": "HP2N2EKF",
@@ -3705,7 +3756,7 @@
37053756
]
37063757
},
37073758
"key": "B2PF228B",
3708-
"version": 1856,
3759+
"version": 6873,
37093760
"itemType": "report",
37103761
"creators": [
37113762
{
@@ -3736,6 +3787,18 @@
37363787
"rights": "",
37373788
"extra": "",
37383789
"tags": [
3790+
{
3791+
"tag": "Interlisp"
3792+
},
3793+
{
3794+
"tag": "Reviewed by SHFT - UofA (Abhik Hasnain)"
3795+
},
3796+
{
3797+
"tag": "computational efficiency"
3798+
},
3799+
{
3800+
"tag": "performance"
3801+
},
37393802
{
37403803
"tag": "sz"
37413804
}
@@ -3745,7 +3808,7 @@
37453808
],
37463809
"relations": {},
37473810
"dateAdded": "2021-04-25T19:54:39Z",
3748-
"dateModified": "2021-06-03T18:46:42Z"
3811+
"dateModified": "2024-07-31T02:50:32Z"
37493812
},
37503813
{
37513814
"target": "ZNK9J6YF",
@@ -6082,9 +6145,8 @@
60826145
{
60836146
"target": "398X5WQZ",
60846147
"id": "9296070/398X5WQZ",
6085-
"type": "webpage",
6148+
"type": "personal_communication",
60866149
"title": "new-lisp-messages.txt.1.",
6087-
"container-title": "Software Preservation Group",
60886150
"author": [
60896151
{
60906152
"family": "Teitelman",
@@ -6112,8 +6174,8 @@
61126174
]
61136175
},
61146176
"key": "398X5WQZ",
6115-
"version": 5580,
6116-
"itemType": "webpage",
6177+
"version": 6889,
6178+
"itemType": "instantMessage",
61176179
"creators": [
61186180
{
61196181
"creatorType": "author",
@@ -6126,13 +6188,11 @@
61266188
"lastName": "Kaplan"
61276189
}
61286190
],
6129-
"websiteTitle": "Software Preservation Group",
6130-
"websiteType": "",
61316191
"date": "1979",
6192+
"language": "",
61326193
"shortTitle": "",
61336194
"url": "http://www.softwarepreservation.org/projects/LISP/interlisp/tenex/sumex-aim/new-lisp-messages.txt.1/view",
61346195
"accessDate": "2021-04-23T17:51:42Z",
6135-
"language": "",
61366196
"rights": "",
61376197
"extra": "",
61386198
"tags": [
@@ -6150,7 +6210,7 @@
61506210
]
61516211
},
61526212
"dateAdded": "2021-04-25T18:13:25Z",
6153-
"dateModified": "2024-01-24T20:50:28Z"
6213+
"dateModified": "2024-07-31T03:01:47Z"
61546214
}
61556215
],
61566216
"1980": [
@@ -35525,7 +35585,7 @@
3552535585
]
3552635586
},
3552735587
"key": "JELN3BBL",
35528-
"version": 1395,
35588+
"version": 6881,
3552935589
"itemType": "encyclopediaArticle",
3553035590
"creators": [
3553135591
{
@@ -35554,6 +35614,18 @@
3555435614
"rights": "",
3555535615
"extra": "",
3555635616
"tags": [
35617+
{
35618+
"tag": "Interlisp"
35619+
},
35620+
{
35621+
"tag": "Reviewed by SHFT - UofA (Abhik Hasnain)"
35622+
},
35623+
{
35624+
"tag": "history"
35625+
},
35626+
{
35627+
"tag": "introductory"
35628+
},
3555735629
{
3555835630
"tag": "sz"
3555935631
}
@@ -35563,7 +35635,7 @@
3556335635
],
3556435636
"relations": {},
3556535637
"dateAdded": "2021-04-22T03:48:38Z",
35566-
"dateModified": "2021-05-29T20:57:33Z"
35638+
"dateModified": "2024-07-31T02:53:51Z"
3556735639
},
3556835640
{
3556935641
"target": "QBBTXQSF",

‎history/bibliography/index.html

+3-3
Original file line numberDiff line numberDiff line change
@@ -545,7 +545,7 @@ <h2 id="interlisp-bibliography">Interlisp Bibliography</h2>
545545

546546
<tr>
547547

548-
<td><div class="bibTitle"><a href="https://apps.dtic.mil/sti/citations/AD0636049">Storage management in LISP</a></div>
548+
<td><div class="bibTitle"><a href="https://apps.dtic.mil/sti/citations/AD0636049">Storage Management in LISP</a></div>
549549
<div class="authors">
550550
Bobrow, Daniel G.
551551
</div>
@@ -556,7 +556,7 @@ <h2 id="interlisp-bibliography">Interlisp Bibliography</h2>
556556

557557

558558

559-
Storage allocation, maintenance, and reclamation are handled automatically in LISP systems. Storage is allocated as needed, and a garbage collection process periodically reclaims storage no longer in use. A number of different garbage collection algorithms are described. A common property of most of these algorithms is that during garbage collection all other computation ceases. This is an untenable situation for programs which must respond to real time interrupts. The paper concludes with a proposal for an incremental garbage collection scheme which allows simultaneous computation and storage reclamation. Author
559+
Storage allocation, maintenance, and reclamation are handled automatically in LISP systems. Storage is allocated as needed, and a garbage collection process periodically reclaims storage no longer in use. A number of different garbage collection algorithms are described. A common property of most of these algorithms is that during garbage collection all other computation ceases. This is an untenable situation for programs which must respond to real time interrupts. The paper concludes with a proposal for an incremental garbage collection scheme which allows simultaneous computation and storage reclamation.
560560

561561

562562
</div></td>
@@ -1117,7 +1117,7 @@ <h2 id="interlisp-bibliography">Interlisp Bibliography</h2>
11171117

11181118
<tr>
11191119

1120-
<td><div class="bibTitle"><a href="https://doi.org/10.1145/1045183.1045186">INTERLISP documentation</a></div>
1120+
<td><div class="bibTitle"><a href="https://doi.org/10.1145/1045183.1045186">INTERLISP Documentation Bulletin</a></div>
11211121
<div class="authors">
11221122
Teitelman, Warren
11231123
</div>

0 commit comments

Comments
 (0)