First-Class Type Classes

DOI10.1007/978-3-540-71067-7_23MaRDI QIDQ3543665zbMATH OpenOpenAlexFDO

Authors Matthieu Sozeau, Nicolas Oury

Publication date 4 December 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71067-7_23

Mathematics Subject Classification ID

Recommendations

• Type classes for mathematics in type theory
• Constructive Type Classes in Isabelle
• Modular type classes
• Type Reconstruction for Type Classes
• Type classes with more higher-order polymorphism

Cites work

• scientific article; zbMATH DE number 1629944 (Why is no real title available?)
• scientific article; zbMATH DE number 1670760 (Why is no real title available?)
• scientific article; zbMATH DE number 2061705 (Why is no real title available?)
• A compiled implementation of strong reduction
• Associated types with class
• Constructive Type Classes in Isabelle
• Proof theory in computer science. International seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7--12, 2001. Proceedings
• Subset Coercions in Coq
• Theorem Proving in Higher Order Logics

Cited in

(35)

• On the bright side of type classes: instance arguments in Agda
• A synthetic proof of Pappus' theorem in Tarski's geometry
• Hints in Unification
• \textsf{LOGIC}: a Coq library for logics
• Program calculation in Coq
• Type classes for mathematics in type theory
• First-Class Object Sets
• Certifying dictionary construction in Isabelle/HOL
• Two cryptomorphic formalizations of projective incidence geometry
• Integration of multiple formal matrix models in Coq
• Formalising overlap algebras in Matita
• Use and abuse of instance parameters in the Lean mathematical library.
• Computer Certified Efficient Exact Reals in Coq
• Mathematical structures in dependent type theory (invited talk)
• scientific article; zbMATH DE number 7649978 (Why is no real title available?)
• Mtac: a monad for typed tactic programming in Coq
• Point-free, set-free concrete linear algebra
• COCHIS: stable and coherent implicits
• Tactics for Reasoning Modulo AC in Coq
• Traits: correctness-by-construction for free
• Packaging Mathematical Structures
• Recent Trends in Algebraic Development Techniques
• Competing Inheritance Paths in Dependent Type Theory: A Case Study in Functional Analysis
• Validating Mathematical Structures
• Constructive Type Classes in Isabelle
• Formally verified certificate checkers for hardest-to-round computation
• scientific article; zbMATH DE number 3878328 (Why is no real title available?)
• Structured monads for generic first-order syntax metatheory
• Automatic refinement to efficient data structures: a comparison of two approaches
• Foundations of dependent interoperability
• First-Class Functions
• The Matita interactive theorem prover
• CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verifications of termination certificates
• A consistent foundation for Isabelle/HOL
• A consistent foundation for Isabelle/HOL

Describes a project that uses

Uses Software

• Simula 67
• Locales
• Coq

This page was built for publication: First-Class Type Classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3543665)