https://www.bibsonomy.org/user/draganigajic/typeTheoryBibSonomy RSS Feed for /user/draganigajic/typeTheoryComing back to the above post by Anton, yes, the kind of runtime type checking exists in lots of popular Java frameworks, even today. And this is where frameworks like Guice and EasyMock really shine with their strongly typed API sets that make you feel more secure within the confines of your IDE and refactoring abilities. The Morale When you are programming in a statically typed language, use appropriate language features to make most of your type checking at compile time. This way, before you hit the run button, you can be assured that your code is well-formed within the bounds of the type system. And you have the power of easier refactoring and cleaner evolution of your codebase.http://debasishg.blogspot.com/2008/03/are-you-fully-using-your-static-typing.htmldraganigajic2011-07-13T18:13:52+02:00Guice java typeTheory <span itemprop="description">Coming back to the above post by Anton, yes, the kind of runtime type checking exists in lots of popular Java frameworks, even today. And this is where frameworks like Guice and EasyMock really shine with their strongly typed API sets that make you feel more secure within the confines of your IDE and refactoring abilities. The Morale When you are programming in a statically typed language, use appropriate language features to make most of your type checking at compile time. This way, before you hit the run button, you can be assured that your code is well-formed within the bounds of the type system. And you have the power of easier refactoring and cleaner evolution of your codebase.</span>http://c2.com/cgi/wiki?LanguageTypeErrorsDiscussiondraganigajic2011-07-13T18:13:43+02:00c2 typeTheory wiki <a itemprop="url" data-versiondate="2011-07-13T18:13:43+02:00" href="http://c2.com/cgi/wiki?LanguageTypeErrorsDiscussion" rel="nofollow" class="description-link">http://c2.com/cgi/wiki?LanguageTypeErrorsDiscussion</a>very good discussionhttp://cdsmith.twu.net/types.htmldraganigajic2011-07-13T18:13:38+02:00100+ cs typeTheory <span itemprop="description">very good discussion</span>http://c2.com/cgi/wiki?LanguageTypeErrorsdraganigajic2011-07-13T18:13:38+02:00c2 cs pl typeTheory wiki <a itemprop="url" data-versiondate="2011-07-13T18:13:38+02:00" href="http://c2.com/cgi/wiki?LanguageTypeErrors" rel="nofollow" class="description-link">http://c2.com/cgi/wiki?LanguageTypeErrors</a>http://programmingkungfuqi.blogspot.com/draganigajic2011-07-13T18:13:19+02:00lisp prolog qi typeTheory <a itemprop="url" data-versiondate="2011-07-13T18:13:19+02:00" href="http://programmingkungfuqi.blogspot.com/" rel="nofollow" class="description-link">http://programmingkungfuqi.blogspot.com/</a>v coolhttp://www.macs.hw.ac.uk/ultra/compositional-analysis/type-error-slicing/slicing.cgidraganigajic2011-07-13T18:13:18+02:00! cs demo ml programming typeTheory <span itemprop="description">v cool</span>http://www.freetechbooks.com/practical-foundations-for-programming-languages-t730.htmldraganigajic2011-07-13T18:13:16+02:00book harper pl programming syntax textbook typeTheory <a itemprop="url" data-versiondate="2011-07-13T18:13:16+02:00" href="http://www.freetechbooks.com/practical-foundations-for-programming-languages-t730.html" rel="nofollow" class="description-link">http://www.freetechbooks.com/practical-foundations-for-programming-languages-t730.html</a>http://article.gmane.org/gmane.comp.lang.haskell.general/12747draganigajic2011-07-13T18:13:11+02:00announce cs haskell typeTheory <a itemprop="url" data-versiondate="2011-07-13T18:13:11+02:00" href="http://article.gmane.org/gmane.comp.lang.haskell.general/12747" rel="nofollow" class="description-link">http://article.gmane.org/gmane.comp.lang.haskell.general/12747</a>http://www.wellquite.org/sessions/tutorial_1.htmldraganigajic2011-07-13T18:13:09+02:00fp haskell parallel programming tutorial typeTheory <a itemprop="url" data-versiondate="2011-07-13T18:13:09+02:00" href="http://www.wellquite.org/sessions/tutorial_1.html" rel="nofollow" class="description-link">http://www.wellquite.org/sessions/tutorial_1.html</a>http://lambda-the-ultimate.org/node/2911draganigajic2011-07-13T18:13:09+02:000 forum ltu olegKiselyov restrictedDatatypes typeClass typeTheory <a itemprop="url" data-versiondate="2011-07-13T18:13:09+02:00" href="http://lambda-the-ultimate.org/node/2911" rel="nofollow" class="description-link">http://lambda-the-ultimate.org/node/2911</a>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_typedraganigajic2011-07-13T18:13:07+02:00cs fp haskell typeTheory <span itemprop="description">GHC extension Existential types can be used for several different purposes. But what they do is to &#039;hide&#039; a type variable on the right-hand side.</span>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_restrictiondraganigajic2011-07-13T18:13:07+02:00fp haskell typeTheory <span itemprop="description">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&#039;s not worth sacrificing the type-independence of eta reduction.</span>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/draganigajic2011-07-13T18:13:07+02:00correspondence cs curry-howard fp haskell logic math proofs theory typeTheory <span itemprop="description">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 &#034;Curry&#034; in &#034;Curry-Howard&#034;). We&#039;ll set up the rules of logic using Haskell types and programs. Then we&#039;ll use these rules as an abstract interface to perform some logic profs.</span>sets of typeshttp://haskell.org/haskellwiki/GHC/Indexed_typesdraganigajic2011-07-13T18:13:07+02:00ghc haskell theory typeTheory <span itemprop="description">sets of types</span>http://web.engr.oregonstate.edu/~erwig/UCheck/draganigajic2011-07-13T18:13:07+02:00haskell spreadsheet typeTheory ui <a itemprop="url" data-versiondate="2011-07-13T18:13:07+02:00" href="http://web.engr.oregonstate.edu/~erwig/UCheck/" rel="nofollow" class="description-link">http://web.engr.oregonstate.edu/~erwig/UCheck/</a>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 historyhttp://conway.rutgers.edu/~ccshan/wiki/blog/posts/Monad_transformers/draganigajic2011-07-13T18:13:07+02:00! blogpost fp haskell monads semantics theory typeTheory <span itemprop="description">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</span>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.htmldraganigajic2011-07-13T18:13:07+02:00fp haskell tutorial typeTheory <span itemprop="description">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&#039;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.</span>http://strictlypositive.org/draganigajic2011-07-13T18:13:07+02:00fp haskell people typeTheory <a itemprop="url" data-versiondate="2011-07-13T18:13:07+02:00" href="http://strictlypositive.org/" rel="nofollow" class="description-link">http://strictlypositive.org/</a>http://www.cis.upenn.edu/~bcpierce/draganigajic2011-07-13T18:13:05+02:00*RIL *read bibliography bidirectional categoryTheory coq cs fp haskell lectures logic ml people pl research sync teaching typeTheory unison upenn xml <a itemprop="url" data-versiondate="2011-07-13T18:13:05+02:00" href="http://www.cis.upenn.edu/~bcpierce/" rel="nofollow" class="description-link">http://www.cis.upenn.edu/~bcpierce/</a>clevnet has the bookhttp://www.cs.man.ac.uk/~pt/Practical_Foundations/draganigajic2011-07-13T18:13:04+02:00100+ categoryTheory dependent-types foundation from:realsplog logic math setTheory theory typetheory <span itemprop="description">clevnet has the book</span>