Completeness of intersection and union type assignment systems for call-by-value λ-models
Theoretical Computer Science - Special issue on theories of types and proofs
Intersection and singleton type assignment characterizing finite Böhm-trees
Information and Computation
A Logical Framework with Dependently Typed Records
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Lightweight Static Capabilities
Electronic Notes in Theoretical Computer Science (ENTCS)
Manifest Fields and Module Mechanisms in Intensional Type Theory
Types for Proofs and Programs
A logical framework with dependently typed records
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
A Logical Framework with Dependently Typed Records
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
| Hi-index | 0.00 |