Sciweavers

100 search results - page 2 / 20
» In the Search of a Naive Type Theory
Sort
View
CADE
2006
Springer
14 years 5 months ago
Combining Type Theory and Untyped Set Theory
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...
Chad E. Brown
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
ICFP
2005
ACM
14 years 4 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 5 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
CTCS
1987
Springer
13 years 8 months ago
Good Functors... are Those Preserving Philosophy
of this paper is to prevent the abstract data type researcher from an improper, naive use of category theory. We mainly emphasize some unpleasant properties of the synthesis funct...
Gilles Bernot