<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>scrambled</title>
    <link>https://huydo862003.github.io/</link>
    <description>Personal knowledge base</description>
    <language>en</language>
    <atom:link href="https://huydo862003.github.io/feed.xml" rel="self" type="application/rss+xml"/>
    <item>
      <title>Judgment form</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/judgment-form</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/judgment-form</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[Synonymous with an n-place relation. For a unary relation/predicate, a judgment form is usually written as $J\\ -$ or $-\\ J$, with $-$ being a placeholder for some value drawn from the domain of the pr]]></description>
    </item>
    <item>
      <title>What</title>
      <link>https://huydo862003.github.io/programming-language-theory/flashcards/whats-the-most-popular-semantic-style-today-why</link>
      <guid>https://huydo862003.github.io/programming-language-theory/flashcards/whats-the-most-popular-semantic-style-today-why</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[What's the most popular semantic style today? why?]]></description>
    </item>
    <item>
      <title>Strict/Eager evaluation strategy</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/strict-eager-evaluation-strategy</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/strict-eager-evaluation-strategy</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[Language feature/design An ${fref"programming-language-theory/concepts/evaluation-strategy.td"} such that an argument is evaluated before passing into the function call.]]></description>
    </item>
    <item>
      <title>Infinite type</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/infinite-type</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/infinite-type</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[A type that has infinitely many inhabitants like nat, string, or list, as opposed to finite types like bool or enums with fixed members.]]></description>
    </item>
    <item>
      <title>Pre-signed URLs</title>
      <link>https://huydo862003.github.io/software-engineering/concepts/pre-signed-urls</link>
      <guid>https://huydo862003.github.io/software-engineering/concepts/pre-signed-urls</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[A pattern where the server generates a temporary, authenticated URL that allows a client to upload or download directly from blob storage S3, Azure Blob, etc. without going through the backend.]]></description>
    </item>
    <item>
      <title>An evaluation statement is derivable iff there exists which derivation tree?</title>
      <link>https://huydo862003.github.io/programming-language-theory/flashcards/an-evaluation-statement-is-derivable-iff-there-exists-which-derivation-tree</link>
      <guid>https://huydo862003.github.io/programming-language-theory/flashcards/an-evaluation-statement-is-derivable-iff-there-exists-which-derivation-tree</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[An evaluation statement is derivable iff there exists which derivation tree?]]></description>
    </item>
    <item>
      <title>Decision procedure</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/decision-procedure</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/decision-procedure</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[An algorithm that always terminates and correctly answers yes/no for any instance of a given problem class like propositional satisfiability or type equivalence.]]></description>
    </item>
    <item>
      <title>Gallina</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/gallina</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/gallina</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[A ${fref"programming-language-theory/concepts/functional-programming.td"} language ${fref"programming-language-theory/concepts/rocq.td"}'s specification language that allows writing purely functional programs and formal proofs, using ${fref"programming-language-theory/concepts/dependent-type.td"} to express precise logical properties.]]></description>
    </item>
    <item>
      <title>Why is the derivability judgment stable under extension to the rules?</title>
      <link>https://huydo862003.github.io/programming-language-theory/flashcards/why-is-the-derivability-judgment-stable-under-extension-to-the-rules</link>
      <guid>https://huydo862003.github.io/programming-language-theory/flashcards/why-is-the-derivability-judgment-stable-under-extension-to-the-rules</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[Why is the derivability judgment stable under extension to the rules?]]></description>
    </item>
    <item>
      <title>First class functional programming pure</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/first-class-functional-programming-pure</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/first-class-functional-programming-pure</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[The status of an entity being a first-class citizen in a language  -  typically:]]></description>
    </item>
    <item>
      <title>SAGA pattern</title>
      <link>https://huydo862003.github.io/parallel-and-distributed-programming/concepts/saga</link>
      <guid>https://huydo862003.github.io/parallel-and-distributed-programming/concepts/saga</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[A pattern that only arises in systems that have distributed databases and want to perform a transaction that span several databases in a way that is close to the desirable ACID properties.]]></description>
    </item>
    <item>
      <title>Hypothetical rule</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/hypothetical-rule</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/hypothetical-rule</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description></description>
    </item>
    <item>
      <title>What should a good design do during errors?</title>
      <link>https://huydo862003.github.io/design/flashcards/what-should-a-good-design-do-during-errors</link>
      <guid>https://huydo862003.github.io/design/flashcards/what-should-a-good-design-do-during-errors</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[What should a good design do during errors?]]></description>
    </item>
    <item>
      <title>Error recovery</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/error-recovery</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/error-recovery</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description></description>
    </item>
    <item>
      <title>What is the evaluation relation?</title>
      <link>https://huydo862003.github.io/programming-language-theory/flashcards/what-is-the-evaluation-relation</link>
      <guid>https://huydo862003.github.io/programming-language-theory/flashcards/what-is-the-evaluation-relation</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[What is the evaluation relation?]]></description>
    </item>
    <item>
      <title>Multiple inheritance</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/multiple-inheritance</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/multiple-inheritance</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[An ${fref"programming-language-theory/concepts/inheritance.td"} model where a class can inherit from multiple parent classes, combining their behaviors but potentially introducing ambiguity ${fref"programming-language-theory/concepts/the-diamond-problem.td"} when parents share method names.]]></description>
    </item>
    <item>
      <title>What are some ways to define the syntax of a language?</title>
      <link>https://huydo862003.github.io/programming-language-theory/flashcards/what-are-some-ways-to-define-the-syntax-of-a-language</link>
      <guid>https://huydo862003.github.io/programming-language-theory/flashcards/what-are-some-ways-to-define-the-syntax-of-a-language</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[What are some ways to define the syntax of a language?]]></description>
    </item>
    <item>
      <title>Simultaneous inductive definition</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/simultaneous-inductive-definition</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/simultaneous-inductive-definition</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[A definition technique that define more than one sets at once as a collection of ${fref"programming-language-theory/concepts/inference-rule.td"}s to determine membership of the elements of the sets - each inference rule shall refer to the sets in its ${fref"programming-language-theory/concepts/premise.td"}s and its ${fref"programming-language-theory/concepts/conclusion.td"}s.]]></description>
    </item>
    <item>
      <title>Iterated inductive definition</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/iterated-inductive-definition</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/iterated-inductive-definition</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[An ${fref"programming-language-theory/concepts/inductive-definition.td"} technique that specifies a set of elements as the strongest sets closed under a set of ${fref"programming-language-theory/concepts/inference-rule.td"}s - each inference rule may only refer to already defined sets or the currently defined one.]]></description>
    </item>
    <item>
      <title>Style dictionary</title>
      <link>https://huydo862003.github.io/design/concepts/style-dictionary</link>
      <guid>https://huydo862003.github.io/design/concepts/style-dictionary</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[A build system that automatically transforms platform-agnostic ${fref"design/concepts/design-token.td", "design tokens"} JSON into platform-specific code CSS, Swift, Android XML to ensure synchronization.]]></description>
    </item>
    <item>
      <title>Recursive descent</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/recursive-descent</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/recursive-descent</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description></description>
    </item>
    <item>
      <title>What is a countable set?</title>
      <link>https://huydo862003.github.io/programming-language-theory/flashcards/what-is-a-countable-set</link>
      <guid>https://huydo862003.github.io/programming-language-theory/flashcards/what-is-a-countable-set</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[What is a countable set?]]></description>
    </item>
    <item>
      <title>PostgreSQL text</title>
      <link>https://huydo862003.github.io/software-engineering/concepts/postgresql-text</link>
      <guid>https://huydo862003.github.io/software-engineering/concepts/postgresql-text</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[A PostgreSQL column type that stores character data with UTF-8 encoding validation.]]></description>
    </item>
    <item>
      <title>Why is subclass = subtype a controversial choice?</title>
      <link>https://huydo862003.github.io/programming-language-theory/flashcards/why-is-subclass-subtype-a-controversial-choice</link>
      <guid>https://huydo862003.github.io/programming-language-theory/flashcards/why-is-subclass-subtype-a-controversial-choice</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[Why is subclass = subtype a controversial choice?]]></description>
    </item>
    <item>
      <title>Structural type</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/structural-type</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/structural-type</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[A type defined by its shape fields, methods, signatures rather than its name - two types are equal if they have the same structure.]]></description>
    </item>
    <item>
      <title>Flow-sensitive typing</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/flow-sensitive-typing</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/flow-sensitive-typing</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[Synonym for Flow typing - the type checker is \"sensitive\" to control flow, tracking how conditionals, assignments, and predicates refine types at different program points.]]></description>
    </item>
    <item>
      <title>Type compatibility</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/type-compatibility</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/type-compatibility</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[A relation between types that implies ${fref"programming-language-theory/concepts/substitutability.td"}. A static approximation of Substitutability.]]></description>
    </item>
    <item>
      <title>Desugar</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/desugar</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/desugar</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[The process of transforming ${fref"programming-language-theory/concepts/syntactic-sugar.td"} or high-level constructs into more primitive forms in the ${fref"programming-language-theory/concepts/core-calculus-language.td"}, simplifying the interpreter or compiler implementation.]]></description>
    </item>
    <item>
      <title>What is an example of an anti-affordance?</title>
      <link>https://huydo862003.github.io/design/flashcards/what-is-an-example-of-an-anti-affordance</link>
      <guid>https://huydo862003.github.io/design/flashcards/what-is-an-example-of-an-anti-affordance</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[What is an example of an anti-affordance?]]></description>
    </item>
    <item>
      <title>Cross-platform</title>
      <link>https://huydo862003.github.io/design/concepts/cross-platform</link>
      <guid>https://huydo862003.github.io/design/concepts/cross-platform</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[The ability of a ${fref"design/concepts/design-system.td", "design system"} to deliver a cohesive experience and shared resources across distinct environments like Web, iOS, and Android.]]></description>
    </item>
    <item>
      <title>Induction on derivations</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/induction-on-derivations</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/induction-on-derivations</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[An induction technique in which to prove a specific property about a ${fref"programming-language-theory/concepts/derivation.td"}, we take the ${fref"programming-language-theory/concepts/inductive-hypothesis.td"} is that every smaller derivations satisfy that property.]]></description>
    </item>
    <item>
      <title>What is admissibility as a notion of entailment?</title>
      <link>https://huydo862003.github.io/programming-language-theory/flashcards/what-is-admissibility-as-a-notion-of-entailment</link>
      <guid>https://huydo862003.github.io/programming-language-theory/flashcards/what-is-admissibility-as-a-notion-of-entailment</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[What is admissibility as a notion of entailment?]]></description>
    </item>
    <item>
      <title>Lexicographic order principle of lexicographic induction</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/lexicographic-order-principle-of-lexicographic-induction</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/lexicographic-order-principle-of-lexicographic-induction</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[A total ordering on sequences that compares elements position-by-position from left to right, with the first differing position determining precedence  -  like dictionary ordering of words.]]></description>
    </item>
    <item>
      <title>What are the pros and cons of backward chaining search?</title>
      <link>https://huydo862003.github.io/programming-language-theory/flashcards/what-are-the-pros-and-cons-of-backward-chaining-search</link>
      <guid>https://huydo862003.github.io/programming-language-theory/flashcards/what-are-the-pros-and-cons-of-backward-chaining-search</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[What are the pros and cons of backward chaining search?]]></description>
    </item>
    <item>
      <title>Model checker</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/model-checker</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/model-checker</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[An automated verification technique that exhaustively explores the state space of a typically finite-state system to detect violations of specified properties such as safety, liveness, or protocol correctness.]]></description>
    </item>
    <item>
      <title>Token</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/token</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/token</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description></description>
    </item>
    <item>
      <title>How to write a derivability judgment and what does it mean?</title>
      <link>https://huydo862003.github.io/programming-language-theory/flashcards/how-to-write-a-derivability-judgment-and-what-does-it-mean</link>
      <guid>https://huydo862003.github.io/programming-language-theory/flashcards/how-to-write-a-derivability-judgment-and-what-does-it-mean</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[How to write a derivability judgment and what does it mean?]]></description>
    </item>
    <item>
      <title>Desired property: determinacy of one-step evaluation relation</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/desired-property-determinacy-of-one-step-evaluation-relation</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/desired-property-determinacy-of-one-step-evaluation-relation</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[A desirable property of a ${fref"programming-language-theory/concepts/lambda-calculus.td"} where each term always evaluates to the same term in a single step.]]></description>
    </item>
    <item>
      <title>Rocq church numeral</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/rocq-church-numeral</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/rocq-church-numeral</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description></description>
    </item>
    <item>
      <title>Generic (general) judgment</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/generic-general-judgment</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/generic-general-judgment</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description></description>
    </item>
    <item>
      <title>Give an example of a dilemma where affordance and anti-affordance cannot be both discoverable?</title>
      <link>https://huydo862003.github.io/design/flashcards/give-an-example-of-a-dilemma-where-affordance-and-anti-affordance-cannot-be-both-discoverable</link>
      <guid>https://huydo862003.github.io/design/flashcards/give-an-example-of-a-dilemma-where-affordance-and-anti-affordance-cannot-be-both-discoverable</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[Give an example of a dilemma where affordance and anti-affordance cannot be both discoverable?]]></description>
    </item>
    <item>
      <title>How to write an admissibility judgment and what does it mean?</title>
      <link>https://huydo862003.github.io/programming-language-theory/flashcards/how-to-write-an-admissibility-judgment-and-what-does-it-mean</link>
      <guid>https://huydo862003.github.io/programming-language-theory/flashcards/how-to-write-an-admissibility-judgment-and-what-does-it-mean</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[How to write an admissibility judgment and what does it mean?]]></description>
    </item>
    <item>
      <title>Principle of ordinary induction</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/principle-of-ordinary-induction</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/principle-of-ordinary-induction</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[A proof technique with a base case and an inductive step that assumes the property holds for the immediate predecessor to prove it for the successor.]]></description>
    </item>
    <item>
      <title>If-splitting</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/if-splitting</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/if-splitting</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[A type system mechanism where conditionals narrow union types based on predicates - after if mt? t, the type of t refines from BT union to just mt in that branch, implementing Flow-sensitive typin]]></description>
    </item>
    <item>
      <title>How to implement self-reference with and without mutation?</title>
      <link>https://huydo862003.github.io/programming-language-theory/flashcards/how-to-implement-self-reference-with-and-without-mutation</link>
      <guid>https://huydo862003.github.io/programming-language-theory/flashcards/how-to-implement-self-reference-with-and-without-mutation</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[How to implement self-reference with and without mutation?]]></description>
    </item>
    <item>
      <title>What are the key considerations in designing conditionals?</title>
      <link>https://huydo862003.github.io/programming-language-theory/flashcards/what-are-the-key-considerations-in-designing-conditionals</link>
      <guid>https://huydo862003.github.io/programming-language-theory/flashcards/what-are-the-key-considerations-in-designing-conditionals</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[What are the key considerations in designing conditionals?]]></description>
    </item>
    <item>
      <title>Global hypothesis</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/global-hypothesis</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/global-hypothesis</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description></description>
    </item>
    <item>
      <title>How to place declarations inside a module in rocq?</title>
      <link>https://huydo862003.github.io/programming-language-theory/flashcards/how-to-place-declarations-inside-a-module-in-rocq</link>
      <guid>https://huydo862003.github.io/programming-language-theory/flashcards/how-to-place-declarations-inside-a-module-in-rocq</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[How to place declarations inside a module in rocq?]]></description>
    </item>
    <item>
      <title>How to utilize the property of word-aligned addresses to optimize number</title>
      <link>https://huydo862003.github.io/programming-language-theory/flashcards/how-to-utilize-the-property-of-word-aligned-addresses-to-optimize-numbers-placements</link>
      <guid>https://huydo862003.github.io/programming-language-theory/flashcards/how-to-utilize-the-property-of-word-aligned-addresses-to-optimize-numbers-placements</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[How to utilize the property of word-aligned addresses to optimize number's placements?]]></description>
    </item>
    <item>
      <title>Combinator</title>
      <link>https://huydo862003.github.io/programming-language-theory/concepts/combinator</link>
      <guid>https://huydo862003.github.io/programming-language-theory/concepts/combinator</guid>
      <pubDate>Wed, 21 Jan 1970 17:42:55 GMT</pubDate>
      <description><![CDATA[A ${fref"programming-language-theory/concepts/lambda-term.td"} that contains no ${fref"programming-language-theory/concepts/free-variable.td"}, or in other words, a ${fref"programming-language-theory/concepts/closed-term.td"}.]]></description>
    </item>
  </channel>
</rss>
