no help available

no help available

The blue social bookmark and publication sharing system.

actions for all displayed bookmarks:

export:

sort:

- criterion: date, title
- order: ascending, descending

others:

- display: all, bookmarks only
- bookmarks per page: 5 10 20 50 100

actions for all displayed publications:

export:

sort:

- criterion: date, title
- order: ascending, descending
- advanced...

others:

- display: all, publications only
- publications per page: 5 10 20 50 100

- GHC extension Existential types can be used for several different purposes. But what they do is to 'hide' a type variable on the right-hand side. · http://www.haskell.org/haskellwiki/Existential_type3 years and 2 months agoby draganigajic1
- So why is the restriction imposed? The reasoning behind it is fairly subtle, and is fully explained in the Haskell 98 report. Basically, it solves one practical problem (without the restriction, there would be some ambiguous types) and one semantic problem (without the restriction, there would be some repeated evaluation where a programmer might expect the evaluation to be shared). Those who are for the restriction argue that these cases should be dealt with correctly. Those who are against the restriction argue that these cases are so rare that it's not worth sacrificing the type-independence of eta reduction. · http://www.haskell.org/haskellwiki/Monomorphism_restriction3 years and 2 months agoby draganigajic1
- The Curry-Howard correspondence is a mapping between logic and type systems. On the one hand you have logic systems with propositions and proofs. On the other hand you have type systems with types and programs (or functions). As it turns out these two very different things have very similar rules. This article will explore the Curry-Howard correspondence by constructing a proof system using the Haskell type system (how appropriate since Haskell is named after Haskell Curry, the "Curry" in "Curry-Howard"). We'll set up the rules of logic using Haskell types and programs. Then we'll use these rules as an abstract interface to perform some logic profs. · http://www.thenewsh.com/~newsham/formal/curryhoward/3 years and 2 months agoby draganigajic1
- sets of types · http://haskell.org/haskellwiki/GHC/Indexed_types3 years and 2 months agoby draganigajic1
- In denotational semantics and functional programming, the terms monad morphism, monad layering, monad constructor, and monad transformer have by now accumulated 20 years of twisted history. The exchange between Eric Kidd and sigfpe about the probability monad prompted me to investigate this history · http://conway.rutgers.edu/~ccshan/wiki/blog/posts/Monad_transformers/3 years and 2 months agoby draganigajic1
- In a previous post, I wondered about the differences between the thought processes that goes into writing good static code, and those that go into good dynamic code. We figured that there wasn't a lot out there to help dynamic programmers get the hang of static style thinking, so what follows is a simple little toy example, solved in what I think is probably a fairly static typey style. · http://totherme.livejournal.com/3845.html3 years and 2 months agoby draganigajic1
- "Generalized Algebraic Data Structures" have become a a hot new topic. They have recently been added to the GHC compiler. They support the construction, maintenance, and propagation of semantic properties of programs using powerful old ideas about types (the Curry-Howard Isomorphism) in surprisingly easy to understand new ways. The language Omega was designed and implemented to demonstrate their utility. Here a a few talks I gave that explains how they work. Also class lectures · http://web.cecs.pdx.edu/~sheard/3 years and 2 months agoby draganigajic1

- No matching items.

What is BibSonomy?

Contact & Privacy

Developer

BibSonomy is offered by the KDE group of the University of Kassel, the DMIR group of the University of Würzburg, and the L3S Research Center, Germany.