Vídeos de programación

Sin descripción.

Sin descripción.

On October 26th we started our series of Meetups with Christian and Diego hosting the event. Subscribe to our newsletter to be updated with future events and the upcoming one in November ;)

MVP & FRP for controllerless architecture. 26th of October we hosted our first software architecture meet up with Christian Ciceri.

¿Quieres saber más? https://www.paradigmadigital.com/ Ver evento aquí: https://www.meetup.com/es-ES/BigDataSpain/events/243846493/ ¿Quieres saber cuáles son los próximos eventos que organizamos?: https://www.paradigmadigital.com/eventos/ Ver más eventos nuestros: https://www.youtube.com/playlist?list=PL2yjEVbRSX7XaQgyjsApXIqydTrC7v_Of

On October 26th we started our series of Meetups with Christian and Diego hosting the event. Subscribe to our newsletter to be updated with future events and the upcoming one in November ;)

This presentation was the closing keynote at Lambda World 2017 by Jeremy Gibbons. Follow: -https://www.twitter.com/47deg -https://www.twitter.com/lambda_world -https://twitter.com/jer_gib Visit: -https://www.47deg.com/events for more details. ___ Much of the expressive power of array-oriented languages such as Iverson’s APL and J comes from their implicit lifting of scalar operations to act on higher-ranked data, for example to add a value to each element of a vector, or to add two compatible matrices pointwise. It is considered a shape error to attempt to combine arguments of incompatible shape, such as a 3-vector with a 4-vector. APL and J are dynamically typed, so such shape errors are caught only at run-time. Recent work by Slepak et al develops a custom type system for an array-oriented language, statically ruling out such errors. I will show that such a custom language design is unnecessary: the requisite compatibility checks can already be captured in modern expressive type systems, as found for example in Haskell; moreover, generative type-driven programming can exploit that static type information constructively to automatically induce the appropriate liftings. I will also show that the structure of multi-dimensional data is inherently a matter of traversable Naperian applicative functors (and I will explain what this means).

This presentation was the midday keynote of Lambda World 2017 by Bartosz Milewski. Follow: -https://www.twitter.com/47deg -https://www.twitter.com/lambda_world -https://twitter.com/BartoszMilewski Visit: -https://www.47deg.com/events for more details. ___ Haskell lens library offers fine-grain declarative access to immutable (persistent) data structures. Its main attraction is that it's compositional: you can focus on substructures of larger structures simply by composing polymorphic higher-order functions. Its most general formulation is known as profunctor optics. I'll talk about the categorical foundation of profunctor optics

Aquí compartimos con vosotros un resumen de nuestro primer meetup en México. Para no perder los próximos eventos únete a nuestra comunidad en México: https://www.meetup.com/es-ES/preview/geekshubs-mexico Síguenos en los redes: Facebook: https://www.facebook.com/geekshubsacademy/ Twitter: https://twitter.com/geeks_academy Instagram: https://www.instagram.com/geekshubs/

Michele Melchionda, CTO della Corte dei Conti, ci racconta i problemi del cloud pubblico e privato al primo CTO meeting a Codemotion Rome 2017