Martin Odersky's Papers
Archive of papers - Martin Odersky Scala and its Foundations Functional Nets GJ and Pizza Type Systems Functional Programming Theory Functional Programming and State Concurrent Programming Constraint Solving and Applications Technical Reports On Scala and its Foundations: Fighting Bit Rot with Types (Experience Report: Scala Collections), Martin Odersky, Adriaan Moors Proc. FSTTCS 2009 Event-Based
The Essence of Concatenative Languages
Andreas Rossberg defined a concise and elegant type system for the concatenative language Cat created by Christopher Diggins that makes clear, once and for all, that the nature of the paradigm is solidly functional, point-free and higher order in a way that, as John Nowak remarks, goes beyond the original conception of Backus' FP. Here I wish to contribute to fixing these important ideas by presen
Hindley–Milner type system - Wikipedia
This article's lead section may be too short to adequately summarize the key points. Please consider expanding the lead to provide an accessible overview of all important aspects of the article. (March 2024) A Hindley–Milner (HM) type system is a classical type system for the lambda calculus with parametric polymorphism. It is also known as Damas–Milner or Damas–Hindley–Milner. It was first descri
Type inference - Wikipedia
Type inference, sometimes called type reconstruction,[1]: 320 refers to the automatic detection of the type of an expression in a formal language. These include programming languages and mathematical type systems, but also natural languages in some branches of computer science and linguistics. Nontechnical explanation[edit] Types in a most general view can be associated to a designated use sugges
[Haskell-cafe] Type inference algorithm in Prolog and Haskell
[Haskell-cafe] Type inference algorithm in Prolog and Haskell oleg at okmij.org oleg at okmij.org Fri Nov 5 03:43:59 EDT 2010 Previous message: [Haskell-cafe] Re: HSCurses - Hello World? (can't find much documentation) Next message: [Haskell-cafe] Rigid types fun Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] Dan Doel wrote: > Implementing type inference can be very easy in a logic
Lecture 26: Type Inference and Unification
Type inference refers to the process of determining the appropriate types for expressions based on how they are used. For example, in the expression f 3, OCaml knows that f must be a function, because it is applied to something (not because its name is f!) and that it takes an int as input. It knows nothing about the output type. Therefore the type inference mechanism of OCaml would assign f the
JavaScript による型推論器の実装 - takuto_hの日記
型推論に興味はあるけど、抽象的な説明が多く難しそうだと思っている方々。基礎的なことを押さえておけば、型推論器は簡単に実装できます。 ここでは、私が JavaScript で書いた型推論器を例に、型推論の基本的なアルゴリズムの一例を具体的に説明していきます。解説対象は、ibis-js-1.0.0です。 型推論の可視化ツールを使いながら読むとよりわかりやすいかもしれません。 目次 型変数と単一化 多相型 let と let rec バリアント型
オンラインで入手できる数理論理学・数学基礎論のテキスト
オンラインで入手できる数理論理学・数学基礎論のテキスト 数理論理学、数学基礎論の教科書的に使えるテキスト（講義ノート、サーヴェイ、モノグラフ等）のうち、オンラインで入手できるものを集めました。 入門的概説 論理一般 高階論理と型理論 直観主義論理 コンビネータとラムダ計算 時相論理および時制論理 様相論理 適切さの論理 自然言語の論理 空間論理 モデル理論 安定性理論 無限論理 計算可能性理論および再帰理論 集合論 pcf理論 記述集合論 実数の集合論 選択公理 強制法と内部モデル 連続体仮説 NF 証明論と構成的数学 順序数解析 算術の体系と不完全性 証明可能性論理 線形論理 構成的数学 代数的論理と圏論 ブール代数 普遍代数 量子論理 圏論 歴史 入門的概説 [▲] 加茂静夫，「数理論理学（命題論理と述語論理）」．[PDF] 嘉田勝，「数理論理学 講義ノート（2013年度版）」． St
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
https://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=D00EC3E0D1AA97EBF8686ABE3C7D50B4?doi=10.1.1.42.673&rep=rep1&type=pdf
Google Scholar
Google Scholar
Google Scholar
The completeness theorem for typing λ-terms
Generalizing Hindley-Milner Type Inference Algorithms
http://localwww.math.unipd.it/~crafa/semantica/wand87.pdf
A Second Look at Overloading
Google Scholar
Type Inference for "call" in Concatenative Languages
CiteSeerX