サクサク読めて、アプリ限定の機能も多数！
トップへ戻る
買ってよかったもの
personal.cis.strath.ac.uk
Adam Gundry This thesis studies questions of type inference, unification and elaboration for languages that combine dependent type theory and functional programming. Languages such as modern Haskell have very expressive type systems, allowing the programmer a great deal of freedom. These require advanced type inference and unification algorithms to reconstruct details that were left implicit, and
please won't you tell me who is she? The Strathclyde Haskell Enhancement is an experimental preprocessor for the Glasgow Haskell Compiler, concocted hastily by Conor McBride at the University of Strathclyde. Its current functionality includes types indexed by data pi types pattern synonyms — definitions you can use on left and right support for a crude kind of aspect-oriented programming idiom bra
personal.cis.strath.ac.uk/~adam
Adam Gundry, Conor McBride and James McKinna We consider the problems of first-order unification and type inference from a very general perspective on problem-solving, namely that of information increase in the problem context. This leads to a powerful technique for implementing type inference algorithms. We describe a unification algorithm and illustrate the technique by applying it to the famili
personal.cis.strath.ac.uk/~conor
このページを最初にブックマークしてみませんか？
『personal.cis.strath.ac.uk』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
