4 results
A dependently-typed construction of semi-simplicial types
-
- Journal:
- Mathematical Structures in Computer Science / Volume 25 / Issue 5 / June 2015
- Published online by Cambridge University Press:
- 20 November 2014, pp. 1116-1131
-
- Article
-
- You have access
- Export citation
Pure Type System conversion is always typable
- Part of
-
- Journal:
- Journal of Functional Programming / Volume 22 / Issue 2 / March 2012
- Published online by Cambridge University Press:
- 16 March 2012, pp. 153-180
-
- Article
-
- You have access
- Export citation
A-translation and looping combinators in pure type systems
- Part of
-
- Journal:
- Journal of Functional Programming / Volume 4 / Issue 1 / January 1994
- Published online by Cambridge University Press:
- 07 November 2008, pp. 77-88
-
- Article
-
- You have access
- Export citation
Control reduction theories: the benefit of structural substitution
- Part of
-
- Journal:
- Journal of Functional Programming / Volume 18 / Issue 3 / May 2008
- Published online by Cambridge University Press:
- 01 May 2008, pp. 373-419
-
- Article
-
- You have access
- Export citation