43 search results - page 7 / 9 » Recursion on Nested Datatypes in Dependent Type Theory |
CADE
1998
Springer
14 years 24 days 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...
LPAR
2010
Springer
13 years 7 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
FOSSACS
2010
Springer
14 years 3 months ago
2010
Springer
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
Massive amounts of useful data are stored and processed in ad hoc formats for which common tools like parsers, printers, query engines and format converters are not readily availa...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as p...