A kernel language for abstract data types and modules.
Proc. of the international symposium on Semantics of data types
Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Pebble, a kernel language for modules and abstract data types
Information and Computation - Semantics of Data Types
Inheritance in smalltalk-80: a denotational definition
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming in Martin-Lo¨f's type theory: an introduction
Programming in Martin-Lo¨f's type theory: an introduction
A higher-order calculus and theory abstraction
Information and Computation
Manifest types, modules, and separate compilation
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type-theoretic approach to higher-order modules with sharing
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Singleton, union, and intersection types for program extraction
Information and Computation - Special conference issue: international conference on theoretical aspects of computer software
Computation and reasoning: a type theory for computer science
Computation and reasoning: a type theory for computer science
Typing algorithm in type theory with inheritance
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Theory of Objects
The Definition of Standard ML
An Implementation of LF with Coercive Subtyping & Universes
Journal of Automated Reasoning
Coercive Subtyping in Type Theory
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Subtyping with Singleton Types
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
A Logical Framework with Dependently Typed Records
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Coercions in a polymorphic type system
Mathematical Structures in Computer Science
Transitivity in coercive subtyping
Information and Computation
Working with mathematical structures in type theory
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Towards an Ontological Modeling with Dependent Types: Application to Part-Whole Relations
ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
Developing the algebraic hierarchy with type classes in coq
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Coercive subtyping: Theory and implementation
Information and Computation
| Hi-index | 0.00 |
Manifest fields in a type of modules are shown to be expressible in intensional type theory without strong extensional equality rules. These intensional manifest fields are made available with the help of coercive subtyping. It is shown that, for both Σ -types and dependent record types, the with -clause for expressing manifest fields can be introduced by means of the intensional manifest fields. This provides not only a higher-order module mechanism with ML-style sharing, but a powerful modelling mechanism in formalisation and verification of OO-style program modules.