Now showing items 1-2 of 2
A Model of Type Theory in Cubical Sets
(Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014)
We present a model of type theory with dependent product, sum, and identity, in cubical sets. We describe a universe and explain how to transform an equivalence between two types into an equality. We also explain how to ...
Exploring Subexponential Parameterized Complexity of Completion Problems
(Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014-02-19)
Let F be a family of graphs. In the F-Completion problem, we are given an n-vertex graph G and an integer k as input, and asked whether at most k edges can be added to G so that the resulting graph does not contain a ...