<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Overview on TrustLang</title>
		<link>https://trust-lang.net/en/tags/overview/</link>
		<description>Recent content in Overview 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/overview/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>About the project</title>
				<link>https://trust-lang.net/en/docs/</link>
				<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
				<guid>https://trust-lang.net/en/docs/</guid>
				<description>&lt;p&gt;&lt;em&gt;TrustLang&lt;/em&gt; is a programming language that is transpiled to C++ and built by an external&#xA;compiler. The key properties of the model:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Rule-based grammar, not keyword-based&lt;/strong&gt; — a simple single-pass parser and&#xA;extensibility; the usual keyword-based notation is implemented by macros&#xA;(&lt;a href=&#34;https://trust-lang.net/en/docs/syntax/&#34;&gt;Syntax&lt;/a&gt;, &lt;a href=&#34;https://trust-lang.net/en/docs/syntax/macros/&#34;&gt;Macros&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Safe memory model without a garbage collector&lt;/strong&gt; — RAII, strong/weak references, prohibition of&#xA;strong cyclic references, stack protection (&lt;a href=&#34;https://trust-lang.net/en/docs/safety/&#34;&gt;Safety and quality&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;C/C++ — first-class integration&lt;/strong&gt; — native types/functions/classes and templates, embed&#xA;inserts, linking; taken into account in every context (&lt;a href=&#34;https://trust-lang.net/en/docs/types/native/&#34;&gt;Types&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Flexible typing and type inference&lt;/strong&gt; — static and dynamic, automatic inference&#xA;(&lt;a href=&#34;https://trust-lang.net/en/docs/types/&#34;&gt;Types&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Contracts and verification&lt;/strong&gt; — pre/postconditions and assertions are checked by an SMT solver (Z3)&#xA;(&lt;a href=&#34;safety/verification/&#34;&gt;Verification&lt;/a&gt;).&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Script-like launch&lt;/strong&gt; — a file with the shebang &lt;code&gt;#!.../trust --run&lt;/code&gt; runs directly, like a&#xA;Python script, but with full compilation: transpilation to C++, build and launch of the binary happen&#xA;automatically, no interpreter is needed.&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
			</item>
			<item>
				<title>Status and plans</title>
				<link>https://trust-lang.net/en/docs/status/</link>
				<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
				<guid>https://trust-lang.net/en/docs/status/</guid>
				<description>&lt;h2 id=&#34;implemented-in-the-current-version-060&#34;&gt;Implemented in the current version (0.6.0)&lt;a class=&#34;td-heading-self-link&#34; href=&#34;#implemented-in-the-current-version-060&#34; aria-label=&#34;Heading self-link&#34;&gt;&lt;/a&gt;&lt;/h2&gt;&lt;ul&gt;&#xA;&lt;li&gt;&lt;input checked=&#34;&#34; disabled=&#34;&#34; type=&#34;checkbox&#34;&gt; The &lt;a href=&#34;https://trust-lang.net/en/docs/syntax/concept/&#34;&gt;syntax concept&lt;/a&gt; has been developed&lt;/li&gt;&#xA;&lt;li&gt;&lt;input checked=&#34;&#34; disabled=&#34;&#34; type=&#34;checkbox&#34;&gt; The &lt;a href=&#34;https://trust-lang.net/en/docs/syntax/macros/&#34;&gt;macro syntax&lt;/a&gt; has been defined&lt;/li&gt;&#xA;&lt;li&gt;&lt;input checked=&#34;&#34; disabled=&#34;&#34; type=&#34;checkbox&#34;&gt; Parser and literals for &lt;a href=&#34;https://trust-lang.net/en/docs/types/&#34;&gt;basic data types&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;input checked=&#34;&#34; disabled=&#34;&#34; type=&#34;checkbox&#34;&gt; The concept of &lt;a href=&#34;https://trust-lang.net/en/docs/safety/&#34;&gt;language guarantees&lt;/a&gt; has been formulated&lt;/li&gt;&#xA;&lt;li&gt;&lt;input checked=&#34;&#34; disabled=&#34;&#34; type=&#34;checkbox&#34;&gt; The &lt;a href=&#34;https://trust-lang.net/en/docs/sandbox/&#34;&gt;playground&lt;/a&gt; for testing examples has been developed&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
			</item>
			<item>
				<title>An unusual concept of the syntax of a programming language</title>
				<link>https://trust-lang.net/en/blog/language-design/unusual-prog/</link>
				<pubDate>Mon, 24 May 2021 00:00:00 +0000</pubDate>
				<guid>https://trust-lang.net/en/blog/language-design/unusual-prog/</guid>
				<description>&lt;p&gt;&lt;img src=&#34;https://trust-lang.net/en/blog/langs.jpeg&#34; alt=&#34;Featured image&#34;&gt;&lt;/p&gt;&#xA;&#xA;&#xA;&lt;div class=&#34;pageinfo pageinfo-primary&#34;&gt;&#xA;&lt;p&gt;Attention!!!&lt;/p&gt;&#xA;&lt;p&gt;This article contains a description of the syntax of the previous version of NewLang.&lt;/p&gt;&#xA;&lt;p&gt;The current version of the language syntax can be viewed &lt;a href=&#34;https://trust-lang.net/en/docs/&#34;&gt;here&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&lt;/div&gt;&#xA;&#xA;&lt;p&gt;I want to present to the readers&amp;rsquo; discussion a somewhat unusual concept of a programming language, which lacks the problem&#xA;inherent in almost all industrial languages — the constant increase in the complexity of the language syntax due to its natural development as new versions are released and new features are added.&#xA;This problem is described in the article &lt;a href=&#34;https://trust-lang.net/en/blog/programming/complex-prog/&#34;&gt;&amp;ldquo;Simple complex programming&amp;rdquo;&lt;/a&gt; and &lt;a href=&#34;https://trust-lang.net/en/blog/language-design/lang-final/&#34;&gt;What is the &amp;ldquo;ideal&amp;rdquo; goal of the development of programming languages?&lt;/a&gt;&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
