Logic programming in the LF logical framework
Logical frameworks
Synthesis of ML programs in the system Coq
Journal of Symbolic Computation - Special issue on automatic programming
Addendum to the 1998 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum)
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Computer-Aided Reasoning: An Approach
Computer-Aided Reasoning: An Approach
Journal of Automated Reasoning
Machine-Checking the Java Specification: Proving Type-Safety
Formal Syntax and Semantics of Java
Executing HOL Specifications: Towards an Evaluation Semantics for Classical Higher Order Logic
HOL'92 Proceedings of the IFIP TC10/WG10.2 Workshop on Higher Order Logic Theorem Proving and its Applications
Executing Formal Specifications by Translation to Higher Order Logic Programming
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Lazy Infinite-State Analysis of Security Protocols
Proceedings of the International Exhibition and Congress on Secure Networking - CQRE (Secure) '99
Investigating Type-Certifying Compilation with Isabelle
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Efficient Reasoning about Executable Specifications in Coq
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Theoretical Computer Science - Foundations of software science and computation structures
Journal of Automated Reasoning
A reflective functional language for hardware design and theorem proving
Journal of Functional Programming
A machine-checked model for a Java-like language, virtual machine, and compiler
ACM Transactions on Programming Languages and Systems (TOPLAS)
An operational semantics and type safety prooffor multiple inheritance in C++
Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Two case studies of semantics execution in Maude: CCS and LOTOS
Formal Methods in System Design
Proof Synthesis and Reflection for Linear Arithmetic
Journal of Automated Reasoning
Pervasive Compiler Verification -- From Verified Programs to Verified Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Certified Size-Change Termination
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Adapting functional programs to higher order logic
Higher-Order and Symbolic Computation
Turning Inductive into Equational Specifications
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Formalizing the Logic-Automaton Connection
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Formalising FinFuns --- Generating Code for Functions as Data from Isabelle/HOL
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
A Program Result Checker for the Lexical Analysis of the GNU C Compiler
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial and Nested Recursive Function Definitions in Higher-order Logic
Journal of Automated Reasoning
Structure of a proof-producing compiler for a subset of higher order logic
ESOP'07 Proceedings of the 16th European conference on Programming
Program extraction in simply-typed higher order logic
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Extracting purely functional contents from logical inductive types
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Proof pearl: looping around the orbit
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Formal verification with Isabelle/HOL in practice: finding a bug in the GCC scheduler
FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
Mechanizing the metatheory of LF
ACM Transactions on Computational Logic (TOCL)
Incremental and verified modeling of the PCI express protocol
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special section on the ACM IEEE international conference on formal methods and models for codesign (MEMOCODE) 2009
A formalisation of the Myhill-Nerode theorem based on regular expressions (proof pearl)
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
An executable object-oriented semantics and its application to firewall verification
Software and Systems Modeling (SoSyM)
A DSL for writing type systems for Xtext languages
Proceedings of the 9th International Conference on Principles and Practice of Programming in Java
Defining and reasoning about recursive functions: a practical tool for the coq proof assistant
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Verifying and reflecting quantifier elimination for presburger arithmetic
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Idempotent relations in Isabelle/HOL
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Extracting programs from constructive HOL proofs via IZF set-theoretic semantics
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Verifying mixed real-integer quantifier elimination
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Code generation via higher-order rewrite systems
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Teaching semantics with a proof assistant: no more LSD trip proofs
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Generating verifiable java code from verified PVS specifications
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Proof Pearl: Regular Expression Equivalence and Relation Algebra
Journal of Automated Reasoning
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Producing certified functional code from inductive specifications
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
Formal program optimization in nuprl using computational equivalence and partial types
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Program extraction from nested definitions
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions
Journal of Automated Reasoning
| Hi-index | 0.00 |
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are compiled into a functional program. Functions and inductively defined relations can be mixed. Inductive definitions must be such that they can be executed in Prolog style but requiring only matching rather than unification. This restriction is enforced by a mode analysis. Tail recursive partial functions can be defined and executed with the help of a while combinator.