#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2010

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Marc Bezem, Thierry Coquand, Simon Huber
- TYPES
- 2013

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 model propositional truncation and the circle. While not expressed internally in type theory, the model is expressed in a constructive… (More)

- Cyril Cohen, Thierry Coquand, Simon Huber, Anders Mörtberg
- ArXiv
- 2016

This paper presents a type theory in which it is possible to directly manipulate n-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways to reason about identity types, for instance, function extensionality is directly provable in the system. Further,… (More)

- Raymond Behrendt, Simon Huber, Roger Martí, Peter White
- Journal of peptide science : an official…
- 2015

Obtaining homogenous aspartyl-containing peptides via Fmoc/tBu chemistry is often an insurmountable obstacle. A generic solution for this issue utilising an optimised side-chain protection strategy that minimises aspartimide formation would therefore be most desirable. To this end, we developed the following new derivatives: Fmoc-Asp(OEpe)-OH (Epe =… (More)

- Simon Huber
- ArXiv
- 2016

Cubical type theory is an extension of Martin-Löf type theory recently proposed by Cohen, Coquand, Mörtberg and the author which allows for direct manipulation of n-dimensional cubes and where Voevodsky's Univalence Axiom is provable. In this paper we prove canonicity for cubical type theory: any natural number in a context build from only name variables is… (More)

We sketch a constructive formal theory TCF + of computable functionals, based on the partial continuous functionals as their intendend domain. Such a task had long ago been started by Dana Scott [12, 15], under the well-known abbreviation LCF (logic of computable functionals). The present approach differs from Scott's in two aspects. (i) The intended… (More)

- Raymond Behrendt, Simon Huber, Peter White
- Journal of peptide science : an official…
- 2016

In our efforts to develop a universal solution to the problem of aspartimide formation in Fmoc SPPS, we investigated the application of our new β-trialkylmethyl protected aspartic acid building blocks to the synthesis of peptides containing the Asp-Gly motif. The N(α)-Fmoc aspartic acid β-tri-(ethyl/propyl/butyl)methyl esters were used in the synthesis of… (More)

- Bruno Barras, Thierry Coquand, Simon Huber
- Mathematical Structures in Computer Science
- 2015

We present an interpretation of a version of dependent type theory where a type is interpreted by a Kan semisimplicial set. This interprets only a weak notion of conversion similar to the one used in the first published version of Martin-Löf type theory. Each truncated version of this model can be carried out internally in dependent type theory, and we have… (More)

- ‹
- 1
- ›