On 2011-03-17 19:35, wren ng thornton wrote:
Dependently typed languages tend to use the second definition because it
gives a pure total function (unlike the first) and because it's less
obnoxious to use than the third. In Haskell the third would be even more
obnoxious.
There is a fourth
On 2010-11-25 01:59, John D. Ramsdell wrote:
The irony of this situation is deep. CPSA is a program that analyzes
cryptographic protocols in an effort to expose security flaws. To
ensure that the program does not crash a user's machine, I have to use
a linker option that may expose the user to
On 2010-06-30 18:38, Chris BROWN wrote:
My question is:
Is it possible to allow the emacs/vim scripts that I have know where
this directory is automatically?
Maybe you could adapt the approach taken by Agda. Agda's Emacs mode is
installed using Cabal plus a small script:
1) The Emacs Lisp
On 2010-01-29 01:09, Edward Kmett wrote:
Luke pretty much nailed the summary of what you can parse using Applicative
means. I tend to consider them codata CFGs, because they can have infinite
breadth and depth. However, a 'codata CFG' can handle a much larger class of
languages than CFGs. To
On 2010-01-28 20:31, Luke Palmer wrote:
I could be mistaken, but at least there are both Applicative and Arrow
parser libraries. I don't know how to classify the language that they
parse -- it is not strictly context-free. It corresponds roughly to
context-free where certain types of infinite
On 2009-11-09 12:39, Duncan Coutts wrote:
You'll be glad to know this is addressed in Cabal-1.8, though not in a
fully automatic way. The problem with sharing automatically is knowing
when it is safe to do so and when it is not. Each component that shares
a source file can use different compiler
On 2009-12-10 07:16, o...@okmij.org wrote:
There are at least two parser combinator libraries that can deal with
*any* left-recursive grammars.
Parser combinators are often used to describe infinite grammars (with a
finite number of parametrised non-terminals). The library described by
Frost
On 2009-12-10 01:11, John D. Earle wrote:
Is Parsec capable of parsing a mildly context sensitive language?
I expect that one can parse any decidable language using Parsec. Whether
it is convenient to do so is another question.
--
/NAD
___
On 2009-12-08 16:11, S. Doaitse Swierstra wrote:
In principle it is not possible to parse left-recursive grammars [...]
I suspect that this statement is based on some hidden assumption. It
/is/ possible to parse many left recursive grammars using parser
combinators, without rewriting the
On 2009-12-09 18:50, Dan Doel wrote:
(Your parsers aren't PEGs, are they? If so, I apologize for the
redundancy.)
No, my parsers use Brzozowski derivatives.
See the related work section of the paper I mentioned for some other
parser combinator libraries which can handle (some) left recursive
On 2009-10-22 14:56, Robert Atkey wrote:
Yes, it might have been that, OTOH I'm sure I saw it in some Haskell
code. Maybe I was imagining it.
There is some related Haskell code in the Agda repository.
Do you know of a characterisation of what languages having a possibly
infinite amount of
On 2009-10-22 14:44, Robert Atkey wrote:
On Sat, 2009-10-10 at 20:12 +0200, Ben Franksen wrote:
Since 'some' is defined recursively, this creates an infinite production for
numbers that you can neither print nor otherwise analyse in finite time.
Yes, sorry, I should have been more careful
On 2009-10-07 17:29, Robert Atkey wrote:
A deep embedding of a parsing DSL (really a context-sensitive grammar
DSL) would look something like the following. I think I saw something
like this in the Agda2 code somewhere, but I stumbled across it when I
was trying to work out what free applicative
On 2009-02-05 15:20, Gregg Reynolds wrote:
I think I've just about got monads figured out, but [...]
I don't think anyone has mentioned Simon's Tackling the awkward squad
paper in this thread. This tutorial, which contains a semantics for a
subset of IO, should answer some of the questions
On 2009-01-09 00:51, Niklas Broberg wrote:
- Support for Unicode symbols for e.g. -. Fixing that would require
me to have a Unicode-compliant editor
Can't you just use character literals like '\x2192'?
--
/NAD
This message has been checked for viruses but the contents of an attachment
may
On Thu, 18 Oct 2007, Daniel McAllansmith [EMAIL PROTECTED] wrote:
I was wondering if anyone had done work on tagging functions at the type
level
with their time or space complexity and, if it's even feasible, calculating
the complexity of compound functions.
Any pointers?
I have done
On Fri, 28 Sep 2007, Jeff Polakow [EMAIL PROTECTED] wrote:
Agda is essentially an implementation of a type checker for
Martin-Lof type theory (i.e. dependent types).
It is designed to be used as a proof assistant.
Well, the language aims to become a practical programming language.
Ulf's
On Thu, 20 Sep 2007, PR Stanley [EMAIL PROTECTED] wrote:
\_ n - 1 + n
\_ - (\n - 1 + n)
The outcome seems to be identical. is there a substantive difference
between the two definitions?
No, since you do not pattern match on the first argument. Otherwise,
due to the way these definitions are
On Sun, 13 May 2007, Stefan Holdermans [EMAIL PROTECTED] wrote:
Anyway, Conor and James' Haskell Workshop paper on manipulating
syntax that involves both free and bound variables [1] is really nice
and could perhaps be of interest to you.
If I remember correctly this paper is not about a pure
On Wed, 09 May 2007, Stefan O'Rear [EMAIL PROTECTED] wrote:
To the best of my knowledge, there are no optimizations specific to []
in the compiler proper.
However, the standard library has a *lot* of speed hacks you will need
to duplicate!
Some of which are not expressible in ordinary
On Fri, 19 Jan 2007, Ulf Norell [EMAIL PROTECTED] wrote:
Personally I think that the distinction between _|_ and \x - _|_ is
a mistake and should be ignored whenever possible.
If you want to write an accessible tutorial you should probably use a
total programming language, or at least the
On Thu, 11 Jan 2007, Chris Eidhof [EMAIL PROTECTED] wrote:
On 8 Jan, 2007, at 23:13 , Chris Eidhof wrote:
I'm trying to profile my application, which makes use of MissingH.
But when compiling with -prof -auto-all, I get the following error:
Language.hs:8:7:
Could not find module
On Wed, 08 Nov 2006, Arie Peterson [EMAIL PROTECTED] wrote:
Specifying precedence 'lazily', by a partial order, does not suffer from
this problem, because it only requires you to make local decisions.
Assuming we only want to be able to make local decisions.
Let's say that we want == to bind
On Wed, 08 Nov 2006, Henning Thielemann [EMAIL PROTECTED] wrote:
If the Prelude would be splitted into modules, where (==) and (+)
are separated, and no module imports the other one, then we need a
third module, which states the relation between (==) and (+).
Yes, presumably. However,
On Thu, 19 Oct 2006, Tomasz Zielonka [EMAIL PROTECTED] wrote:
On Thu, Oct 19, 2006 at 01:37:16PM -0400, Cale Gibbard wrote:
In order to determine if [1..length xs] has an element at all, you
have to evaluate length xs, which involves forcing the entire spine of
xs, because integers can't be
On Mon, 16 Oct 2006, Jón Fairbairn [EMAIL PROTECTED] wrote:
I made a more concrete proposal later and Phil Wadler tidied it up.
I think It even got as far as a draft of the language, [...]
Do you know where this proposal/draft can be found?
--
/NAD
On Sat, 24 Jun 2006, Paul Hudak [EMAIL PROTECTED] wrote:
Hmmm... never tried to write all this down in one place before, but I
think this covers all cases:
A partial list is one that ends in _|_.
A total list is one that ends in [].
A finite list is either partial or total.
Any other list
On Sun, 02 Apr 2006, Jared Updike [EMAIL PROTECTED] wrote:
Something like distribute fst (==) where
distribute f op x y = f x `op` f y
A function like this has been suggested for the standard libraries a
couple of times before. Someone suggested the name on, which I quite
like:
(*) `on` f
On Fri, 24 Mar 2006, Henning Thielemann [EMAIL PROTECTED] wrote:
Further on think of QuickCheck: A Cardinal type with an Arbitrary
instance would save us the (=0) condition and it would reduce the
number of tests that must be skipped because of non-fulfilled
conditions. Because I was
On Tue, 07 Mar 2006, Brian Hulley [EMAIL PROTECTED] wrote:
(Moved from ghc-users.)
Brian Hulley wrote:
(time for a proper email client to be written in Haskell! ;-) )
I had the same thought yesterday, after an Emacs-Lisp session in which
I was trying to get Gnus to do exactly what I wanted
On Thu, 02 Mar 2006, S. Alexander Jacobson [EMAIL PROTECTED] wrote:
I am looking for Haskell code that does credit card authorization?
e.g. paypal website pro does not supply a Haskell lib.
I think that WASH/CGI contains code for doing some sort of checksum
check on credit card numbers:
On Thu, 16 Feb 2006, Udo Stenzel [EMAIL PROTECTED] wrote:
hPutStr stdout $ foldr seq veryLongString veryLongString
There is no primitive to do this for arbitrary data types, but the
DeepSeq type class comes close. You can find DeepSeq and some more
hints on strict evaluation at
On Thu, 16 Feb 2006, Matthias Fischmann [EMAIL PROTECTED] wrote:
I wrote a module for sampling arbitrary probability distribution, so
far including normal (gaussian) and uniform.
- There is probably a better implementation out there already.
Please point me to it.
Martin Erwig and
On Sun, 11 Dec 2005, Tomasz Zielonka [EMAIL PROTECTED] wrote:
I would like to see some support in tools for enforcing such a coding
policy. It could look like this - a function written using only safe
components would be marked as safe. Every unsafe feature like FFI,
unsafePerformIO, etc.
On Fri, 11 Nov 2005, Tomasz Zielonka [EMAIL PROTECTED] wrote:
[Moved to cafe.]
How about an integrated newsgroup+mailinglist+forum. If we had a
two-way newsgroup+mailinglist integration, people could use it also
as a forum, for example through gmail.google.com. But I don't use
fora, so I
On Thu, 27 Oct 2005, Shae Matijs Erisson [EMAIL PROTECTED] wrote:
Joel Reymont [EMAIL PROTECTED] writes:
I could not understand how to define this for arbitraries of my
choosing and Shae seems to have defined coarbitrary = error Not
implemented :-).
Coarbitrary is for generator
On Thu, 27 Oct 2005, Sebastian Sylvan [EMAIL PROTECTED] wrote:
instance Arbitrary Word32 where
arbitrary = do c - arbitrary :: Gen Integer
return (fromIntegral c)
This definition will usually only generate very small or very large
Word32 values. The reason is the wrapping
On Thu, 27 Oct 2005, Lennart Augustsson [EMAIL PROTECTED] wrote:
Tom Hawkins wrote:
Or phased differently, is it possible to make Expr an instance of
Eq such that cyclic == cyclic is smart enough to avoid a recursive
decent?
No. And there is nothing that says that your definition of
On Tue, 18 Oct 2005, Philippa Cowderoy [EMAIL PROTECTED] wrote:
If you've got a decent chunk of test data or don't mind generating
it with QuickCheck odds are you can spot it reasonably quickly when
it happens.
When I write a parser I usually also write a pretty-printer (or
ugly-printer) plus
On Thu, 06 Oct 2005, John Goerzen [EMAIL PROTECTED] wrote:
Quick question: am I correct in thinking that this code, while it uses
Hugs, won't actually run from Hugs, due to lack of piping support in
Hugs?
Quite possibly.
--
/NAD
___
Haskell-Cafe
On Thu, 06 Oct 2005, John Goerzen [EMAIL PROTECTED] wrote:
I'm wondering if there are any alternatives? Can a Haskell program
using Hugs call Hugs to evaluate an arbitrary hunk of code?
Although it is not very efficient you can of course call Hugs and
parse its output. I have some working
On Wed, 05 Oct 2005, Dimitry Golubovsky [EMAIL PROTECTED] wrote:
The papers presented at the Workshop are already available in the ACM
library which requires membership/subscription to read full text PDFs.
Are there any plans to make those papers available anywhere else on
the Web without
On Thu, 01 Sep 2005, Frederik Eaton [EMAIL PROTECTED] wrote:
But getting a stack backtrace when there is an error should be a
pretty basic feature. It's very hard to debug a large program when you
can randomly get messages like *** Exception: Prelude.head: empty
list and have no idea where
On Wed, 29 Jun 2005, Sven Moritz Hallberg [EMAIL PROTECTED] wrote:
Am 29. Jun 2005 um 11.03 Uhr schrieb Simon Marlow:
On 28 June 2005 14:11, Bulat Ziganshin wrote:
[...] how about using Pesco's library versioning scheme? (see
http://www.haskell.org/tmrwiki/EternalCompatibilityInTheory)
44 matches
Mail list logo
