---
- branch: MAIN
  date: Thu Apr 14 17:29:11 UTC 2022
  files:
  - new: '1.645'
    old: '1.644'
    path: pkgsrc/lang/Makefile
    pathrev: pkgsrc/lang/Makefile@1.645
    type: modified
  - new: '1.1'
    old: '0'
    path: pkgsrc/lang/ats2/DESCR
    pathrev: pkgsrc/lang/ats2/DESCR@1.1
    type: added
  - new: '1.1'
    old: '0'
    path: pkgsrc/lang/ats2/Makefile
    pathrev: pkgsrc/lang/ats2/Makefile@1.1
    type: added
  - new: '1.1'
    old: '0'
    path: pkgsrc/lang/ats2/PLIST
    pathrev: pkgsrc/lang/ats2/PLIST@1.1
    type: added
  - new: '1.1'
    old: '0'
    path: pkgsrc/lang/ats2/distinfo
    pathrev: pkgsrc/lang/ats2/distinfo@1.1
    type: added
  - new: '1.1'
    old: '0'
    path: pkgsrc/lang/ats2/patches/patch-Makefile
    pathrev: pkgsrc/lang/ats2/patches/patch-Makefile@1.1
    type: added
  id: 20220414T172911Z.55bb2a159cf99432bd4c048edbb212ff80459fcb
  log: |
    lang/ats2: Add version 0.4.2

    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.
  module: pkgsrc
  subject: 'CVS commit: pkgsrc/lang'
  unixtime: '1649957351'
  user: nikita