Inheritance as implicit coercion
Information and Computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Enhancing the NUPRL proof development system and applying it to computational abstract algebra
Enhancing the NUPRL proof development system and applying it to computational abstract algebra
Pure Type Systems with Definitions
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Inductive Definitions in the system Coq - Rules and Properties
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Coercive subtyping for the calculus of constructions
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A constructive algebraic hierarchy in Coq
Journal of Symbolic Computation - Integrated reasoning and algebra systems
Coherence and Transitivity in Coercive Subtyping
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Mathematical Vernacular and Conceptual Well-Formedness in Mathematical Language
LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
Universal Algebra in Type Theory
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Dependently Typed Records for Representing Mathematical Structure
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Type Isomorphisms and Proof Reuse in Dependent Type Theory
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Journal of Functional Programming
Transitivity in coercive subtyping
Information and Computation
A computational view of implicit coercions in type theory
Mathematical Structures in Computer Science
Coercions in a polymorphic type system
Mathematical Structures in Computer Science
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Manifest Fields and Module Mechanisms in Intensional Type Theory
Types for Proofs and Programs
A theory of typed coercions and its applications
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Transitivity in coercive subtyping
Information and Computation
Weak transitivity in coercive subtyping
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Working with mathematical structures in type theory
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Contextual analysis of word meanings in type-theoretical semantics
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
View of computer algebra data from Coq
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
How to make ad hoc proof automation less ad hoc
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Formalising exact arithmetic in type theory
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Extending hindley-milner type inference with coercive structural subtyping
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Interfacing Coq + SSReflect with GAP
Electronic Notes in Theoretical Computer Science (ENTCS)
Coercive subtyping: Theory and implementation
Information and Computation
Mtac: a monad for typed tactic programming in Coq
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Canonical structures for the working coq user
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Pragmatic quotient types in coq
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
| Hi-index | 0.00 |