From owner-cvs-all@FreeBSD.ORG Mon Jan 4 03:24:25 2010 Return-Path: Delivered-To: cvs-all@FreeBSD.org Received: from mx1.freebsd.org (mx1.freebsd.org [IPv6:2001:4f8:fff6::34]) by hub.freebsd.org (Postfix) with ESMTP id 62D2C106566B; Mon, 4 Jan 2010 03:24:25 +0000 (UTC) (envelope-from pgj@FreeBSD.org) Received: from repoman.freebsd.org (repoman.freebsd.org [IPv6:2001:4f8:fff6::29]) by mx1.freebsd.org (Postfix) with ESMTP id 5271F8FC0C; Mon, 4 Jan 2010 03:24:25 +0000 (UTC) Received: from repoman.freebsd.org (localhost [127.0.0.1]) by repoman.freebsd.org (8.14.3/8.14.3) with ESMTP id o043OP2m090024; Mon, 4 Jan 2010 03:24:25 GMT (envelope-from pgj@repoman.freebsd.org) Received: (from pgj@localhost) by repoman.freebsd.org (8.14.3/8.14.3/Submit) id o043OPg7090023; Mon, 4 Jan 2010 03:24:25 GMT (envelope-from pgj) Message-Id: <201001040324.o043OPg7090023@repoman.freebsd.org> From: Gabor Pali Date: Mon, 4 Jan 2010 03:24:25 +0000 (UTC) To: ports-committers@FreeBSD.org, cvs-ports@FreeBSD.org, cvs-all@FreeBSD.org X-FreeBSD-CVS-Branch: HEAD Cc: Subject: cvs commit: ports/math Makefile ports/math/hs-Agda Makefile distinfo pkg-descr pkg-message pkg-plist X-BeenThere: cvs-all@freebsd.org X-Mailman-Version: 2.1.5 Precedence: list List-Id: **OBSOLETE** CVS commit messages for the entire tree List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 04 Jan 2010 03:24:25 -0000 pgj 2010-01-04 03:24:25 UTC FreeBSD ports repository Modified files: math Makefile Added files: math/hs-Agda Makefile distinfo pkg-descr pkg-message pkg-plist Log: 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 Revision Changes Path 1.625 +1 -0 ports/math/Makefile 1.1 +109 -0 ports/math/hs-Agda/Makefile (new) 1.1 +3 -0 ports/math/hs-Agda/distinfo (new) 1.1 +13 -0 ports/math/hs-Agda/pkg-descr (new) 1.1 +9 -0 ports/math/hs-Agda/pkg-message (new) 1.1 +217 -0 ports/math/hs-Agda/pkg-plist (new)