209229f140
Import from wip/ats2 by Atsushi Toyokura, Mateusz Poszwa. ATS is a statically typed programming language that unifies implementation with formal specification. It is equipped with a highly expressive type system rooted in the framework Applied Type System, which gives the language its name. In particular, both dependent types and linear types are available in ATS. In addition, ATS contains a subsystem ATS/LF that supports a form of (interactive) theorem-proving, where proofs are constructed as total functions. With this subsystem, ATS is able to advocate a programmer-centric approach to program verification that combines programming with theorem-proving in a syntactically intertwined manner. Furthermore, ATS/LF can also serve as a logical framework (LF) for encoding various formal systems (such as logic systems and type systems) together with proofs of their (meta-)properties.
6 lines
435 B
Text
6 lines
435 B
Text
$NetBSD: distinfo,v 1.1 2022/04/14 17:29:10 nikita Exp $
|
|
|
|
BLAKE2s (ATS2-Postiats-0.4.2.tgz) = 12c4fab8256534f03139c3276c1a2376d4d4dc2101e106d763da5fc0082240d6
|
|
SHA512 (ATS2-Postiats-0.4.2.tgz) = 10d00e53105edb4c471d3f3b0c437a12e5a7a596b69c423976ea81887aa7e2baf22aa7860e9a73fb45873ff2e439c2e3644e8126bff9997c35d2d01c2d923a23
|
|
Size (ATS2-Postiats-0.4.2.tgz) = 4530964 bytes
|
|
SHA1 (patch-Makefile) = 6695c27284c2e5f765439f0d2b77c3bda3c2a5ed
|