Questions tagged [haskell]

Question 1

I'm reading The implementation of functional programming languages (1987) by Peyton Jones and he mentions (p.307) that the MKAP (make application) instruction is more convenient if the argument is ...

Question 2

Not sure if this question fits here, but I'm looking to implement (or try to) Hakell's type classes into my own language, however I don't understand how resolution works on recursive types like the ...

Question 3

I've noticed a pattern in trying to make functional programming effective - there is still some kind of impure, effectful operation going on, but it gets holed up in a single, manageable imperative ...

Question 4

Is there any books, papers or articles on how to analyze the time complexity of programs written in lazy languages such as Haskell? I know how laziness is implemented and how it can be expanded and ...

Question 5

System F defines the data type pair as: $$X\times Y := \Pi Z. (X\to Y \to Z)\to Z$$ with: $$\langle x,y \rangle := \Lambda Z. \lambda p^{X\to Y\to Z}.p \text{ }x\text{ } y$$ Projections are defined: $$...

Question 6

If I have a deterministic finite automaton (DFA) with a language $W$, and I need to create another DFA that returns all the strings that are a concatenation of an even number of strings in $W$, how ...

Question 7

Haskell's monads are usually considered to mean strong monads in category theory, but it seems like the former is a bit stronger than the latter. With strong monads, you have a Kleisli extension ...

Question 8

For the past two days I have been on a question to understand monads in the context of Haskell. A nice explanation I found is by Graham Hutton on the Computerphile channel see here. This explanation ...

Question 9

Though purely functional programming languages, such as Haskell, is commonly thought to have no side-effects, there is a caveat: Recursive calls may hang. I considered this to be undesirable, and ...

Question 10

Suppose that I have some nested algebraic data type (ie. something one can construct via datas in Haskell) that is serializeable (so no functional fields ...

Question 11

For example, using GHCi, ghci> f x = x + 1 ghci> :t f f :: Num a => a -> a What is the type of the type signature ...

Question 12

I'm learning about strict functions in Haskell. A function f is strict if f ⊥ = ⊥ Some functions are strict only in the first argument (for e.g. const), others are strict in the second (for e.g. map)....

Question 13

I am looking for book references on combinatory logic. Is there a book focused on how combinatory logic is applied in the context of pure functional languages like Haskell? I found "Combinators: ...

Question 14

In Meijer, Fokkinga and Patersons "Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire" the ∇ operator for sum types is introduced which removes the tags from its ...

Question 15

I found following statements in 6.4.16. Arbitrary-rank polymorphism of ghc document. GHC uses an algorithm proposed by Odersky and Laufer (“Putting type annotations to work”, POPL‘96) to get a ...

Stack Exchange Network

Questions tagged [haskell]

Why does the G-machine push arguments before the function for application (MKAP)?

Haskell instance resolution on recursive types

Is Calling a Function a Side Effect

Is there any reference materials on complexity analysis for lazy languages?

Representation of pairs in System F

DFA for even concatenation of strings from a language

Are Haskell monads stronger than strong monads?

Mathematical explanation of the usage of monads to wrap data for avoiding errors

How much is decidability compromised within this restriction of the fixpoint combinator?

Literature on delta encoding serializeable ADTs

What is the type of a type signature?

Strictness in both arguments but not in each individually

Book references for combinatory logic as applied in Haskell?

Ambiguous type of "triangle" operator for sum types

Is type inference for arbitrary-rank types decidable when supplied type signatures?

Hot Network Questions