Since the previous thread is already on page ~3, I thought a reminder might be reasonable.Links
- Overall summary: https://ghc.haskell.org/trac/ghc/wiki/Prelude710
- Details of Plan List: https://ghc.haskell.org/trac/ghc/wiki/Prelude710/List
- Details of Plan FTP: https://ghc.haskell.org/trac/ghc/wiki/Prelude710/FTP
Given the present state of the Haskell build arena (stackage, LTS, improved cabal, sandbox, etc.) I have some questions for the community.
1) Is Haskell Platform a necessity anymore?
2) Who is best served by Haskell Platform?
3) What is Haskell Platform's future?submitted by noZone
[link] [57 comments]
Position Title: Engineering Manager
Location: Dresden, Germany
FireEye has invented a purpose-built, virtual machine-based security platform that provides real-time threat protection to enterprises and governments worldwide against the next generation of cyber attacks. These highly sophisticated cyber attacks easily circumvent traditional signature-based defenses, such as next-generation firewalls, IPS, anti-virus, and gateways. The FireEye Threat Prevention Platform provides real-time, dynamic threat protection without the use of signatures to protect an organization across the primary threat vectors and across the different stages of an attack life cycle. The core of the FireEye platform is a virtual execution engine, complemented by dynamic threat intelligence, to identify and block cyber attacks in real time. FireEye has over 3,100 customers across 67 countries, including over 200 of the Fortune 500.
In Dresden, Germany, an outstanding team of formal methods engineers uses formal methods tools, such as proof assistants, to develop correctness proofs for FireEye's leading edge products. In real world applications of formal methods tools, automation is often not sufficient for the specific problems at hand. Therefore, we are seeking outstanding software developers with a passion for implementing both well-designed as well as ad-hoc formal methods software tools for proof refactoring, proof search, systematic testing and other areas.
- Design and development of software tools, scripts and automated processes for various tasks, supporting formal method tools
- Refactoring, redesigning and rewriting earlier ad-hoc solutions in a systematic way
- Maintaining existing tools and scripts
- Continuous focus and contribution in the areas of performance, reliability, scalability, and maintainability of the product
- Active participation in our ongoing process enhancements in software development and verification practices
Desired Skills & Experience
- BS or MS in Computer Science or equivalent experience
- Strong programming skills in OCaml or Haskell under Linux
- Good skills in scripting languages, such as bash, perl or python
- Good knowledge of logic and formal logical reasoning
- Experience with parallel programs running on multiple machines and cores
- Interest in acquiring basic knowledge about proof assistants for higher-order logic
- Excellent interpersonal and teamwork skills
- Strong problem solving, troubleshooting and analysis skills
- Excellent oral and written communication skills
Get information on how to apply for this position.
First of all, sorry if the english is not that clear, it's not my first language. Hey guys, I'm pretty new to haskell and so far I love it! I got a couple of easy classes that I'm using my algorithm analysis class to practice a little Haskell and it's working out fine. The issue i'm having now is I don't know how to time my programs runtime. Just have to measure the time it takes for mergesort, insertionsort and selectionsort to get the answer for x items.
How can I get that value in HS?submitted by Gran-Tizoc
[link] [7 comments]
For each package, create a list of all the other packages it imports, the functions, types etc. that it imports from those packages, and their types. Also a list of all the functions etc. the package itself exports, and their types.
Then, if package foo exports function qux with type int -> bool, and package bar imports foo.qux, expecting it to have type int -> IO bool, running cabal install foo bar fails with an error "the function qux defined in package foo doesn't match that expected by package bar". As opposed to downloading both, compiling foo, beginning to compile bar, then failing with a type error.submitted by logicchains
[link] [9 comments]
When I try to install wxcore in a sandbox I get this error http://lpaste.net/115319 Can someone help me?submitted by nocte_aeterna
[link] [1 comment]
I've been coding in Haskell for about 4 years now, and I'm realizing that perhaps I've fallen into a rut with the way I debug my programs. After hoping and failing to learn better methods I eventually fell into a pattern of just importing a library of self rolled trace functions.
In an effort to grow and maybe code faster, I'm hoping to start a discussion here about how you actually debug your programs.
The most common functions I use are:-- m stands for message, x is the value, f is a utility function -- tr is like trace but includes the value of what's being evaluated tr m x = trace (m++":"++show x) x trWith f m x = trace (m++":"++show (f x)) x -- tc shows a trace before and after the value is evaluated -- helpful for tracking down infinite recursion. tc m x = trace (m++"-->") $ trace ("-->"++m++" "++(show x)) x tcWith f m x = trace (m ++"-->") $ trace ("-->"++m++" "++show (f x)) x
I have some others that work inside specific monads and etc. I've even gone so far as to colorize certain data structure traversals using the System.Console.ANSI module.
I find that the deeper the program logic is inside abstractions the more difficult and befuddling it can be to debug.
I'm curious about what methods folks use to hunt and prevent bugs on a daily basis?submitted by biglambda
[link] [56 comments]