Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 68 for “"Higher-Order Logic"”.

  1. Prοοf procedure for extensional higher-order logic programming

    We consider an extensional higher-order logic programming language which possesses the minimum Herbrand model property. We propose an SLD-resolution proof procedure and we demonstrate that it is sound and complete with respect to this semantics. In this way, we extend the familiar proof theory of …

    greece Repository record for Prοοf procedure for extensional higher-order logic programming (opens in a new tab)

  2. Semantics of negation in extensional higher-order logic programming

    … approaches to the semantics of positive higher-order logic programming, originally introduced by W. W. Wadge and M. Bezem respectively. The former approach uses classical domain-theoretic tools while the latter builds on a fixed-point construction defined on a syntactic instantiation of …

    greece Repository record for Semantics of negation in extensional higher-order logic programming (opens in a new tab)

  3. A Resolution Style Proof Procedure for Higher-Order Logic

    Made available in DSpace on 2014-12-11T18:23:45Z (GMT). No. of bitstreams: 1 7206950.pdf: 2953370 bytes, checksum: db0d02b43c3dd10cac5a62b060f42dea (MD5) Previous issue date: 1971

    uiuc Repository record for A Resolution Style Proof Procedure for Higher-Order Logic (opens in a new tab)

  4. Contributions to the Model Theory of Higher-Order Logic

    In this thesis, we develop the model theory of higher-order logic by working in Alonzo, a classical higher-order logic based on Church's formulation of simple type theory that extends first-order logic and that admits undefined expressions. In particular, we sharpen the Löwenheim-Skolem theorem …

    mcmaster Repository record for Contributions to the Model Theory of Higher-Order Logic (opens in a new tab)

  5. Formal Reliability Analysis using Higher-order Logic Theorem Proving

    … proving. Probabilistic theorem proving using higher-order logic can be used for modeling and analysis of reliability of engineering systems provided a certain reasoning infrastructure is developed. The developed infrastructure can include random variables, their probabilistic and statistical …

    concordia Download PDF for Formal Reliability Analysis using Higher-order Logic Theorem Proving (opens in a new tab)

  6. Formalizing Abstraction Mechanisms for Hardware Verification in Higher Order Logic

    oxford Restricted access

  7. Reasoning about Java programs in higher order logic using PVS and Isabelle

    … is part of a larger project called LOOP, for Logic of Object Oriented Programming. A semantics for Java is described in type theory and it is shown how this semantics forms the basis for program verification. The verifications are done with the use of interactive theorem provers,namely PVS and …

    radboud Repository record for Reasoning about Java programs in higher order logic using PVS and Isabelle (opens in a new tab) Download PDF for Reasoning about Java programs in higher order logic using PVS and Isabelle (opens in a new tab)

  8. A formalisation of the theory of context-free languages in higher order logic

    We present a formalisation of the theory of context-free languages using the HOL4 theorem prover. The formalisation of this theory is not only interesting in its own right, but also gives insight into the kind of manipulations required to port a pen-and-paper proof to a theorem prover. The …

    anu Repository record for A formalisation of the theory of context-free languages in higher order logic (opens in a new tab)

  9. HaskHOL: A Haskell Hosted Domain Specific Language for Higher-Order Logic Theorem Proving

    HaskHOL is an implementation of a HOL theorem proving capability in Haskell. Motivated by a need to integrate theorem proving capabilities into a Haskell-based tool suite, HaskHOL began as a simple port of HOL Light to Haskell. However, Haskell's laziness, immutable data, and monadic extensions …

    ku Repository record for HaskHOL: A Haskell Hosted Domain Specific Language for Higher-Order Logic Theorem Proving (opens in a new tab)

  10. Reasoning Using Higher-Order Abstract Syntax in a Higher-Order Logic Proof Environment: Improvements to Hybrid and a Case Study

    … and reasoning about formal systems using higher-order abstract syntax (HOAS). We modify Hybrid's type of terms, which is built definitionally in terms of de Bruijn indices, to exclude at the type level terms with `dangling' indices. We strengthen the injectivity property for Hybrid's …

    ottawa-retro Repository record for Reasoning Using Higher-Order Abstract Syntax in a Higher-Order Logic Proof Environment: Improvements to Hybrid and a Case Study (opens in a new tab)

  11. Formal Analysis of Geometrical Optics using Theorem Proving

    … algorithms. In this thesis, we propose a higher-order logic theorem proving based framework to analyze optical systems. The main advantages of this framework are the expressiveness of higher-order logic and the soundness of theorem proving systems which provide unrivaled analysis accuracy. …

    concordia Download PDF for Formal Analysis of Geometrical Optics using Theorem Proving (opens in a new tab)

  12. Formalization of Discrete-time Markov Chains in HOL

    … analyzing Markovian models.\newline \indent In order to overcome the above mentioned limitations, this thesis advocates the usage of higher-order-logic theorem proving for conducting the analysis of Markov chains. We present the higher-order-logic formalization of Discrete-time Markov Chains …

    concordia Download PDF for Formalization of Discrete-time Markov Chains in HOL (opens in a new tab)

  13. Modeling and verification of DSP designs in HOL

    … at different abstraction levels using higher-order logic based on the HOL (Higher Order Logic) theorem prover. This framework enables the formal verification of DSP designs which in the past could only be done partially using conventional simulation techniques. To this end, we provide a …

    concordia Download PDF for Modeling and verification of DSP designs in HOL (opens in a new tab)

  14. A framework for multi-notation, model-oriented requirements analysis

    … formal operational semantics for notations in higher-order logic produces an extensible, systematic and rigorous approach to solving this problem. Our approach achieves the desired qualities without requiring theorem proving infrastructure. We concentrate on model-oriented notations that use …

    ubc Repository record for A framework for multi-notation, model-oriented requirements analysis (opens in a new tab) Download PDF for A framework for multi-notation, model-oriented requirements analysis (opens in a new tab)

  15. Extensions of logic programming for preference representation

    … of preference representation using extensions of logic programming. The effective representation of preferences is crucial in many scientific disciplines and it can be proven useful in many real-world applications. Preference representation formalisms in the literature usually fall into two basic …

    greece Repository record for Extensions of logic programming for preference representation (opens in a new tab)

  16. A Formal Method to Analyze Framework-Based Software

    … properties of framework-based software with higher-order logic and then demonstrate its utility for a significant, modern system.

    byu Repository record for A Formal Method to Analyze Framework-Based Software (opens in a new tab) Download PDF for A Formal Method to Analyze Framework-Based Software (opens in a new tab)

  17. The metaphysics of properties and relations

    … earlier metaphysical chapters in the context of higher-order logic. In response to the Russellian paradox for properties, Chapter 5 defends a view I call ‘higher-order nominalism’, which says that generalisations involving properties and relations ought to be formalised using higher-order …

    oxford Repository record for The metaphysics of properties and relations (opens in a new tab)

Page 1 of 4