← back to journey

Concepts (537)

Concept ↑StatusTagsBooks
2-dimensional inference rule formatLogicSet Theory RelationSyntax GrammarChapter 3 Untyped Arithmetic Expressions
Abstract binding graphChapter 1 Abstract Syntax
Abstract binding tree (ABT)Compiler ImplementationSemanticsSyntax GrammarChapter 1 Abstract SyntaxChapter 2 Inductive Definitions
Abstract data typeDesign PrincipleLanguage Feature DesignProgramming ParadigmChapter 4 Objects
Abstract machineCompiler ImplementationComputation TheoryLinguisticsRuntimeChapter 3 Untyped Arithmetic Expressions
Abstract syntax tree (AST)Compiler ImplementationSyntax GrammarChapter 5 The Untyped Pure Lambda CalculusChapter 1 Abstract Syntax
AbstractorSyntax GrammarChapter 1 Abstract Syntax
Actual parameter/ArgumentLanguage Feature DesignSemanticsSyntax GrammarChapter 1 Learning Smol Standard Model Of LanguagesChapter 2 EvaluationChapter 1 Abstract Syntax
AdmissibilityChapter 3 Hypothetical And General Judgments
Admissibility judgmentChapter 3 Hypothetical And General Judgments
AdmissibleChapter 3 Hypothetical And General Judgments
Algebraic data typeLanguage Feature DesignProgramming ParadigmType TheoryChapter 5 Types
AliasingChapter 1 Learning Smol Standard Model Of Languages
Alpha conversion/renamingLambda CalculusSemanticsChapter 5 The Untyped Pure Lambda Calculus
Alpha-equivalenceChapter 1 Abstract Syntax
Alpha-variantSemanticsSyntax GrammarChapter 1 Abstract Syntax
AntecedentLogicChapter 5 Types
AntisymmetricSet Theory RelationChapter 2 Mathematical Preliminaries
AntisymmetryChapter 3 Hypothetical And General Judgments
API boundary
Application/Function callChapter 5 The Untyped Pure Lambda Calculus
Architecture invariant
ArityLanguage Feature DesignSemanticsSet Theory RelationSyntax GrammarChapter 5 TypesChapter 1 Abstract Syntax
Arrow typeFormal SystemLanguage Feature DesignType TheoryPreface
AssertionLogicChapter 2 Inductive Definitions
AssociativitySyntax GrammarChapter 1 Basics Functional Programming In Rocq
Assume-guarantee reasoningProof Reason TechniqueChapter 5 Types
AST rewritingCompiler ImplementationLanguage Feature DesignMetaprogramming Self ReflectionSyntax GrammarChapter 3 Syntactic Sugar
AutoboxingLanguage Feature DesignRuntimeSemantics
Automated theorem proverFormal SystemLogicLogical Foundations
Automatic memory managementChapter 1 Learning Smol Standard Model Of Languages
AxiomLogicChapter 3 Untyped Arithmetic Expressions
Axiomatic semanticsChapter 3 Untyped Arithmetic Expressions
Backward chainingLogicProof Reason TechniqueSet Theory RelationChapter 2 Inductive Definitions
Backward chaining searchLogicProof Reason TechniqueSet Theory RelationChapter 2 Inductive Definitions
Basic judgmentChapter 3 Hypothetical And General Judgments
Behavioral/Observational/Contextual equivalenceProgram AnalysisSemanticsChapter 5 The Untyped Pure Lambda Calculus
Beta-equivalenceLambda CalculusSemantics
Beta-redex/Reducible expressionChapter 5 The Untyped Pure Lambda Calculus
Beta-reductionLambda CalculusSemanticsChapter 5 The Untyped Pure Lambda Calculus
Big-step/Natural operational semanticsFormal SystemSemanticsChapter 3 Untyped Arithmetic Expressions
Binary relationSet Theory RelationChapter 2 Mathematical Preliminaries
BinderLambda CalculusSyntax GrammarChapter 5 The Untyped Pure Lambda Calculus
BindingChapter 1 Learning Smol Standard Model Of Languages
Binding structure of syntaxCompiler ImplementationSemanticsSyntax GrammarChapter 1 Abstract Syntax
Blame trackingLanguage Feature DesignProgram AnalysisRuntimeSemanticsType Theory
BlockChapter 1 Learning Smol Standard Model Of Languages
BNFChapter 3 Untyped Arithmetic Expressions
Boolean blindnessDesign PrincipleType Theory
Borrow checker
1 / 11
© 2026 Scrambled Kitchen·GitHub