Abstract Tensor shape mismatch is a common source of bugs in deep learning programs. We propose new type-based approach to detect tensor mismatches. One the main features our best-effort inference. As inference problem undecidable general, we allow static type/shape be performed only manner. If cannot guarantee absence inconsistencies, dynamic checks are inserted into program. Another feature g...

Gradual Abstract Proof Search (GAPS) is a new 2-player search technique. It has been used to prove that 11x11 Phutball is a win for the first player in 25 plies or less, that 6x6 Atari-Go with a crosscut in the center is a win for the first player in 15 plies or less. I give domain dependent optimizations for the two games. I also describe theoretical and experimental comparisons with other rel...

Gradual typing combines static and dynamic typing in the same program. One would hope that the performance in a gradually typed language would range between that of a dynamically typed language and a statically typed language. Existing implementations of gradually typed languages have not achieved this goal due to overheads associated with runtime casts. Takikawa et al. (2016) report up to 100×...

Being able to combine static and dynamic typing within the same language has clear benefits in order to support the evolution of prototypes or scripts into mature robust programs. While being an emblematic dynamic object-oriented language, Smalltalk is lagging behind in this regard. We report on the design, implementation and application of Gradualtalk, a gradually-typed Smalltalk meant to enab...