| non port: math/hs-Agda/pkg-plist |
|
SVNWeb
|
Number of commits found: 9 |
|
Mon, 15 Aug 2022
|
[ 13:07 Gleb Popov (arrowd)  ]    a04537df
math/hs-Agda: Unbreak and enable compiling emacs mode files.
|
|
Fri, 22 Oct 2021
|
[ 14:25 Gleb Popov (arrowd) Author: Alexis Praga ] f4a961f
math/hs-Agda: Update to 2.6.2
|
|
Wed, 19 Aug 2020
|
[ 12:27 arrowd ]  
math/hs-Agda: Do not compile Emacs mode files, because they are incompatible
with our new Emacs.
|
|
Wed, 6 May 2020
|
[ 20:31 arrowd ]
math/hs-Agda: Install emacs mode files.
PR: 246254
|
|
Mon, 4 May 2020
|
[ 18:08 arrowd ] (Only the first 10 of 166 ports in this commit are shown above.  )
Upgrade lang/ghc to 8.8.3 and many Haskell ports along the way.
PR: 244784
Submitted by: Evilham <contact@evilham.com> (some ports)
|
|
Thu, 13 Jun 2019
|
[ 18:51 arrowd ]
math/hs-Agda: Update to latest version and unbreak.
Approved by: tcberner (mentor, implicit)
|
|
Mon, 9 May 2011
|
[ 05:28 ashish ] (Only the first 10 of 460 ports in this commit are shown above. )
- Please welcome GHC 7.0.3
GHC in the ports tree has been updated to 7.0.3 and all other Haskell ports
are also updated to their corresponding Haskell Platform versions, or latest
versions.
We would like to acknowledge the support of the FreeBSD Donations Team and
Eotvos Lorand University, Faculty of Informatics who contributed to the server
that we used for testing.
We would also like to thank all the testers who tested FreeBSD Haskell ports
and provided their feedback.
PR: ports/156642
Approved by: tabthorpe (mentor)
Obtained from: FreeBSD Haskell
|
|
Wed, 12 May 2010
|
[ 16:33 pgj ] (Only the first 10 of 214 ports in this commit are shown above. )
Introduce a new (and hopefully better) ports infrastructure for Haskell Cabal
ports which makes possible the direct translation of Cabal package
descriptions to FreeBSD ports. It promises both easier addition and
maintenance for Cabal-based ports.
|
|
Mon, 4 Jan 2010
|
[ 03:24 pgj ]
Agda is a dependently typed functional programming language: It has inductive
families, which are similar to Haskell's GADTs, but they can be indexed by
values and not just types. It also has parameterised modules, mixfix operators,
Unicode characters, and an interactive Emacs interface (the type checker can
assist in the development of your code).
Agda is also a proof assistant: It is an interactive system for writing and
checking proofs. Agda is based on intuitionistic type theory, a foundational
system for constructive mathematics developed by the Swedish logician Per
Martin-Lof. It has many similarities with other proof assistants based on
dependent types, such as Coq, Epigram and NuPRL.
WWW: http://wiki.portal.chalmers.se/agda/
PR: ports/142141
Submitted by: Jacula Modyun <jacula(at)gmail.com>
|
Number of commits found: 9 |
As an Amazon Associate I earn from qualifying purchases.