On Equivalents of Well-Foundedness
Journal of Automated Reasoning
Inductive Datatypes in HOL - Lessons Learned in Formal-Logic Engineering
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Fix-Point Equations for Well-Founded Recursion in Type Theory
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Fixed point semantics and partial recursion in Coq
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Logic-Free Reasoning in Isabelle/Isar
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Adapting functional programs to higher order logic
Higher-Order and Symbolic Computation
Automating Algebraic Specifications of Non-freely Generated Data Types
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Abstract predicates and mutable adts in hoare type theory
ESOP'07 Proceedings of the 16th European conference on Programming
Bounded relational analysis of free data types
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Automated Flaw Detection in Algebraic Specifications
Journal of Automated Reasoning
TAP'10 Proceedings of the 4th international conference on Tests and proofs
The optimal fixed point combinator
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Hi-index | 0.00 |