B Method
1 program
Added 2026-02-27T00:00:00Z
Agent: claude-codeModel: claude-sonnet-4-6WebSearch: disabled
Evidence
Report issue
View issues
Aliases: B, Abstract Machine Notation, AMN
Provenance: commit 7b8cfdfd17 · authored 2026-02-27T08:23:09+01:00 · agent claude-code · model claude-sonnet-4-6
Sources mentioning this language
7 sources · pl_id:
pl/bWikipedia infobox ↗
Pulled from the
wikimedia/structured-wikipedia
snapshot — see data/raw/wikipedia_pl_facts.*.jsonl and
pl_fact.csv for the long-table provenance.
| Typing | typeless (everything is a word) |
|---|---|
| Designed by | Ken Thompson · Dennis Ritchie |
| First appeared | 1969 |
| Influenced by | Fortran · BCPL · PL/I · TMG |
Extensions claimed by this language
2 claims. Each row is one upstream assertion with its strength.
SWH column shows file occurrences with that extension across the entire archive.| Extension | Source | Strength | SWH |
|---|---|---|---|
.b | linguist | primary | 238.6K files |
.b | wikipedia | proposed | 238.6K files |
Related languages
Real programs from Software Heritage
No SWH evidence indexed yet for this language. (Either the SWH mining hasn't reached this language's extensions, or no matching files exist in the archive.)
Programs collected by LLM agents experimental · unverified
Gathered by LLM agents during the experiment that started this catalogue. They are not verified: the agent names an origin, but a program can be altered or invented — an audit found one attributed to a file that does not exist, in a syntax the language does not have. Prefer the programs archived by Software Heritage above. The catalogue's goal is the languages themselves, grounded in sources (PLDB, Wikipedia, Rosetta Code, …), with real archived programs; these examples may be dropped.
Counter Machine
Provenance: commit 7b8cfdfd17 · authored 2026-02-27T08:23:09+01:00 · agent claude-code · model claude-sonnet-4-6 · WebSearch disabled
MACHINE Counter
VARIABLES cc
INVARIANT cc : NAT
INITIALISATION cc := 0
OPERATIONS
Increment = PRE cc < MAXINT THEN cc := cc + 1 END;
Decrement = PRE cc > 0 THEN cc := cc - 1 END;
val <-- Value = val := cc
END
Disambiguation rules
Linguist heuristic rules that predict this language when one of its claimed extensions is shared with another.
| Rule | Ext | Kind | Predicates (truncated) |
|---|---|---|---|
h/linguist/.b/0 | .b | predicates | [{"kind": "any", "regexes": ["^\\s*(?:extrn|auto|goto)\\b"]}, {"kind": "not_any", "regexes": ["^\\s*(?:implement|include|load|ref)\\b"]}] |