Mechanizing coinduction and corecursion in higher-order logic
نویسندگان
چکیده
منابع مشابه
Mechanizing Coinduction and Corecursion in Higher-order Logic
A theory of recursive and corecursive definitions has been developed in higher-order logic (HOL) and mechanized using Isabelle. Least fixedpoints express inductive data types such as strict lists; greatest fixedpoints express coinductive data types, such as lazy lists. Wellfounded recursion expresses recursive functions over inductive data types; corecursion expresses functions that yield eleme...
متن کاملMechanizing Programming Logics in Higher Order Logic
Formal reasoning about computer programs can be based directly on the semantics of the programming language, or done in a special purpose logic like Hoare logic. The advantage of the first approach is that it guarantees that the formal reasoning applies to the language being used (it is well known, for example, that Hoare’s assignment axiom fails to hold for most programming languages). The adv...
متن کاملMechanizing Programming Logics in Higher Order Logic 1
Formal reasoning about computer programs can be based directly on the semantics of the programming language, or done in a special purpose logic like Hoare logic. The advantage of the rst approach is that it guarantees that the formal reasoning applies to the language being used (it is well known, for example, that Hoare's assignment axiom fails to hold for most programming languages). The advan...
متن کاملProductive corecursion in logic programming
Logic Programming is a Turing complete language. As a consequence, designing algorithms that decide termination and non-termination of programs or decide inductive/coinductive soundness of formulae is a challenging task. For example, the existing state-of-the-art algorithms can only semi-decide coinductive soundness of queries in logic programming for regular formulae. Another, less famous, but...
متن کاملMechanizing Linear Logic in Isabelle
We present an implementation of propositional Linear Logic in the Isabelle proof system. Previous implementations of Linear Logic have often been geared to studies of efficiency of proof search; ours provides an environment for users to describe problems and to develop proofs interactively. Isabelle provides many facilities for developing a useful specification and verification environment from...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 1997
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/7.2.175