Expressing polymorphic types in a many-sorted language
From MaRDI portal
Publication:3172884
DOI10.1007/978-3-642-24364-6_7zbMATH Open1348.68215OpenAlexW1566741425MaRDI QIDQ3172884FDOQ3172884
Authors: François Bobot, Andrei Paskevich 
Publication date: 7 October 2011
Published in: Frontiers of Combining Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24364-6_7
Recommendations
Cites Work
- Isabelle/HOL. A proof assistant for higher-order logic
- Translating higher-order clauses to first-order clauses
- Title not available (Why is that?)
- Title not available (Why is that?)
- Expressing polymorphic types in a many-sorted language
- A polymorphic intermediate verification language: design and logical encoding
- Handling Polymorphism in Automated Deduction
Cited In (11)
- Sorting Multidimensional Types: Theory and Application
- Polytypic values possess polykinded types
- Title not available (Why is that?)
- A combinator-based superposition calculus for higher-order logic
- Expressing polymorphic types in a many-sorted language
- Encoding monomorphic and polymorphic types
- Sort it out with monotonicity. Translating between many-sorted and unsorted first-order logic
- Encoding monomorphic and polymorphic types
- Handling Polymorphism in Automated Deduction
- Axiomatization of typed first-order logic
- A Polymorphic Vampire
Uses Software
This page was built for publication: Expressing polymorphic types in a many-sorted language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172884)
