Commits

Cat's Eye Technologies  committed c4e6eb8

Import of Ypsilax version 1.0 revision 2010.0430 sources.

  • Participants
  • Parent commits bdadbc8
  • Tags rel_1_0_2010_0430

Comments (0)

Files changed (2)

File doc/ypsilax.html

-<html><head>
-    <meta http-equiv="Content-Type" content="text/html;CHARSET=iso-8859-1">
-    <meta name="Description" content="Cat's Eye Technologies: The Ypsilax Language">
-    <title>Cat's Eye Technologies: The Ypsilax Language</title>
-<meta name="Keywords" content=" Cat's Eye Technologies Language
- Programming computational computation non-deterministic
- constraint-based rewriting grid grid-rewriting gridrewriting
- minimal minimalist minimalistic tarpit tar pit pure language
- nondeterminstic experimental ">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en">
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
+<title>The Ypsilax Grid-Rewriting Language</title>
 </head>
 <body>
 
 <h1>Ypsilax</h1>
 
-<p>Language version 0.9.  Distribution version 2007.1202.<br>
-Copyright &copy;2001-2007, Cat's Eye Technologies.  All rights reserved.</p>
+<p>Language version 1.0, distribution revision 2010.0429.<br/>
+Copyright &copy;2001-2010, Cat's Eye Technologies.  All rights reserved.</p>
 
-<hr>
-<p>
-<ul><i>"In other words then, if a machine is expected to be infallible, it
+<hr/>
+
+<blockquote><p><i>"In other words then, if a machine is expected to be infallible, it
 cannot also be intelligent. There are several mathematical theorems which say almost
 exactly that. But these theorems say nothing about how much intelligence may be
-displayed if a machine makes no pretense at infallibility."</i>
-<ul>--- Grush and Churchland, <i>Gaps in Penrose's Toilings</i></ul></ul>
-<ul><i>"You know, I'm starting to think the humour of that misquote at the top
-of the Ypsilax documentation is a bit</i> too <i>subtle."</i>
-<ul>--- Chris Pressey, <i>Ypsilax</i> documentation</ul></ul>
+displayed if a machine makes no pretense at infallibility."</i></p>
+<p style="text-align: right">&mdash; Grush and Churchland, <i>Gaps in Penrose's Toilings</i></p></blockquote>
+<blockquote><p><i>"You know, I'm starting to think the humour of that misquote at the top
+of the Ypsilax documentation is a bit</i> too <i>subtle."</i></p>
+<p style="text-align: right">&mdash; Chris Pressey, <i>Ypsilax</i> documentation</p></blockquote>
 
 <h3>Ypsilax</h3>
 
 two cells wide by one cell high, says that it is OK to replace any A found
 below this rule with a B.</p>
 
-<p>Ypsilax is totally non-determinstic, like <a href="/projects/thue-+">Thue</a>.
-Each reduction consists of picking a rule by an unspecified method -
-for all you know, it is selected completely at random - and attempting to apply
+<p>Ypsilax is totally non-determinstic, like <a href="/projects/thue/">Thue</a>.
+Each reduction consists of picking a rule by an unspecified method &mdash;
+for all you know, it is selected completely at random &mdash; and attempting to apply
 it to some part of the playfield below the rule, again chosen by means unknown.
 When this suceeds, that part of the playfield is rewritten.</p>
 

File script/ypsilax.pl

 #!/usr/bin/perl
 
 # ypsilax.pl - non-deterministic reflective grid-rewriting language
-# v2007.1202 Chris Pressey, Cat's Eye Technologies
+# v1.0-2010.0429 Chris Pressey, Cat's Eye Technologies
 
-# Copyright (c)2001-2007, Cat's Eye Technologies.
+# Copyright (c)2001-2010, Cat's Eye Technologies.
 # All rights reserved.
 # 
 # Redistribution and use in source and binary forms, with or without