I recently ‘discovered’ (thanks to a tweet from @dkvansnickajr) the snapshot
builds for ARM6 built on Raspbian.
Previously I’d been recommending people try out Racket on RasPi via the
source+built packages route, but realise they might baulk at the build times
and this other route seems very at
Would an fxvector of length 5 (to account for the tag bits) work?
If all you're doing is bitwise ops and comparisons, it should be easy to
convince TR that you're staying within fixnum range.
Vincent
At Thu, 4 Sep 2014 10:45:48 -0700,
John Clements wrote:
>
> [1 ]
> [1.1 ]
> I want to repr
Although I haven't tried data/bit-vector in Typed Racket, could you do
something like the following?
#lang typed/racket
(require/typed data/bit-vector
[#:opaque BitVector bit-vector?]
[make-bit-vector (-> Index BitVector)]
... TO-DO ...)
(define bv (make-bit-vector 125))
On Thu, Sep 4, 2
I want to represent a bitfield of 125 bits, using typed racket. I’ll be
combining them using bitwise operations, and checking for zero-ness. I
think that’s about it.
I could just use type Integer, but it seems like that would impose
additional checking, since the type system doesn’t know the size.
A candidate for a solution. (I'm not sure I'm correct regarding the
function project. The description says "a lists of lists" (which I
translate to (listof ITEM)) and "a function from lists to Xs", so I
wonder if the domain of this function-argument must be (listof ITEM)
or it could be more general
**
CALL FOR PAPERS: ETAPS 2015
18th European Joint Conferences on Theory And Practice of Software
London, UK, 11-18 April 2015
http://www.etaps.org/2015
6 matches
Mail list logo
