Adapting functional programs to higher order logic

Authors:
Scott Owens;Konrad Slind
Affiliations:
School of Computing, University of Utah, Salt Lake City, USA;School of Computing, University of Utah, Salt Lake City, USA
Venue:
Higher-Order and Symbolic Computation
Year:
2008

Citing 42
Cited 3

From regular expressions to deterministic automata

Theoretical Computer Science
IMPS: an interactive mathematical proof system

CADE-10 Proceedings of the tenth international conference on Automated deduction
Abstracting control

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
Cayenne—a language with dependent types

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
The under-appreciated unfold

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Building reliable, high-performance communication systems from components

Proceedings of the seventeenth ACM symposium on Operating systems principles
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Implicit parameters: dynamic scoping with static types

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The size-change principle for program termination

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming Techniques: Regular expression search algorithm

Communications of the ACM
High-speed, analyzable simulators

Computer-Aided reasoning
Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach
Termination of Nested and Mutually Recursive Algorithms

Journal of Automated Reasoning
On Equivalents of Well-Foundedness

Journal of Automated Reasoning
Dependent Types for Program Termination Verification

Higher-Order and Symbolic Computation
Elementary Strong Functional Programming

FPLE '95 Proceedings of the First International Symposium on Functional Programming Languages in Education
Structural Recursive Definitions in Type Theory

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Inductive Definitions: Automation and Application

Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications
Derivation and Use of Induction Schemes in Higher-Order Logic

TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Verified Lexical Analysis

Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Executing Higher Order Logic

TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Verifying BDD Algorithms through Monadic Interpretation

VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Static Analysis for Safe Destructive Updates in a Functional Language

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Termination Analysis for Functional Programs using Term Orderings

SAS '95 Proceedings of the Second International Symposium on Static Analysis
Wellfounded Schematic Definitions

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Defunctionalization at work

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
A categorical programming language

A categorical programming language
Partial Functions in ACL2

Journal of Automated Reasoning
Building reliable, high-performance networks with the Nuprl proof development system

Journal of Functional Programming
Regular expression pattern matching for XML

Journal of Functional Programming
Verification of non-functional programs using interpretations in type theory

Journal of Functional Programming
A predicative analysis of structural recursion

Journal of Functional Programming
Proof-directed debugging

Journal of Functional Programming
HOLCF = HOL + LCF

Journal of Functional Programming
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
Enumerating the strings of regular languages

Journal of Functional Programming
Random Testing in Isabelle/HOL

SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
RELAX NG

RELAX NG
Efficient execution in an automated reasoning environment

Journal of Functional Programming
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic
Termination analysis with calling context graphs

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification

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
Proof-producing synthesis of ML from higher-order logic

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifications, and proofs. However, a possibly unfamiliar aspect of working in such an environment is that formally establishing program termination is necessary. In many cases, termination can be automatically proved, but there are useful programs that diverge and others that always terminate but have difficult termination proofs. We discuss techniques that support the expression of such programs as logical functions.