forthling
What it does
Run Forth-2012 in a sandbox: definitions stay between calls, each result shows the stacks.
- Connects 在你的电脑上运行
- Account or key No key needed
- Category 开发者工具
安装
选择你使用的 AI 应用,然后复制设置。
通过 3/3 项检查 · 在你的电脑上运行
第一步:你用哪个 AI?
选择你用的应用,步骤会显示在下方。
可连接 Claude,但需要先准备
不需要密钥,不用安装程序 · 仅限电脑上的 Claude 应用(Windows 或 Mac),网页和手机不可用
双击文件,然后在电脑版 Claude 应用中点击 Install
试一试
用 forthling 告诉我你能帮我做什么,然后做一件给我看✓ 如果 Claude 说正在使用 forthling,或回答中出现 forthling 的工具名称,就表示连接成功
菜单名称已于 2026年11月11日 对照 Anthropic 帮助页面核实 · 你的界面可能因版本略有不同
ChatGPT 暂时无法连接 forthling
forthling 需要安装在你的电脑上,而 ChatGPT 只能连接在网上运行的服务器
你可以改用这些方式
A · 使用能连接 forthling 的应用
- 不需要密钥,不用安装程序 · 仅限电脑上的 Claude 应用(Windows 或 Mac),网页和手机不可用
B · 开发者工具 类中能连接 ChatGPT 的其他服务器
从同类中使用较多的里挑选,仅限用地址即可连接、无需密钥的
- Sentry✓ ChatGPT
- Compiler Explorer✓ ChatGPT
- GitDiagram✓ ChatGPT
Claude Code 暂时无法连接 forthling
开发者只提供了电脑版 Claude 应用的安装文件
你可以改用这些方式
A · 使用能连接 forthling 的应用
- 不需要密钥,不用安装程序 · 仅限电脑上的 Claude 应用(Windows 或 Mac),网页和手机不可用
Cursor 暂时无法连接 forthling
开发者只提供了电脑版 Claude 应用的安装文件
你可以改用这些方式
A · 使用能连接 forthling 的应用
- 不需要密钥,不用安装程序 · 仅限电脑上的 Claude 应用(Windows 或 Mac),网页和手机不可用
VS Code 暂时无法连接 forthling
开发者只提供了电脑版 Claude 应用的安装文件
你可以改用这些方式
A · 使用能连接 forthling 的应用
- 不需要密钥,不用安装程序 · 仅限电脑上的 Claude 应用(Windows 或 Mac),网页和手机不可用
一览
哪些应用可以使用它
依据这个服务器的连接方式和各应用自己的文档,检查于 2026年11月10日。
在你的电脑上运行,适用于
ClaudeGooseLM StudioMsty StudioCherry StudioVisual StudioWindsurf (Devin Desktop)ZedKiroClineContinueJetBrains AI AssistantCodex CLIGemini CLIOpenCodenodecodeWarpLibreChatRaycast
它能做什么
它在你的电脑上运行;安装后,工具列表会显示在你的 AI 应用中。
基础检查i
我们检查的是任何人都能看到的信息;我们没有阅读代码。不适用的检查项不计入总数。 · 检查于 2026年11月14日
- ✓ 通过
作者与仓库一致
注册名称已通过 GitHub 账户 DeSchaker 验证,该账户拥有此仓库
- ✓ 通过
仍在维护
代码最后更新于5天前
- ✓ 通过
有许可证
使用 MIT
- – 不适用
端点有响应
它在你的电脑上运行,没有互联网端点
- – 不适用
使用 OAuth 登录
在你的电脑上运行,改用本地设置
- … 尚未检查
工具描述中没有隐藏指令
它在你的电脑上运行;我们只能读取互联网端点的工具列表
讨论
提问、分享技巧或报告无法使用。按“有帮助”数量排序。
用户评价
还没有评价
与“开发者工具”中的其他服务器比较i
- 星标数多于此分类中其他 5868 个服务器的 0%
- 发布到注册中心的时间比此分类中其他 5868 个服务器的 87% 更新
- 基础检查结果等于或优于此分类中其他 5868 个服务器的 100%
与注册中心里这个分类中所有活跃的服务器比较。只有当发布者拥有该仓库时,星标数才计入。
常见问题
forthling 安全吗?
它在 3 项适用的基础检查中通过了 3 项。我们没有阅读代码。在添加密钥或令牌之前,请先看看这个服务器要求哪些权限,并使用只具备所需权限的密钥。
它需要哪些密钥或代码?
注册中心没有列出必需的密钥,不过有些服务器会在首次使用时要求你登录。
它在我的电脑上运行还是在云端?
它在你的电脑上运行。你的 AI 应用会在需要时启动它,数据不会经过作者的服务器(除非它自己调用在线服务)。
它还在维护吗?
GitHub 仓库最后更新于5天前,最新版本(0.2.5)于5天前进入注册中心。
哪些应用可以使用它?
支持 MCP 的应用,例如 Claude Desktop、Claude Code、Cursor 和 VS Code。你的电脑上还需要有 Rust, MCPB。
同类别的其他选择
同一分类中其他作者的服务器,按星标数排序。
如何看卡片:↓ 每周下载量i★ GitHub 星标i三大支柱:评价 · 检查 · 使用情况i更新 = 最新版本发布到注册中心的时间i
GitHub
Connect AI assistants to GitHub - manage repos, issues, PRs, and workflows through natural language.
Serena MCP: the IDE for your agent
A powerful toolkit for coding, providing semantic retrieval and editing capabilities.
作者的 README
打开 README
按原文从作者的仓库复制。PopNx MCP 没有审查或背书其内容。HTML、图片和脚本已被移除。链接会离开本站。
forthling-mcp
An MCP server that lets AI agents (Claude Code, Claude Desktop and other MCP clients) run Forth in forthling, always in its sandbox. The agent keeps one session: the words it defines and the stacks stay between calls.
Installing
Without Rust, as an MCP bundle: download forthling.mcpb from the latest release and open it in Claude Desktop (or another client that installs .mcpb files). The bundle holds the server for Windows (x64), macOS (Apple Silicon and Intel) and Linux (x64).
From crates.io, with Rust 1.85 or newer:
cargo install forthling-mcp
It builds SQLite along, which takes a C compiler (on Windows that of Visual Studio, which Rust there uses anyway); cargo install forthling-mcp --no-default-features leaves SQLite out. From a clone of the repository: cargo install --path mcp, or cargo build --release --manifest-path mcp/Cargo.toml, and the program is then mcp/target/release/forthling-mcp. With Claude Code:
claude mcp add forthling -- forthling-mcp
Other clients start it the same way: the command forthling-mcp, over stdio.
When a client connects, the server tells the model the basics in its instructions: the idioms that trip models up, locals rather than ROT, PICK and ROLL, the JSON words and the limits. llms.txt says the same at more length, for a model that reads it beforehand; a test keeps the limits in both the same.
Tools
| Tool | Arguments | |
|---|---|---|
forth_eval | code, data, files, trace | runs Forth code; returns the output, the data and float stacks, and the error if there was one |
forth_stack | the stacks, without running anything | |
forth_words | the words defined in this session, the latest first | |
forth_help | word | the stack effect of a word, what it does, an example, and the word list it is in; for a name that is not defined, close names. Words of the session show the ( ) comment after their name |
forth_reset | a new session: every definition, stack value, the data and the files are gone |
A line of code, and so a string in S", is at most 1024 characters. Larger input, such as a JSON document, goes in data: the code reads it with DATA ( -- c-addr u ), which gives a copy in ALLOCATEd memory (FREE it). The data stays for later calls until a call sends other data, and may be at most as large as the Forth memory:
{"name": "forth_eval", "arguments": {"code": "ALSO JSON DATA JSON-LENGTH .", "data": "[[59],[73,41]]"}}
Each session has files of its own, in memory and never on the disk: INCLUDE, REQUIRE, the FILE words and the block words use them, and they stay until forth_reset. files puts files there before the code runs, as an object of names and texts, replacing files of the same name; so an agent can give a library once and INCLUDE it, and what the code writes, a later call can read. The files take at most 4 MiB in all; a write past that fails with the word's ior, and files that do not fit are refused.
{"name": "forth_eval", "arguments": {"code": "INCLUDE square.fs 7 SQUARE .", "files": {"square.fs": ": SQUARE DUP * ;"}}}
Each result is text the way the REPL shows it:
2401 ok
stack: 1 2
and the same as structured JSON (structuredContent, with an outputSchema): {"output": "2401 ", "stack": [1, 2], "fstack": [], "compiling": false, "error": null, "steps": …, "max_depth": …}; steps and max_depth (only for forth_eval) tell how many steps the call took and how deep the data stack went, counting the words of the system it ran (. is written in Forth, so it counts too).
An error empties the stacks, so the result also tells what they held at the error, where it happened and which words were running; the model can put it right in one go:
error -10: division by zero
at input, line 2, column 3: MAIN in: MAIN > STEP > / stack at the error: 5 1 stack: empty
and as JSON: "error": {"code": -10, "message": "division by zero", "stack": [5, 1], "fstack": [], "words": ["MAIN", "STEP", "/"], "source": "input", "line": 2, "column": 3, "token": "MAIN", …}, with isError true. A word that took its arguments before it failed, such as / here, has taken them. An undefined word that is in a word list outside the search order gets a hint, which the text adds after the word: error -13: undefined word: JSON@ (it is in the word list JSON; ALSO JSON finds it).
A runaway program can leave a hundred thousand cells on the stack, or as many words running (endless recursion). The result then keeps the top 32 cells and the innermost 32 words, the text says ... (n more) and the JSON has the full depth in stack_depth, fstack_depth and words_depth. A definition that is still open (compiling true) says so in the text: compiled (a definition is still open; ; ends it).
When the code ran T{ ... -> ... }T tests (ALSO TESTING), the result also has the counts of that call, and the text starts with tests: 1 passed, 1 failed. The failure lines (FAIL input:3 (sums): incorrect result: expected <1> 3, got <1> 2) are in the output. In JSON: "tests": {"passed": 1, "failed": 1, "failures": [{"source": "input", "line": 3, "group": "sums", "expected": [3], "expected_depth": 1, "actual": [2], "actual_depth": 1, "stack": [], "expected_floats": [], "expected_floats_depth": 0, "actual_floats": [], "actual_floats_depth": 0}], "failures_dropped": 0}. The first 32 failures are kept, and each list keeps its top 32 cells and floats (the depths tell how many there were). A file given with files shows its name as source.
What an agent sees for typical mistakes
Each case was run through forth_eval (#47); the answer is the first lines of the text. The code was run from a fresh session.
| Mistake | Code | Answer |
|---|---|---|
| undefined word | 1 2 FOO . | error -13: undefined word: FOO, the column, the stack at the error 1 2 |
| word in a word list not in the search order | S" :memory:" DB-OPEN | error -13: undefined word: DB-OPEN (it is in the word list SQLITE; ALSO SQLITE finds it) |
| undefined word in a definition | : sq DUPP * ; | error -13: undefined word: DUPP, at its column |
| stack underflow | : add2 + ; 1 add2 | error -4: stack underflow, in: ADD2 > +, the stack at the error |
| word that eats too much | : f ( n -- ) DROP ; f | error -4, in: F > DROP |
IF, DO, BEGIN outside a definition | 1 IF 2 THEN | error -14: interpreting a compile-only word: IF |
unclosed IF | : foo 1 IF 2 ; | error -22: control structure mismatch, at the ; |
LOOP without DO | : f LOOP ; | error -22: control structure mismatch |
| unclosed definition | : foo 1 2 + | compiled (a definition is still open; ; ends it) |
| division by zero | 1 0 / | error -10: division by zero, in: /, stack at the error empty (/ took its arguments) |
| bad address | 12345678 @ | error -9: invalid memory address: 12345678 |
| step limit | : spin BEGIN 1 DROP AGAIN ; spin | error -258: limit exceeded: steps, in: SPIN > DROP |
| output limit | : p BEGIN 65 EMIT AGAIN ; p | the output up to the limit, then error -258: limit exceeded: output |
| endless stack growth | : grow BEGIN 1 AGAIN ; grow | error -3: stack overflow, the top 32 cells and ... (n more) |
| endless recursion | : r RECURSE ; r | error -5: return stack overflow, the innermost 32 words |
| missing file | S" nofile.fth" INCLUDED | error -38: non-existent file: nofile.fth: no such file |
error inside EVALUATE | S" 1 2 FOO" EVALUATE | at evaluate, line 1, column 5: FOO, stack 1 2 |
| line over 1024 characters | S" xxxx…" TYPE | error -18: parsed string overflow: input line too long |
ABORT" | : chk 0= ABORT" zero" ; 0 chk | error -2: aborted: zero |
CATCH | : t 1 0 / ; : u ['] t CATCH . ; u | prints -10, no error result |
What gives no error, and so no message: an unclosed S" or ( takes the rest of the line (as the standard says); : f >R ; leaves the return stack unbalanced and 1 f returns without a word; ALLOCATE of a negative size and FREE twice answer with a non-zero ior on the stack (-59, -60), and so does a failed DB-EXEC (-261); a JSON path that is not there gives 0 0 0. These follow the standard or the word's stack effect; the agent must read the stack.
With "trace": true, forth_eval also returns a trace: each word that ran, with how deep it was nested and the data stack when it started (at most its top 8 cells), at most 1000 words; trace_dropped counts the rest. The insides of the system's own words are left out. The text starts with it, indented the way TRACE-ON prints it:
trace:
F <0> SQ <1> 3 DUP <1> 3
- <2> 3 3 1+ <1> 9
. <1> 10 end of trace 10 ok stack: empty
and the JSON has "trace": [{"word": "F", "depth": 0, "stack": [], "stack_depth": 0}, {"word": "SQ", "depth": 1, "stack": [3], "stack_depth": 1}, …], "trace_dropped": 0. The trace of a call that fails shows how it got to the error. In the code itself, ALSO DEBUG TRACE-ON … TRACE-OFF prints the same lines as output.
BREAK (also ALSO DEBUG) marks a place to look at. It does not stop the program, since no one could answer in the middle of a call; instead the result has breaks, what the program looked like at each BREAK (at most 100; breaks_dropped counts the rest), with the same fields as an error: stack, fstack, words, source, line, column and token. The text starts with a line for each:
break 1: in F > BREAK, at input, line 1, column 3: stack <2> 7 9
ALSO TUTORIAL gives the tutorial: 20 lessons of Forth, ten for beginners and ten beyond, that an agent can walk a person through (LESSONS, n LESSON, CHECK tests the answer, HINT, NEXT).
The JSON words are installed (ALSO JSON), and the SQLite words for databases in memory (ALSO SQLITE, only :memory:, which SQL stops when the time is up and which cannot grow larger than the Forth memory) and the regular expression words (ALSO REGEX, which match in linear time); without the Cargo features sqlite and regex (--no-default-features) the server is built without them.
The HTTP words (ALSO HTTP, see http/README.md) are a third feature, http, which is off by default because it reaches the network. Build the server with it (cargo install forthling-mcp --features http) and start it with the hosts that Forth code may send requests to, once for each host: forthling-mcp --allow-host api.example.com (*.example.com and * also work). Without --allow-host the network stays closed and the model is not told about the words. It is the only option that opens something outside the sandbox, and only for the hosts you name; a Forth word cannot add one.
The sandbox
Every session runs in forthling's sandbox: files only in memory, and each call at most 10 million steps, 5 seconds and 1 MiB of output; the session's definitions and the like at most 4 MiB in all. The options change these limits, each up to a ceiling the program fixes:
-m, --memory SIZE Forth memory (default 1M) [64M]
--max-steps N steps per call (default 10000000) [1000000000] --max-time T time per call, such as 5s or 500ms (default 5s) [60s] --max-output SIZE output per call (default 1M) [16M] --max-space SIZE definitions and the like in all (default 4M) [64M] --allow-host HOST a host that Forth code may send HTTP requests to (repeat)
There is no option to switch the sandbox off or to permit files, so changing how the server is started does not open them either. Only --allow-host opens the network, for the hosts it na