<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Errors on TrustLang</title>
		<link>https://trust-lang.net/en/tags/errors/</link>
		<description>Recent content in Errors on TrustLang</description>
		<generator>Hugo</generator>
		<language>en</language>
		
		
		
		
			<lastBuildDate>Wed, 09 Sep 2026 15:37:53 +0300</lastBuildDate>
		
			<atom:link href="https://trust-lang.net/en/tags/errors/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>Return, interrupts and error handling</title>
				<link>https://trust-lang.net/en/docs/operators/errors/</link>
				<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
				<guid>https://trust-lang.net/en/docs/operators/errors/</guid>
				<description>&lt;p&gt;A sequence of commands (a &lt;a href=&#34;https://trust-lang.net/en/docs/syntax/#block&#34;&gt;code block&lt;/a&gt;) can be interrupted at any point by&#xA;special interrupt statements. &lt;em&gt;TrustLang&lt;/em&gt; uses two kinds of interrupts, which in&#xA;meaning correspond to their notation:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;&amp;ldquo;positive&amp;rdquo;&lt;/strong&gt; interrupt &lt;code&gt;++&lt;/code&gt; — return of a value/through-flow (analog of &lt;code&gt;return&lt;/code&gt;);&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;&amp;ldquo;negative&amp;rdquo;&lt;/strong&gt; interrupt &lt;code&gt;--&lt;/code&gt; — error (analog of &lt;code&gt;throw&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;An interrupt can return a value: &lt;code&gt;++ &#39;String&#39; ++&lt;/code&gt; — return a string, &lt;code&gt;-- err --&lt;/code&gt; — &amp;ldquo;throw&amp;rdquo;&#xA;an error (a rough analog of &lt;code&gt;throw err&lt;/code&gt;). If no value is specified, the interrupt returns nothing&#xA;(an empty value).&lt;/p&gt;</description>
			</item>
			<item>
				<title>Reflections on the Turing machine and the causes of errors in programming languages</title>
				<link>https://trust-lang.net/en/blog/theory/turing-machine/</link>
				<pubDate>Sat, 15 Nov 2025 00:00:00 +0000</pubDate>
				<guid>https://trust-lang.net/en/blog/theory/turing-machine/</guid>
				<description>&lt;p&gt;A couple of years ago I wrote the article &lt;a href=&#34;https://trust-lang.net/en/blog/theory/structured-programming/&#34;&gt;Reflections on structured programming&lt;/a&gt;, in which I tried to sort out the misconception that Edsger Dijkstra proved that any algorithm can be built from just three constructs (sequence, selection, loop). Whereas in reality:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;This theorem was proved (with conditions and restrictions) by the Italian scientists &lt;strong&gt;Böhm and Jacopini&lt;/strong&gt;, and Dijkstra merely referred to it.&lt;/li&gt;&#xA;&lt;li&gt;The three mentioned basic algorithmic constructs are &lt;strong&gt;insufficient&lt;/strong&gt; for modern programming (for example, exception handling is required).&lt;/li&gt;&#xA;&lt;li&gt;The famous criticism of the &lt;code&gt;goto&lt;/code&gt; statement by Dijkstra (as well as of the assignment statement, which is always forgotten to mention) was not a strict ban, but merely a &lt;strong&gt;recommendation for improving code style&lt;/strong&gt;, so that programs would be easier to analyze.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;And now the time has come to write about some problems of the Turing machine — the fundamental basis of all information technology.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
