Alexander Daniel Barnabas Kralik Bernhard Huemer Christian Papauschek David Juhasz David Pichsenmeister Dominik Gruber Floor Drees Gerald Löffler Manuel Bernhardt Manuel Bernhart Michal Bigos Oleg Rudenko Peter Kofler Radim Pavlicek Sebastian Nozzi Yago Alonso
era implicit playframework Akka Android BDD Book Review Community Concurrency Cucumber Dependency Injection Design pattern Devoxx Functional Programming JScala JVM Java JavaScript Language MongoDB Play REST Scala Scala.js ScalaTest Scalaz Selenium conference page object page object pattern pingconf spray ui testing web testing
2014-06-25 2014-02-20 2014-01-22 2013-12-17 2013-11-20 2013-09-26 2013-08-26 2013-07-23 2013-06-20 2013-05-22 2013-04-16 2013-03-21

Scala's type inference algorithm tries hard to automatically infer generic type parameters' actual values. If there are implicit parameters to a function that depend on yet underspecified type parameters, it can use this as a source of type constraints. This yields a variant of logic programming on types.

In this lightning talk, I will show the main powers and limitations of this method of metaprogramming through a series of short examples.

Back to all talks