[Gzz-commits] manuscripts/FutureVision vision.rst

[Tuomas J. Lukka]

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Branch:         
Changes by:     Tuomas J. Lukka <address@hidden>        03/09/14 11:57:01

Modified files:
        FutureVision   : vision.rst 

Log message:
        Arch sync

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/manuscripts/FutureVision/vision.rst.diff?tr1=1.6&tr2=1.7&r1=text&r2=text

Patches:
Index: manuscripts/FutureVision/vision.rst
diff -u manuscripts/FutureVision/vision.rst:1.6 
manuscripts/FutureVision/vision.rst:1.7
--- manuscripts/FutureVision/vision.rst:1.6     Sun Sep 14 08:15:34 2003
+++ manuscripts/FutureVision/vision.rst Sun Sep 14 11:57:01 2003
@@ -12,17 +12,6 @@
 
 In this article, we present the Hyperstructure paradigm ...
 
-The fundamental ideas in what we call hyperstructure are due to Ted Nelson.
-The authors were exposed to these ideas in connection with the Gzz (earlier 
called GZigZag)
-project, whose goal was to implement Ted Nelson's ZigZag(tm) (trademark of Ted 
Nelson) structure
-in collaboration with him.
-In spring 2003, due to various issues including patents, 
-our research group began the Fenfire project, which was essentially all
-the technologies (user interface, storage, functional programming -related)
-developed in connection with Gzz but using RDF instead of the ZigZag(tm)
-as the underlying structure. Most importantly, the ideas and goals related
-to hyperstructure were retained, as well as the use of the basic Xanalogical 
permanent media paradigm.
-
 A Catalogue of Hypermedia Structures 
 ====================================
 As argued by DeRose [derose89ExpandingTheNotionOfLinks]_, 
@@ -36,11 +25,6 @@
 
 - Often used in today's web culture
 
-Xanalogical
------------
-
-.
-
 Arbitrary graph
 ---------------
 
@@ -50,6 +34,15 @@
 
 - bidirectionally *accessible* or not
 
+
+Frame-based
+-----------
+
+Xanalogical
+-----------
+
+.
+
 Taxonomic (set inclusions)
 --------------------------
 
@@ -73,7 +66,7 @@
 Peter J. Nürnberg, John J. Leggett, Erich R. Schneider
 
 Open Hypermedia
-===============
+---------------
 
 Focus: interoperability, existing apps.
 
@@ -99,6 +92,10 @@
 
 The ZigZag(tm) structure is ...
 
+While the ZigZag(tm) structure is simple to browse locally,
+programming is more difficult since representing one-to-many
+and many-to-many relations is, while possible, laborious.
+
 RDF
 ---
 
@@ -106,22 +103,14 @@
 
 Semantic web
 
-RDF and ZigZag(tm) structure are actually closely
-related: ZigZag(tm) is obtained if a RDF graph is constrained
-by two uniqueness conditions: for all x, y, there can be
-at most one triple of the form (x, y, *),  and 
-at most one triple of the form (*, x, y).
-
-While the ZigZag(tm) structure is simpler to browse locally,
-programming is more difficult since representing one-to-many
-and many-to-many relations is, while possible, laborious.
 
-
-Xanalogical permanent media
----------------------------
+Xanalogical permanent media structure
+-------------------------------------
 
 Can be integrated into nearly any system
 
+NOT THE FULL XANADU(tm) FUNCTIONALITY
+
 Delivers significant benefits...
 
 Fenfire
@@ -145,5 +134,34 @@
 
 Conclusion
 ==========
+
+
+Notes
+=====
+
+(XXX Link to text)
+
+The fundamental ideas in what we call hyperstructure are due to Ted Nelson.
+The authors were exposed to these ideas in connection with the Gzz (earlier 
called GZigZag)
+project, whose goal was to implement Ted Nelson's ZigZag(tm) (trademark of Ted 
Nelson) structure
+in collaboration with him.
+In spring 2003, due to various issues including patents, 
+our research group began the Fenfire project, which was essentially all
+the technologies (user interface, storage, functional programming -related)
+developed in connection with Gzz but using RDF instead of the ZigZag(tm)
+as the underlying structure. Most importantly, the ideas and goals related
+to hyperstructure were retained, as well as the use of the basic Xanalogical 
permanent media paradigm.
+
+
+
+
+RDF and ZigZag(tm) structure are actually closely
+related: ZigZag(tm) is obtained if a RDF graph is constrained
+by two uniqueness conditions: for all x, y, there can be
+at most one triple of the form (x, y, *),  and 
+at most one triple of the form (*, x, y).
+
+
+