links

2 files changed, 19 insertions, 8 deletions

diff --git a/journal/16feb2009.html b/journal/16feb2009.html
index d91f61e..78933ac 100644
--- a/journal/16feb2009.html
+++ b/journal/16feb2009.html
@@ -84,10 +84,6 @@ Baire dimension theory, embedding, and the fundamental group. I never really
 covered these topics when I studies topology before, so I wasn't able to gleam
 any insight. 
 
-<pre style="margin:20px; border-left: solid grey 3px; background-color:lightgrey
-;padding:5px;width:750px;">
-</pre>
-
 <br /><br /> 
 <a href="05feb2009.html"><i>(previous entry)</i></a> - 
 <a href="19feb2009.html"><i>(next entry)</i></a>
diff --git a/journal/19feb2009.html b/journal/19feb2009.html
index 4d4dd9f..54183f6 100644
--- a/journal/19feb2009.html
+++ b/journal/19feb2009.html
@@ -23,11 +23,26 @@ for tensor manipulation and field theories (in C++ with TeX based input/output).
 standard lisp. Includes a FORTRAN and C generation engine called gentran
 (<a href="http://reduce-algebra.com/docs/gentran.pdf">pdf</a>, <a href="http://portal.acm.org/citation.cfm?id=1089415">acm paper</a>).
 <br /><br />
+The proper word for the type heirarchy is 'ontology'. See also footnote 
+<a href="http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-18.html#footnote_Temp_289">52</a> in section 2.5 of SICP.
 
-
-<pre style="margin:20px; border-left: solid grey 3px; background-color:lightgrey
-;padding:5px;width:750px;">
-</pre>
+<hr />
+Here's a reading list of scheme stuff... not really related to this project, but
+still looks fun! Grafted from <a href="http://readscheme.org">readscheme.org</a>
+<ul>
+ <li /><a href="# Jonathon Sobel and Daniel P. Friedman. "Recycling Continuations". 1998 International Conference on Functional Programming (ICFP'98). September 1998. ">http://www.cs.indiana.edu/hyplan/jsobel/Recycling/recycling.pdf</a>
+ <li />Robert Strandh. "OOOZ, A multi-User Programming Environment Based on Scheme". BIGRE Bulletin. 65. July 1989
+ <li /><a href="http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-1325.pdf">Michael A. Eisenberg. "Programmable Applications: Interpreter Meets Interface". MIT AI Lab. AIM-1325. October 1991</a>
+ <li /><a href="http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AITR-925.pdf">Guillermo J. Rozas. "A Computational Model for Observation in Quantum Mechanics". Masters Thesis. Massachusetts Institute of Technology. AITR-925. March 1987.</a>
+ <li /><a href="http://repository.readscheme.org/ftp/papers/sw2005/chongkai.pdf">Chongkai Zhu. "The Marriage of MrMathematica and MzScheme". 2005 Workshop on Scheme and Functional Programming. September 2005.</a>
+ <li /><a href="http://repository.readscheme.org/ftp/papers/sw2003/Dot-Scheme.pdf">Pedro Pinto. "Dot-Scheme: A PLT Scheme FFI for the .NET framework". Scheme Workshop 2003. November 2003. </a>
+ <li /><a href="http://repository.readscheme.org/ftp/papers/sw2003/Scmxlate.pdf">Dorai Sitaram. "Porting Scheme Programs". Scheme Workshop 2003. November 2003.</a>
+ <li /><a href="http://portal.acm.org/citation.cfm?id=802786&coll=portal&dl=ACM">Mitchell Wand. "Continuation-Based Multiprocessing". Conference Record of the 1980 Lisp Conference. 1980. </a>
+ <li /><a href="http://portal.acm.org/citation.cfm?id=99178&coll=Portal">R. Kent Dybvig and Robert Hieb. "Continuations and Concurrency". Proceedings of the Second ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. March 1990.</a>
+ <li /><a href="http://repository.readscheme.org/ftp/papers/PLoP2001_dferguson0_1.pdf">Darrell Ferguson and Dwight Deugo. "Call with Current Continuation Patterns". 8th Conference on Pattern Languages of Programs. September 2001.</a>
+ <li /><a href="http://repository.readscheme.org/ftp/papers/sw2000/feeley.pdf">Marc Feeley. "A portable implementation of first-class continuations for unrestricted interoperability with C in a multithreaded Scheme". Scheme and Functional Programming 2000.</a>
+ <li ><a href="ftp://publications.ai.mit.edu/ai-publications/pdf/AITR-474.pdf">RABBIT: A compiler for scheme</a>
+</ul>
 
 <br /><br /> 
 <a href="16feb2009.html"><i>(previous entry)</i></a>