ENC: Call for Papers - SBLP 2008 (12th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES)

12th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES http://www.lia.ufc.br/sblp2008 Fortaleza, Ceara, Brazil August 27-29, 2008 CALL FOR PAPERS AND TUT

Re: Type Families and enhanced constraints (at run-time)

Whenever you want to maintain type-level assertions of properties of you functions, you need to decide *how much* of the value-level information do you need on the type level to express and check the properties that you are interested in. My SNat example was at one extreme end of the spect

Type Families and enhanced constraints (at run-time)

Hi, I hope this is the right place to ask about working with type families...I want to make a library of Set operations that carries proofs at the type level, e.g. to make things like this possible, > insert :: Member e s' T => e -> Set s -> Set s' > union :: Union s t u => Set s -> Set t -> Set

GHC porting to FreeBSD-amd64 progress report

In my effort to produce a working FreeBSD-amd64 compiler I made some progress. Now I have a working stage1/ghc-inplace (which is a 32bit executable producing 64bit code). But the compilation of rts fails in file Apply.cmm with the following message: == gmake all -r; in /.amd_mnt/vestein/host/usr/

Re: GHC's CPP and Cabal's unlit

On Wed, 2007-11-28 at 22:37 +, Alistair Bayley wrote: > > More puzzling is that the files that Cabal runs through ghc's CPP > > don't get the # n lines, so we end up with something like this: > > (Answering my own message) > > Having done some more testing with ghc-6.8.1 and ghc-6.6.1 and cab