Description:
Polymorphically-typed lazy purely-functional programming.
|
|
|
Reasoning with quantified expressions in predicate calculus
|
| |
In order to prove software to be correct, predicate calculus with
quantified expressions (for all, exists) is indispensable. The
programming language Modern Eiffel has all possibilities to do
predicate calculus.
The article
[link]
describes how reasoning with quantified expressions is done in Modern... more »
|
|
|
Can Haskell compare functions?
|
| |
I have no idea how dumb this question might be. I just know the
language is "functional," and the type system is "advanced," so I
figured an "advanced enough" type system would know all the inputs/
outputs of a function to such a degree that it could determine if
functions were equivalent.
*Main> (\x -> x*0) == (\x -> 0)... more »
|
|
|
sell me on strong typing, type safety, etc.
|
| |
hello all.
i have always coded in what i will loosely call "dynamic" languages
where i didn't have to worry about type. i have built large, complex
systems with such languages. nothing ever "blew up." any bugs were
always relatively minor, relatively easy to find and fix, etc. the
systems i have built have always been successful.... more »
|
|
|
bang patterns and deepseq
|
| |
Greetings,
I am trying to understand how strictness works in Haskell. Here is
the story, along with a description of where it unravels.
I want to define a function that computes the nth and n+1st Fibonacci
number. There will be recursive calls made.
fib n =
...
(a,b) = fib k
...... more »
|
|
|
Reasoning with inductive types
|
| |
Modern Eiffel is a new language which is syntactically based on Eiffel
but has a lot of concepts of functional languages like Haskell, OCaml
or Coq. Modern Eiffel puts the emphasis on static verification, i.e. a
compiler can statically check that a programm written in Modern Eiffel
meets its specification.... more »
|
|
|
arrays instead of lists
|
| |
hello
how much more efficient is it to use (one-dimensional) arrays instead
of (long) lists? could it conceiveably make the difference between a
script that overflows the stack and one that doesn't? thanks if you
can help
peace
stm
|
|
|
CUFP 2012: Call for Presentations
|
| |
COMMERCIAL USERS OF FUNCTIONAL PROGRAMMING 2012
CUFP 2012
CALL FOR PRESENTATIONS
Copenhagen, Denmark
Sep 13-15
Co-located with ICFP 2012
Sponsored by SIGPLAN
Talk Proposal Submission Deadline 29 June 2012
The annual CUFP workshop is a place where people can see how others... more »
|
|
|
how to install haskell web frameworks
|
| |
Hi,
As a Haskell learner, I want to experiment with Haskell web
frameworks. I've tried to install Happstack, Yesod and Snap from cabal
but got some errors.
First, my setup:
The Glorious Glasgow Haskell Compilation System, version 7.0.4
cabal-install version 0.10.2
using version 1.10.2.0 of the Cabal library... more »
|
|
|
