Re:Irken Language – A Scheme with parametric polymorphism
by bunderbunder on Tuesday August 05, 2014 @09:29PM
(#8140491)
In a way, it really seems more like a dialect of ML with Scheme-like syntax. It's not just the monomorphic lists, it's also the algebraic data types and pattern matching.
Re:Irken Language – A Scheme with parametric polymorphism
by wtetzner on Wednesday August 06, 2014 @07:54AM
(#8141999)
If you want a typed Scheme that you can still write the way you write Scheme, take a look at Typed Racket.
Re:Irken Language – A Scheme with parametric polymorphism
by bachmeier on Wednesday August 06, 2014 @09:36PM
(#8145864)
I may look at it again. The last time I did so, the documentation was a bit uneven, which is something I've found to be true about Racket more generally (particularly the extensions).
Re:Irken Language – A Scheme with parametric polymorphism
by klibertp on Wednesday August 06, 2014 @07:19AM
(#8141916)
I wonder if something like this would be possible:
(list (:myint 1) (:mystring "two") (:mysymbol 'three))
?
> Expressions like '(1 "two" three) will not pass the type checker. All lists must be monomorphic, i.e., a list of ints, or a list of bools, etc...
seems to me to be such a big change as to mean it's not Scheme.
Don't get me wrong, I love the idea of statically-typed Scheme, and will look carefully at it. I just think it's odd to claim it's Scheme.