A Combinatorial Testing Framework for Intuitionistic Propositional Theorem Provers-Reference-Cited by-同舟云学术

A Combinatorial Testing Framework for Intuitionistic Propositional Theorem Provers

Published:2018-12-19 Issue: Volume: Page:115-132
ISSN:0302-9743
Container-title:Practical Aspects of Declarative Languages
language:
Short-container-title:

Author:

Tarau Paul

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-05998-9_8

Reference28 articles.

1. Howard, W.: The formulae-as-types notion of construction. In: Seldin, J., Hindley, J. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 479–490. Academic Press, London (1980)

2. Wadler, P.: Propositions as types. Commun. ACM 58, 75–84 (2015)

3. Statman, R.: Intuitionistic propositional logic is polynomial-space complete. Theor. Comput. Sci. 9, 67–72 (1979)

4. The Coq development team: The Coq proof assistant reference manual (2018) Version 8.8.0

5. Kostrzycka, Z., Zaionc, M.: Asymptotic densities in logic and type theory. Studia Logica 88(3), 385–403 (2008)

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

1. Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis;Theory and Practice of Logic Programming;2022-06-28

2. Towards Substructural Property-Based Testing;Logic-Based Program Synthesis and Transformation;2022

3. Synthesis of Modality Definitions and a Theorem Prover for Epistemic Intuitionistic Logic;Logic-Based Program Synthesis and Transformation;2021

4. Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms;Fundamenta Informaticae;2020-12-10

5. Deriving Theorems in Implicational Linear Logic, Declaratively;Electronic Proceedings in Theoretical Computer Science;2020-09-19