Encoding monomorphic and polymorphic types
From MaRDI portal
Publication:5326348
Recommendations
Cited in
(18)- A formalized general theory of syntax with bindings: extended version
- Finding Finite Models in Multi-sorted First-Order Logic
- Encoding types in ML-like languages
- The higher-order prover \textsc{Leo}-II
- Semi-intelligible Isar proofs from machine-generated proofs
- Handling Polymorphism in Automated Deduction
- Efficient encodings of first-order Horn formulas in equational logic
- Encoding monomorphic and polymorphic types
- Soundly proving B method formulæ using typed sequent calculus
- A Polymorphic Vampire
- GRUNGE: a grand unified ATP challenge
- Expressing polymorphic types in a many-sorted language
- Extending Sledgehammer with SMT solvers
- A learning-based fact selector for Isabelle/HOL
- Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\)
- A formalized general theory of syntax with bindings
- HOL(y)Hammer: online ATP service for HOL Light
- Soundness and completeness proofs by coinductive methods
This page was built for publication: Encoding monomorphic and polymorphic types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326348)