Expressing Polymorphic Types in a Many-Sorted Language-Reference-Cited by-同舟云学术

Expressing Polymorphic Types in a Many-Sorted Language

Published:2011 Issue: Volume: Page:87-102
ISSN:0302-9743
Container-title:Frontiers of Combining Systems
language:
Short-container-title:

Author:

Bobot François,Paskevich Andrei

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-24364-6_7

Reference17 articles.

1. Barrett, C., Stump, A., Tinelli, C.: The SMT-LIB Standard: Version 2.0. Tech. rep., Department of Computer Science, The University of Iowa (2010)

2. Lecture Notes in Computer Science;C.W. Barrett,2007

3. Bobot, F., Conchon, S., Contejean, E., Lescuyer, S.: Implementing polymorphism in SMT solvers. In: SMT 2008. ACM ICPS, vol. 367, pp. 1–5 (2008)

4. Bobot, F., Filliâtre, J.C., Marché, C., Paskevich, A.: Why3: Shepherd your herd of provers. In: Boogie 2011 (co-loc. with CADE-23), Wrocław, Poland (August 2011)

5. Bobot, F., Paskevich, A.: Expressing polymorphic types in a many-sorted language (extended version) (July 2011), http://hal.inria.fr/inria-00591414/en/

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Compositional Pre-processing for Automated Reasoning in Dependent Type Theory;Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs;2023-01-11

2. General Automation in Coq through Modular Transformations;Electronic Proceedings in Theoretical Computer Science;2021-07-07

3. SUPERPOSITION FOR LAMBDA-FREE HIGHER-ORDER LOGIC;LOG METH COMPUT SCI;2021

4. Featherweight go;Proceedings of the ACM on Programming Languages;2020-11-13

5. A Polymorphic Vampire;Automated Reasoning;2020