I've always stuck to the definition of a closed lambda term (the Y, U, S,
K, etc... combinators, for example). The colloquial usage generally implies
something like a higher order function that does something interesting
(and possibly DSL-y).
Kris
On Sat, Aug 24, 2013 at 12:09 AM, damodar
Knowing whether a computation will terminate is in general the halting
problem, so immediately you're looking at a syntactic restriction.
Here the only ones I can think of are artificial at best (i.e., they
don't work for examples more than what you've shown here):
I'm also interested in seeing this.
Have you ported the Haskell runtime to Android? It seems like this should
be able to be done, and through the JNI it seems like you should be able to
get the system API (albeit, ugly).
However, I'd be really happy to see this setup if you were willing to put
wrong. I have seen people that write apps in native /
managed code integrating in a reasonable way, but it's very ugly afaik.
Kris
On Tue, May 28, 2013 at 9:35 AM, Kristopher Micinski krismicin...@gmail.com
wrote:
I'm also interested in seeing this.
Have you ported the Haskell runtime
more
idiomatic Haskell GUI libraries for Android on top of the API bindings.
On 2013-05-28 15:37, Kristopher Micinski wrote:
I guess you can't really go from native - framework code like this, so
this would really make sense only for native methods that are self
contained. Is this right
Marcos,
Great to see you've revised a copy of this. I've often felt that push
communication to devices has a very continuation-y flavor, and I think
having something in a web framework to express this would be great.
It looks like a large part of your time may be spent developing demo
apps,
I'm not sure if I understand what you want to do.. Am I correct in
thinking that you are looking to provide a Haskell API to interface
with these push notification services, so that (e.g.,) a Yesod app
could send push notifications to a mobile device?
I have a good amount of experience working
I second that advice! I can technically read Spanish, but I find the
complexity of the language barrier compounded with trying to
understand the code becomes more confusing than I'd prefer :-).
Kris
On Sun, Apr 28, 2013 at 2:19 PM, Mateusz Kowalczyk
fuuze...@fuuzetsu.co.uk wrote:
-BEGIN
On Mon, Apr 29, 2013 at 4:46 PM, Marcos Pividori
marcospivid...@gmail.com wrote:
Hi, thanks for your response! this really help me.
* About the code in Spanish: I will replace it for an English version in the
next weeks. As Michael said, I had to write it in Spanish because it was a
project
This looks right, but there is definitely a lot more to mapreduce
implementations than algebraic signatures!
It might also be considered that there are lots of people using
MapReduce technology on things other than bare metal
Hadoop/MapReduce, etc.. Lots of data analysts, ML people, etc.., use
I disagree about the recommendation for Modern Compiler Design: I
found it to be a pretty good introduction to compiler technology, but
not functional programming with compilers, it's coverage was *very*
shallow.
By contrast, I can recommend both Compiling with Continuations (the
standard text on
://www.amazon.com/Compilers-Principles-Techniques-Tools-Edition/dp/0321486811
but know that it has next to nothing useful specific to FP languages,
and certainly not lazy languages.
Tommy
On Apr 7, 2013, at 07:40 , Kristopher Micinski krismicin...@gmail.com wrote:
I disagree about the recommendation
On Mon, Apr 1, 2013 at 11:00 PM, Conal Elliott co...@conal.net wrote:
...
For details, see Jeremy Gibbons's paper Calculating functional programs.
There are probably easier sources as well.
Apologies for the tangential chiming in: on the topic of easier
sources you can also look at a few other
The problem with all of these suggestions is that they start from no code.
I believe Brent is looking for an *existing* project which needs
contributions. I assume so that beginning Haskellers can learn real code
style in the middle to large, and get input from existing community members.
Kris
through the JNI to use the Java version.
Can you point to a native library which allows you to hook in to the
Android SDK? I'd be very interested in seeing it.
Kris
On Wed, Jan 23, 2013 at 10:54 AM, Brandon Allbery allber...@gmail.com wrote:
On Tue, Jan 22, 2013 at 8:37 PM, Kristopher Micinski
a bit premature.
Kris
On Wed, Jan 23, 2013 at 1:48 PM, Kristopher Micinski
krismicin...@gmail.com wrote:
In what way are they exposed for use? I certainly haven't seen any
API which lets you touch any of the standard GUI utilities without
writing JNI wrappers that communicate to the Java based
I don't believe that was really the point of the C compiler, and I'd
suspect you'd have a hard time with the runtime.
By the way, the Android APIs aren't really meant to be used by native
code: the only real use for native code in Android is GPU code and
math code (think games and DSP-type
code that doesn't need
itself to compile, I can work on a Haiku version as practice. I really want
GHC for every possible system.
On Nov 10, 2012 5:49 PM, Kristopher Micinski krismicin...@gmail.com
wrote:
On Sat, Nov 10, 2012 at 3:50 PM, Casey Basichis caseybasic...@gmail.com
wrote:
Hi
Pennebaker
andrew.penneba...@gmail.com wrote:
Awesome! Jeffrey Scofield has ported OCaml to iOS, so there's also
experience there.
On Fri, Nov 9, 2012 at 11:46 PM, Kristopher Micinski
krismicin...@gmail.com wrote:
If you have interest in doing this, I have quite a bit of experience
On Sat, Nov 10, 2012 at 9:21 AM, Casey Basichis caseybasic...@gmail.com wrote:
As for you notion of hard truth, and dumb apps acting as web front ends
its pretty blase to assume that anyone interested in this thread will share
that perspective in terms of their own goals on these platforms. I
On Sat, Nov 10, 2012 at 3:50 PM, Casey Basichis caseybasic...@gmail.com wrote:
Hi Kris,
No offense taken, it was an argument that works to shut down constructive
discussion of how to get Haskell running on mobile, a task which has
perplexed me for several long days. I agree most apps are
If you have interest in doing this, I have quite a bit of experience
in Android hacking at the system level and above and would be glad to
talk about what might need to happen. (Though I don't know the GHC
internals / toolchain so well.)
One potential choice is Scala, though from my limited
Hello Haskellers!
I wonder if you know of benchmarks that attempt to compare,
empirically, lazy vs. eager evaluation. Pointers to papers and/or
code would be most appreciated.
Our group (at UMD) is working on a paper that develops some technology
for lazy programs, and we would like to choose
On Thu, Oct 25, 2012 at 4:57 PM, Gregg Lebovitz gr...@fpcomplete.com wrote:
I am trying to get a learning center started in the Haskell community. As
pointed out below, MOOCs are hard to put together, however training and
videos straight forward. There is a lot of teaching material available in
On Sun, Oct 14, 2012 at 1:37 PM, Bartosz Milewski
bart...@fpcomplete.com wrote:
I'm afraid this kind of 5-minute talk makes sense only if you already know a
lot about monads or are a computer scientist; not if you're a programmer who
wants to learn a new language. For instance, this statement
On Wed, Oct 10, 2012 at 6:48 AM, Anupam Jain ajn...@gmail.com wrote:
I used the excellent A No-Frills Introduction to Lua 5.1 VM
Instructions
(http://scholar.google.com/scholar?cluster=14039839166840129336).
Highly recommended to get a quick overview of the entire bytecode format.
FYI this
Oh, this is nice, we have our undergrads implement a compiler to Lua
bytecode as part of their term projects, and currently use a homebrew
OCaml package. This seems to be pretty complete, however, and it
would be interesting for me to reimplement some stuff with this..
Unfortunately the Lua
On Thu, Oct 4, 2012 at 1:21 PM, Stephen Tetley stephen.tet...@gmail.com wrote:
On 4 October 2012 18:04, Kim-Ee Yeoh k...@atamo.com wrote:
Something to consider is that it's not so much whether the material is
basic, advanced, or intermediate; it's that the way it's being presented is
boring
On Sun, Sep 30, 2012 at 6:33 PM, Jake McArthur jake.mcart...@gmail.com wrote:
On Sep 30, 2012 10:56 AM, Albert Y. C. Lai tre...@vex.net wrote:
On 12-09-29 09:57 PM, Vasili I. Galchin wrote:
I would an examples of monads that are pure, i.e. no
side-effects.
What does side effect
You have fallen into the misconception that monads are impure, they are not.
Many monad tutorials begin (erroneously) with the lines monads allow
you to do impure programming in Haskell.
This is false, monads are pure, it's IO that's impure, not the monadic
programming style. Monads let you
Jose,
So I'm interested to hear you opinion on this as well...
I use Pandoc with Markdown through Hakyll, which allows you to do a
fair amount of cute things that are just really helpful for
maintaining a blog (for example..). But I didn't get this from
reading your github readme: what makes
...@informatik.uni-marburg.de wrote:
Hi,
Kristopher Micinski wrote:
Everyone in the Haskell cafe probably has a secret dream to give the
best five minute monad talk.
(1) Most programming languages support side effects. There are different
kinds of side effects such as accessing mutable
...@informatik.uni-marburg.de wrote:
Hi,
Kristopher Micinski wrote:
Everyone in the Haskell cafe probably has a secret dream to give the
best five minute monad talk.
(1) Most programming languages support side effects. There are different
kinds of side effects such as accessing mutable
On Fri, Sep 14, 2012 at 10:13 PM, Andrew Pennebaker
andrew.penneba...@gmail.com wrote:
Challenge: get someone to have a competition at one of the conferences
where students all give their
best five minute monad talk and try to find the most comprehensible one!
Challenge accepted.
Great!
On Fri, Sep 14, 2012 at 10:08 PM, Joel Burget joelbur...@gmail.com wrote:
[snip]
Also, Maybe and Either are not implemented as monads. They are defined
using `data` like you suggest:
data Maybe a = Nothing | Just a
data Either a b = Left a | Right b
That's not my point, or my objection.
On Fri, Sep 14, 2012 at 8:23 PM, Andrew Pennebaker
andrew.penneba...@gmail.com wrote:
[snip..]
Does anyone know of a brief introductory Haskell tutorial that engages
monads? LYAH covers monads, but it does so after a few chapters of simpler,
pure function Haskell coding. I know of some brief
I believe these are the effect of linkedin harvesting your email contacts,
and then a blanket invite all link that you can click. Whether it's
linkedin who's spamming, or the person who forgot to uncheck certain
mailing lists, that's more of a moral debate..
kris
On Wed, Sep 12, 2012 at 2:21
On Thu, Sep 6, 2012 at 8:04 AM, Amy de Buitléir a...@nualeargais.ie wrote:
Paul Visschers mail at paulvisschers.net writes:
Looks nice. Does it scale well to millions of elements, and can it handle 3D?
The current implementation wouldn't scale well to millions of elements, but it
shouldn't
Your post feels similar to another one posted recently...
http://web.jaguarpaw.co.uk/~tom/blog/2012/09/02/what-is-a-monad-really.html
just fyi, :-),
kris
On Tue, Sep 4, 2012 at 6:39 AM, Alberto G. Corona agocor...@gmail.com wrote:
Monads are monoids in the category of endofunctors
This
On Sun, Sep 2, 2012 at 12:06 PM, Alexander Solla alex.so...@gmail.com wrote:
On Sun, Sep 2, 2012 at 9:40 AM, timothyho...@seznam.cz wrote:
The thing is, that one ALWAYS wants to create a union of types, and not
merely an ad-hock list of data declarations. So why does it take more code
to
On Thu, Aug 30, 2012 at 11:21 PM, damodar kulkarni
kdamodar2...@gmail.com wrote:
Hi Cafe,
It seems, the function names in Haskell libs are not first-class objects, AT
LEAST when it comes to searching for them of the net!
I was trying to search for the following Haskell functions in the mailing
On Thu, Aug 23, 2012 at 12:23 PM, Ramana Kumar
ramana.ku...@cl.cam.ac.uk wrote:
Dear Haskell Cafe
I'm looking for information on past and current attempts to write semantics
for Haskell.
Features I'm particularly interested in are:
formal
mechanised
maintainable
up to date
Of course,
On Sat, Aug 25, 2012 at 9:33 AM, Gershom Bazerman gersh...@gmail.com wrote:
On 8/25/12 6:48 AM, Kristopher Micinski wrote:
Thus, you typically want to think about the semantics of core
Haskell, in which you might try understanding the semantics of the
STG machine.
Along those lines
I do not know Haskell. It looks to me as though there are
several pieces of the mechanism:
1. There is, once the extensions are specified, a particular Type
System, that is, a formal system with, on the syntactic side, at
least, assumptions, judgements, rules of inference, terms lying
in
On Sat, Aug 25, 2012 at 3:38 PM, Jay Sulzberger j...@panix.com wrote:
This is good. I will look at the references given in this
thread. The account at
http://web.archive.org/web/20060206074101/http://www.cse.ogi.edu/~mpj/thih/TypingHaskellInHaskell.html
is, I think, one part of what I was
45 matches
Mail list logo
