mirror/freebsd-ports
1
0
Fork 0
mirror of https://git.FreeBSD.org/ports.git synced 2024-11-20 00:21:35 +00:00
Code Issues Releases Activity

UUAG is the Utrecht University Attribute Grammar system. It generates Haskell

Browse Source 
files from an attribute grammar specification.

It is a preprocessor for Haskell which makes it easy to write catamorphisms
(that is, functions that do to any datatype what foldr does to lists).
You can define tree walks using the intuitive concepts of inherited and
synthesized attributes, while keeping the full expressive power of Haskell.

WWW:	http://www.cs.uu.nl/wiki/HUT/AttributeGrammarSystem

Obtained from:	FreeBSD Haskell
This commit is contained in:
Gabor Pali 2012-02-13 02:27:03 +00:00
parent 05eb37c0da
commit d34e6b1c3a
Notes: svn2git 2021-03-31 03:12:20 +00:00 
svn path=/head/; revision=291119
4 changed files with 35 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
devel/hs-uuagc-bootstrap/Makefile Normal file
View File

@ -0,0 +1,23 @@
# New ports collection makefile for: hs-uuagc-bootstrap
# Date created: August 12, 2011
# Whom: haskell@FreeBSD.org
#
# $FreeBSD$
#
PORTNAME= uuagc-bootstrap
PORTVERSION= 0.9.40.2
CATEGORIES= devel haskell
MAINTAINER= haskell@FreeBSD.org
COMMENT= Attribute Grammar System of Universiteit Utrecht
LICENSE= BSD
CABAL_SETUP= Setup.hs
USE_CABAL= haskell-src-exts>=1.11.1 mtl>=1.1.1.1 uulib>=0.9.14
EXECUTABLE= uuagc-bootstrap
.include "${.CURDIR}/../../lang/ghc/bsd.cabal.mk"
.include <bsd.port.mk>

2
devel/hs-uuagc-bootstrap/distinfo Normal file
View File

@ -0,0 +1,2 @@
SHA256 (cabal/uuagc-bootstrap-0.9.40.2.tar.gz) = b83bcb9466026f1edaa396fd28efadff373066bb50a471a546fef42ffe454b7f
SIZE (cabal/uuagc-bootstrap-0.9.40.2.tar.gz) = 405302

9
devel/hs-uuagc-bootstrap/pkg-descr Normal file
View File

@ -0,0 +1,9 @@
UUAG is the Utrecht University Attribute Grammar system. It generates Haskell
files from an attribute grammar specification.
It is a preprocessor for Haskell which makes it easy to write catamorphisms
(that is, functions that do to any datatype what foldr does to lists).
You can define tree walks using the intuitive concepts of inherited and
synthesized attributes, while keeping the full expressive power of Haskell.
WWW: http://www.cs.uu.nl/wiki/HUT/AttributeGrammarSystem

1
lang/ghc/bsd.hackage.mk
View File

@ -206,6 +206,7 @@ url_port= www/hs-url
utf8-string_port= devel/hs-utf8-string
utility-ht_port= devel/hs-utility-ht
uuagc_port= devel/hs-uuagc # executable
uuagc-bootstrap_port= devel/hs-uuagc-bootstrap # executable
uulib_port= devel/hs-uulib
vector_port= devel/hs-vector
vector-algorithms_port= devel/hs-vector-algorithms