TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

TLA⁺ is more than a DSL for breadth-first search

9 点作者 ahelwer8 个月前

1 comment

bugarela8 个月前
Quint [1] is a specification language heavily based on TLA+ but without the mathy syntax people have issues with, and without inheriting the tool problems of a language that was never designed to be &quot;code&quot; (i.e. Quint has types and good IDE support).<p>Quint also has the concept of a run, where users can guide the &quot;searcher&quot; to a specific set of executions, so it works really well as a BF&#x2F;DF* searcher, which is it&#x27;s focus (it doesn&#x27;t support refinement or proofs, at least for now).<p>So yeah, if you are curious for a language that supersedes TLA+, you should definitely give Quint a try :)<p>* BF through model checking, DF through bounded random simulation<p>[1]: <a href="https:&#x2F;&#x2F;quint-lang.org&#x2F;" rel="nofollow">https:&#x2F;&#x2F;quint-lang.org&#x2F;</a>
评论 #41587568 未加载