summary refs log tree commit diff stats
diff options
context:
space:
mode:
authorAndrew Yu <andrew@andrewyu.org>2022-07-26 01:07:43 +0800
committerAndrew Yu <andrew@andrewyu.org>2022-07-26 01:09:27 +0800
commit7e237d0f683ea17f275ca11a31285ab2bb64a471 (patch)
treecbe7b33471eb0920f177f68472aa4c507eba7c02
parentb529b95d0e5cafe185cc0716ad7099f1030c891e (diff)
downloadwww-7e237d0f683ea17f275ca11a31285ab2bb64a471.tar.gz
remove ponder for now
-rw-r--r--index.html13
1 files changed, 2 insertions, 11 deletions
diff --git a/index.html b/index.html
index 0af2c8b..1467ca0 100644
--- a/index.html
+++ b/index.html
@@ -40,21 +40,12 @@
 				<p>As there's a lot of stuff with school, etc. going around, I'm currently inactive on writing articles and stuff.  I have many recent ideas, and I'll turn them into RFDs when I have time.  (Secondary school in China is some work, really, compared with many other places.)</p>
 			</div>
 		<hr />
+			<!--
 			<div id="ponder">
 				<h2>Help me ponder upon these questions</h2>
 				<p>These are questions that interest me.  Maybe you have ideas?</p>
-				<h3>A Lisp-like Operating System</h3>
-				<p>Anybody who has tried functional programming knows that Lisp and <a href="https://haskell.org">Haskell</a> are special and great programming languages.  Most Lispers and all Haskell programmers adhere to the functional style of programming, creating mathematically-provably-correct programs.  I love the fact that Haskell supports Monads well and that it's statically typed (having the debugger find your issues is much more comfortable than debugging mid-run, while it's true that <a href="https://ghc.haskell.org">GHC</a> has quite good debugging utilities.  On the other hand, Haskell and Common Lisp have so many pragmatics and syntax sugar.  Scheme (which I consider to be a dialect of Lisp) is much more uniform and symmetric (think of group theory) in syntax, but has bad support for lazy evaluation.</p>
-				<p>There are many modern operating systems, for example the BSDs, GNU+Linux, Plan 9, etc.  (Microsoft Windows and macOS don't count, they're nonfree.)   But security issues are discovered every year in each of them, even <a href="https://OpenBSD.org">OpenBSD</a>, which is considered the most secure operating system for general use.  A lot of this has to do with the programming language they're written in, C.</p>
-				<p>In C, you've got a heap of pointers, memory stacks, arrays, linked lists, structures, etc. that you all have to manage by yourself.  This leaves huge gaps for programmer error.  By contrast, it is possible to mathematically prove the correctness (or the lack thereof, though I only use &ldquo;Possible&rdquo; because of Godel Incompleteness) of a functional program.  This eases the work for programmers.</p>
-				<p>Most, if not all security issues in programs written in classical imperative programming languages are with bogus stacks, pointers, etc.  There are countless times when stack overflows are used in attacks.  By using functional languages, it just works!</p>
-				<p>There have been <a href="http://metamodular.com/Common-Lisp/lispos.html">great proposals by other people</a> on this ideea.  If you are into operating system development and programming in general, please read it, and share your thoughts with me.  If many people voice on this issue, I'll start an mailing list.</p>
-				<h3>What about a pure functional Lisp dialect, with monads and similar (Haskell) ideas?</h3>
-				<p>I love s-expressions, as they clearly represent the structure of a program, or even natural language.  They also allow for powerful macros, enabling some Lisp dialects to have continuations and other cool stuff.  Haskell, on the other hand, is purely functional, where things that involve side effects are usually implemented with Monads.  I'm looking for an implementation that combines these.</p>
-				<p><a href="https://shen-language.github.io">The Shen Language</a> seems interesting.</p>
-				<h3>What about a mathematical political system?</h3>
-				<p>A government too strong causes authoritarianism which may lead to non-democracies, while a government too weak causes the inability of the government to do anything with the slightest controversy (look at COVID handling).  Is there a mathematical way (say a function; this sounds like group theory, but I'm not sure) to compute, based all known information known about the bill/order/whatever being considered, if the government (I'm especially talking about the executive here) has the right to order that? I feel like this could be proved impossible due to incompleteness and unpredictability, but this needs further investigation.  This is the main problem in question of the Libre Society project, by the way.</p>
 			</div>
+			-->
 		<hr />
 			<div id="quotes">
 				<h2>Quotes</h2>
an class="n">exists, abspath # Need to find out whether or not the flag --clean was used ASAP, # because --clean is supposed to disable bytecode compilation argv = sys.argv[1:sys.argv.index('--')] if '--' in sys.argv else sys.argv[1:] sys.dont_write_bytecode = '-c' in argv or '--clean' in argv # Don't import ./ranger when running an installed binary at /usr/.../ranger if __file__[:4] == '/usr' and exists('ranger') and abspath('.') in sys.path: sys.path.remove(abspath('.')) # Start ranger import ranger sys.exit(ranger.main())