Pages that link to "Item:Q1029815"
From MaRDI portal
The following pages link to Adapting functional programs to higher order logic (Q1029815):
Displaying 12 items.
- Verifying termination and reduction properties about higher-order logic programs (Q850496) (← links)
- Generating certified code from formal proofs: a case study in homological algebra (Q968307) (← links)
- Partial and nested recursive function definitions in higher-order logic (Q972425) (← links)
- Nesting forward-mode AD in a functional framework (Q1029813) (← links)
- A formalisation of the Myhill-Nerode theorem based on regular expressions (Q2351151) (← links)
- Discovering applications of higher order functions through proof planning (Q2576573) (← links)
- POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl) (Q2829247) (← links)
- Proof-producing translation of higher-order logic into pure and stateful ML (Q2875232) (← links)
- Analysing the complexity of functional programs: higher-order meets first-order (Q2981952) (← links)
- A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions (Proof Pearl) (Q3088018) (← links)
- Partiality and recursion in interactive theorem provers – an overview (Q5741556) (← links)
- POSIX lexing with derivatives of regular expressions (Q6111525) (← links)