Skip to content

Home//Concepts/Join

K

154

2

2

Chapter 1. The psychopathology of everyday things

59

Accessibility Accidental signifier Adaptability Affordance Agent

91

According to Don Norman, what is a solution to the paradox of technology?According to Don Norman, what is the paradox of technology?According to HCD, should we specify the problem early on?Are anti-affordances affordances themselves?Are perceived affordances affordances themselves?

1

Phase 0 - design as a discipline (recalibration)

20

19

Acquire-Release Semantics Atomic Instruction Consensus Hierarchy Consensus Number Consensus Problem

1086

5

Autoref Specialization Boolean blindness Generalized Autoref-Based Specialization Notes on module systems Push ifs up and fors down

4

Matklad.github.io dtolnay/case-studies lukaskalbertodt.github.io Existentialtype.wordpress.com

24

4

2

Chapter 1. Abstract syntax

6

Chapter 1. Learning SMoL - standard model of languages Chapter 2. Evaluation Chapter 3. Syntactic sugar Chapter 4. Objects Chapter 5. Types

5

4

Chapter 1. Basics - functional programming in rocq Chapter 2. Inductive definitions Chapter 3. Hypothetical and general judgments

7

Chapter 1. Introduction Chapter 2. Mathematical preliminaries

4

Chapter 3. Untyped arithmetic expressions Chapter 4. An ML implementation of arithmetic expressions Chapter 5. The untyped/pure lambda-calculus

Essentials of programming languages Programming language pragmatics

633

2-dimensional inference rule format Abstract binding graph Abstract binding tree (ABT)Abstract binding tree abt valence abstractor Abstract data type

408

According to computability theory, why do we split type checkers from parsers?According to robert (bob) harper, what are symbol, symbolic parameter and indexed operator?According to robert (bob) harper, what is a sort, syntactically?According to robert (bob) harper, what is a variable?According to robert (bob) harper, what is an operator, the arity of an operator?

11

Phase 1 - foundations of program specification and semantics Phase 10 - concurrency & parallelism models Phase 11 - metaprogramming & extensibility Phase 2 - formal language theory & parsing Phase 3 - computability, complexity & decidability

57

2

2

Chapter 1. The world of behavioral code analysis

16

Behavioral code analysis Conflict-free Replicated Data Type Eventual Consistency Flat Filesystem Namespace Fractional Indexing

17

15

1

1

Figma: Multiplayer Technology

13

4

1

GitHub Contents API

2

OneDrive/MS Graph: Addressing DriveItems VS Code FileSystemProvider

Optimistic Locking with ETags in REST APIs

5

3

DGIT How GitHub Stores and Serves Git Repositories How GitHub Stores Millions of Repos and Billions of Files

Database vs Blob Storage for Files System Design: Google Drive / Dropbox

4

MongoDB GridFS Notion: Block-Based Data Model PostgreSQL: Storing Files in the Database Supabase Storage: Database Schema

1

21

How does optimistic concurrency control work?How does optimistic concurrency differ from pessimistic locking?What are the failure modes of the pre-signed URL upload pattern?What happens when you delete a row that references a PostgreSQL Large Object?What is a flat namespace for file storage and what is the tradeoff?

K

154

2

2

Chapter 1. The psychopathology of everyday things

59

Accessibility Accidental signifier Adaptability Affordance Agent

91

According to Don Norman, what is a solution to the paradox of technology?According to Don Norman, what is the paradox of technology?According to HCD, should we specify the problem early on?Are anti-affordances affordances themselves?Are perceived affordances affordances themselves?

1

Phase 0 - design as a discipline (recalibration)

20

19

Acquire-Release Semantics Atomic Instruction Consensus Hierarchy Consensus Number Consensus Problem

1086

5

Autoref Specialization Boolean blindness Generalized Autoref-Based Specialization Notes on module systems Push ifs up and fors down

4

Matklad.github.io dtolnay/case-studies lukaskalbertodt.github.io Existentialtype.wordpress.com

24

4

2

Chapter 1. Abstract syntax

6

Chapter 1. Learning SMoL - standard model of languages Chapter 2. Evaluation Chapter 3. Syntactic sugar Chapter 4. Objects Chapter 5. Types

5

4

Chapter 1. Basics - functional programming in rocq Chapter 2. Inductive definitions Chapter 3. Hypothetical and general judgments

7

Chapter 1. Introduction Chapter 2. Mathematical preliminaries

4

Chapter 3. Untyped arithmetic expressions Chapter 4. An ML implementation of arithmetic expressions Chapter 5. The untyped/pure lambda-calculus

Essentials of programming languages Programming language pragmatics

633

2-dimensional inference rule format Abstract binding graph Abstract binding tree (ABT)Abstract binding tree abt valence abstractor Abstract data type

408

According to computability theory, why do we split type checkers from parsers?According to robert (bob) harper, what are symbol, symbolic parameter and indexed operator?According to robert (bob) harper, what is a sort, syntactically?According to robert (bob) harper, what is a variable?According to robert (bob) harper, what is an operator, the arity of an operator?

11

Phase 1 - foundations of program specification and semantics Phase 10 - concurrency & parallelism models Phase 11 - metaprogramming & extensibility Phase 2 - formal language theory & parsing Phase 3 - computability, complexity & decidability

57

2

2

Chapter 1. The world of behavioral code analysis

16

Behavioral code analysis Conflict-free Replicated Data Type Eventual Consistency Flat Filesystem Namespace Fractional Indexing

17

15

1

1

Figma: Multiplayer Technology

13

4

1

GitHub Contents API

2

OneDrive/MS Graph: Addressing DriveItems VS Code FileSystemProvider

Optimistic Locking with ETags in REST APIs

5

3

DGIT How GitHub Stores and Serves Git Repositories How GitHub Stores Millions of Repos and Billions of Files

Database vs Blob Storage for Files System Design: Google Drive / Dropbox

4

MongoDB GridFS Notion: Block-Based Data Model PostgreSQL: Storing Files in the Database Supabase Storage: Database Schema

1

21

How does optimistic concurrency control work?How does optimistic concurrency differ from pessimistic locking?What are the failure modes of the pre-signed URL upload pattern?What happens when you delete a row that references a PostgreSQL Large Object?What is a flat namespace for file storage and what is the tradeoff?

Programming Language Theory Concept

Join

Books

Chapter 2. Mathematical preliminaries

JourneyProgramming Language Theory Statusreviewing Tags

order lattice theory

In the context of a Partial order, the least upper bound of a set $S$ , denoted $⋁ S$ .

Previous in ConceptsIterated inductive definition simultaneous inductive Next in Concepts Judgment

Books

Chapter 2. Mathematical preliminaries

JourneyProgramming Language Theory

Statusreviewing

Tags

order lattice theory

Powered by Typerighter