Colloquium

Faculty Search Colloquium: Bidirectional Programming Languages

Abstract

The need to edit data through a view arises in a host of applications across many different areas of computing. Unfortunately, few existing systems have support for updatable views and so, in practice, they are usually implemented using two separate programs -- one to compute views from sources, and another to handle updates. This rudimentary design is tedious to program, difficult to reason about, and a nightmare to maintain.

Faculty Search Colloquium: Markov Logic: Representation, Inference and Learning

Abstract

Many applications of AI, including natural language processing, information extraction, bioinformatics, robot mapping, and social network analysis, have both relational and statistical aspects. Historically, this has led to a divide between relational approaches based on first-order logic and statistical approaches based on probabilistic graphical models. Markov logic unifies the two by attaching weights to formulas in first-order logic, which are used as templates for constructing a Markov network.

International Summer School - Workshop of Network Design and Operations: July, 2009

Abstract

Dale Smith will give a preview of the upcoming Summer School Workshop of Network Design and Operations. This workshop will give Oregon students a unique opportunity to take a one week intensive course in networking with international classmates from China, Africa, South America, and the Himalayan region. 

From classical logic to delimited control in the hierarchy, via separation

Abstract

I shall first review results on extensions of the Proof-Program correspondence (a.k.a Curry-Howard correspondence) to classical logic in the line of Parigot's early 90's work on lambda-mu-calculus, focusing in particular on the separation property. Then, I shall introduce a slight extension of lambda-mu which completes Parigot's calculus (in the sense of Böhm completeness) and then lift this to a hierarchy of calculi that I will show to correspond to Danvy and Filinksi's CPS hierarchy of delimited control operator via the call-by-name/call-by-value duality.

Faculty Search Colloquium: Leveraging Emerging Storage Functionality for New Security Services

Abstract

The complexity of modern operating systems makes securing them a challenging problem. However, changes in the computing model, such as the rise of cloud computing and smarter peripherals, have presented opportunities to reconsider system architectures, as we move from traditional "stove-pipe" computing to distributed systems. In particular, we can build trustworthy components that act to provide security in complex systems.

Pages

Subscribe to RSS - Colloquium