Automatically Generating Counterexamples to Naive Free Theorems-Reference-Cited by-同舟云学术

Automatically Generating Counterexamples to Naive Free Theorems

Published:2010 Issue: Volume: Page:175-190
ISSN:0302-9743
Container-title:Functional and Logic Programming
language:
Short-container-title:

Author:

Seidel Daniel,Voigtländer Janis

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-12251-4_14

Reference20 articles.

1. Augustsson, L.: Putting Curry-Howard to work (Invited talk). At Approaches and Applications of Inductive Programming (2009)

2. Christiansen, J., Seidel, D., Voigtländer, J.: Free theorems for functional logic programs. In: Proceedings of Programming Languages meets Program Verification, pp. 39–48. ACM Press, New York (2010)

3. Claessen, K., Hughes, R.J.M.: QuickCheck: A lightweight tool for random testing of Haskell programs. In: Proceedings of International Conference on Functional Programming, pp. 268–279. ACM Press, New York (2000)

4. Lecture Notes in Computer Science;P. Corbineau,2004

5. Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. Journal of Symbolic Logic 57(3), 795–807 (1992)

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

1. Conjuring Fusion Laws via Relational Calculus;Journal of Information Processing;2023

2. A liberal type system for functional logic programs;Mathematical Structures in Computer Science;2014-11-10

3. Safe typing of functional logic programs with opaque patterns and local bindings;Information and Computation;2014-04

4. Refined typing to localize the impact of forced strictness on free theorems;Acta Informatica;2011-04-16