Category: tech talk

Technical Talk: Syntactic reasoning for digital circuits using graphs Dan R. Ghica When: Thursday, November 19, 10am (Edinburgh) Abstract: I will present a general diagrammatic theory of digital circuits, based on connections between monoidal categories and graph rewriting. The main achievement of the paper is conceptual, filling a foundational gap in reasoning syntactically and symbolically […]

Programming language Virtual Machines (VMs) must make many assumptions about how programs typically operate in order to effectively optimise them. We less commonly consider the many assumptions that VM developers and researchers hold about how VMs operate and the context within which they operate. In this talk, I will present a number of partly, or […]

by Dan R. Ghica We propose a core calculus for programming languages with effects, interpreted using a hypergraph-rewriting abstract machine. The intrinsic calculus syntax and semantics only deals with the basic structural aspects of programming languages: variables, names, and thunks. Everything else, including function abstraction and application, must be provided as extrinsic operations with associated […]

by Mario Alvarez Picallo When you hear the word ‘derivative’, differential calculus immediately comes to mind. This is, however, far from the only place where one can find them! Many ad-hoc notions of derivative have popped up over the years, in fields as disparate as incremental computation and digital circuits. In this talk we introduce […]

by Dan R. Ghica The interaction between (pure) computation and the physical world happens in two ways. The computation may act upon the world, which is usually called an effect, which is managed using the well known mechanism of monads in the type system of the programming language. But the computation may also require a resource, which is by symmetry called a co-effect, […]

On June 16 we had the pleasure of a technical talk by Prof. Michele Pagani, Institut de Recherche en Informatique Fondamentale, Université de Paris. Abstract: Backpropagation is a classic automatic differentiation algorithm computing the gradient of functions specified by a certain class of simple, first-order programs, called computational graphs.  It is a fundamental tool in […]

css.php

Report this page

To report inappropriate content on this page, please use the form below. Upon receiving your report, we will be in touch as per the Take Down Policy of the service.

Please note that personal data collected through this form is used and stored for the purposes of processing this report and communication with you.

If you are unable to report a concern about content via this form please contact the Service Owner.

Please enter an email address you wish to be contacted on. Please describe the unacceptable content in sufficient detail to allow us to locate it, and why you consider it to be unacceptable.
By submitting this report, you accept that it is accurate and that fraudulent or nuisance complaints may result in action by the University.

  Cancel