A Logical Framework with Dependently Typed Records
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Towards a Context Theory for Context-aware systems
Proceedings of the 2007 conference on Advances in Ambient Intelligence
A Theorem Prover with Dependent Types for Reasoning about Actions
Proceedings of the 2008 conference on STAIRS 2008: Proceedings of the Fourth Starting AI Researchers' Symposium
Goal reasoning with context record types
CONTEXT'07 Proceedings of the 6th international and interdisciplinary conference on Modeling and using context
Semantic subtyping with an SMT solver
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Natural-language syntax as procedures for interpretation: the dynamics of ellipsis construal
Ludics, dialogue and interaction
Proof contexts with late binding
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A Logical Framework with Dependently Typed Records
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Formal program optimization in nuprl using computational equivalence and partial types
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
Records and dependent records are a powerful toolfor programming, representing mathematical concepts, andprogram verification. In the last decade several type systemswith records as primitive types were proposed. Thequestion is arose: whether it is possible to define recordtype in existent type theories using standard types withoutintroducing new primitives.It was known that independent records can be defined intype theories with dependent functions or intersection. Onthe other hand dependent records cannot be formed usingstandard types. Hickey introduced a complex notion of verydependent functions to represent dependent records. In thecurrent paper we extend Martin-Löf's type theory with asimpler type constructor dependent intersection, i.e., the intersectionof two types, where the second type may dependon elements of the first one (not to be confused with the intersectionof a family of types). This new type constructorallows us to define dependent records in a very simple way.It also allows us to define the set type constructor.