168 search results - page 9 / 34 » An Introduction to Dependent Type Theory |
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
CADE
1998
Springer
13 years 11 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— This paper considers the problem of sensor selfcalibration in mobile robotics by only using a single point feature (e.g. a source of light). In particular, the problem ...
ENTCS
2008
13 years 7 months ago
2008
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
MSCS
2008
13 years 7 months ago
2008
Subtyping for inductive types in dependent type theories is studied in the framework of coercive subtyping. General structural subtyping rules for parameterised inductive types ar...