First steps in synthetic guarded domain theory: step-indexing in the topos of trees Lars Birkedal 1 Rasmus Ejlers Møgelberg 1 Kristian Støvring 2 Jan Schwinghammer 3 1 IT

First Page		Document Content
Date: 2011-07-19 16:17:18 Recursion Constructible universe Forcing Fixed-point combinator Μ operator Linear temporal logic Mathematical logic Theoretical computer science Mathematics		First steps in synthetic guarded domain theory: step-indexing in the topos of trees Lars Birkedal 1 Rasmus Ejlers Møgelberg 1 Kristian Støvring 2 Jan Schwinghammer 3 1 IT Add to Reading List Source URL: www.fields.utoronto.ca Download Document from Source Website File Size: 202,68 KB Share Document on Facebook

	Recursive Session Types Revisited Ornela Dardha∗ School of Computing Science, University of Glasgow, UK Session types model structured communication-based programming. In particular, binary DocID: 1gASs - View Document
	A Simple Semantics for Haskell Overloading J. Garrett Morris University of Edinburgh Abstract DocID: 1gzML - View Document
	Lowness Properties and Approximations of the Jump Santiago Figueira ∗ DocID: 1gsI8 - View Document
	Topology in distributed computing Final project: black box x-consensus objects DocID: 1ghTH - View Document