Sciweavers

68 search results - page 1 / 14
» On the proof theory of type two functionals based on primiti...
Sort
View
MLQ
2006
68views more  MLQ 2006»
13 years 4 months ago
On the proof theory of type two functionals based on primitive recursive operations
This paper is a companion to work of Feferman, J
David Steiner, Thomas Strahm
CIE
2008
Springer
13 years 6 months ago
Recursion on Nested Datatypes in Dependent Type Theory
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
Ralph Matthes
CADE
2000
Springer
13 years 9 months ago
Automated Proof Construction in Type Theory Using Resolution
We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows. − A clausification procedure in type theory, equipped w...
Marc Bezem, Dimitri Hendriks, Hans de Nivelle
CADE
2005
Springer
14 years 5 months ago
Reasoning in Extensional Type Theory with Equality
Abstract. We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compac...
Chad E. Brown
ACL
1993
13 years 6 months ago
A Complete and Recursive Feature Theory
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
Rolf Backofen, Gert Smolka