semantic-domain.blogspot.com
Semantic Domain: February 2015
http://semantic-domain.blogspot.com/2015_02_01_archive.html
Thursday, February 26, 2015. Midlands Graduate School 2015. Registration for the Midlands Graduate School. I'll be lecturing again this year on functional reactive programming, and am very much looking forward to meeting the participants. The Midlands Graduate School in the Foundations of Computing Science (MGS). This year's MGS is hosted by the Department of Computer Science. At the University of Sheffield. It will start on April 07 and finish on April 11. Roy Crole, Leicester. Jeremy Gibbons, Oxford.
semantic-domain.blogspot.com
Semantic Domain: January 2014
http://semantic-domain.blogspot.com/2014_01_01_archive.html
Saturday, January 25, 2014. I just attended the Off the Beaten Track. Workshop, which is a POPL workshop where people gather to offer their new, untested, and (ideally) radical ideas. Here are some quick and incomplete reactions. Chris Martens gave a talk,. Languages for Actions in Simulated Worlds. In which she described some of her ideas for using linear logic programming to model interactive fiction. Is a proof that the end of the story is derivable. Here are some thoughts I had about her talk:. In Ma...
semantic-domain.blogspot.com
Semantic Domain: FRP without Space Leaks
http://semantic-domain.blogspot.com/2015/07/higher-order-functional-reactive.html
Friday, July 31, 2015. FRP without Space Leaks. The dataflow engine I gave in my last post can be seen as an implementation of self-adjusting computation. In the style of Acar, Blelloch and Harper's original POPL 2002 paper. Since then, state of the art implementation techniques have improved a lot, so don't take my post as indicative of what modern libraries do.). Originally, I was one of those people, but that's no longer true: I think SAC and FRP are completely orthogonal. With an appropriate type dis...
semantic-domain.blogspot.com
Semantic Domain: November 2013
http://semantic-domain.blogspot.com/2013_11_01_archive.html
Thursday, November 7, 2013. Antimirov Derivatives for Regular Expressions. Are one of the shibboleths. Of functional programming: if you ask someone about implementing regular expressions, and you get back an answer involving derivatives of regular expressions, then you have almost surely identified a functional programmer. Then his theorem guarantees that the set of derivatives is finite. However, computing with derivatives up to equivalence is rather painful. Even computing equality and orderin...So fo...
semantic-domain.blogspot.com
Semantic Domain: March 2015
http://semantic-domain.blogspot.com/2015_03_01_archive.html
Tuesday, March 17, 2015. Abstract Binding Trees, an addendum. It struck me after the last post that it might be helpful to give an example using abstract binding trees in a more nontrivial way. The pure lambda calculus has a very simple binding structure, and pretty much anything you do will work out. So I decided to show how ABTs can be used to easily support a much more involved form of binding - namely, pattern matching. As is usual, we will need to introduce a signature module for the language. Bindi...
semantic-domain.blogspot.com
Semantic Domain: March 2014
http://semantic-domain.blogspot.com/2014_03_01_archive.html
Monday, March 24, 2014. Here is an incomplete selection of some good papers I'm currently reading:. Constructing Type Systems over an Operational Semantics. A Realizability Interpretation of Martin-Loef Type Theory. Simple, given the complexity of the type theories involved. Categorical Glueing and Logical Predicates for Models of Linear Logic. Parametric Polymorphism and Operational Equivalence. With double glueing, you again think of a type in as a set of values which make it up, and a set of continuat...
semantic-domain.blogspot.com
Semantic Domain: July 2014
http://semantic-domain.blogspot.com/2014_07_01_archive.html
Wednesday, July 9, 2014. Two Drafts on Dependent Types. I have two new draft papers to publicize. The first is a paper with Pierre Pradic and Nick Benton:. Integrating Linear and Dependent Types. Neelakantan R. Krishnaswami, Pierre Pradic, Nick Benton. The technical report with proofs. In this paper, we show how to integrate linear types with type dependency, by extending the linear/non-linear calculus of Benton to support type dependency. Mtac: A Monad for Typed Tactic Programming in Coq. Beta Ziliani, ...
semantic-domain.blogspot.com
Semantic Domain: December 2013
http://semantic-domain.blogspot.com/2013_12_01_archive.html
Friday, December 20, 2013. PhD Opportunities at the University of Birmingham. My university, the University of Birmingham. Is looking for applicants to the CS PhD program. I'm putting our advertisement on my blog, in case you (or your students, if you're a professor) are looking for a graduate program - well, we're looking for students! We invite applications for PhD study at the University of Birmingham. We are a group of (mostly) theoretical computer scientists who explore fundamental concepts in compu...
semantic-domain.blogspot.com
Semantic Domain: Abstract Binding Trees, an addendum
http://semantic-domain.blogspot.com/2015/03/abstract-binding-trees-addendum.html
Tuesday, March 17, 2015. Abstract Binding Trees, an addendum. It struck me after the last post that it might be helpful to give an example using abstract binding trees in a more nontrivial way. The pure lambda calculus has a very simple binding structure, and pretty much anything you do will work out. So I decided to show how ABTs can be used to easily support a much more involved form of binding - namely, pattern matching. As is usual, we will need to introduce a signature module for the language. Bindi...
semantic-domain.blogspot.com
Semantic Domain: How to implement a spreadsheet
http://semantic-domain.blogspot.com/2015/07/how-to-implement-spreadsheet.html
Wednesday, July 22, 2015. How to implement a spreadsheet. My friend Lindsey Kuper. Recently remarked on Twitter that spreadsheets were commonly understood to be the most widely used dataflow programming model, and asked if there was a simple implementation of them. As for the proof, you can look at this TLDI paper. For some idea of the complexities involved. These days it could all be done more simply, but the pressure of proving everything correct. Each of which contains an. An expression is basically a...
SOCIAL ENGAGEMENT