Skip to main content
-4 votes
0 answers
34 views

I want to make some tests on Isabelle to compare the efficiency of Sepref and LLVM. To do so I am using the Sepref examples given in the Archive of Formal Proof in the Refine_Imperative_HOL section. ...
Drox's user avatar
  • 1
0 votes
1 answer
51 views

Consider the following theory: theory Scratch2 imports Main begin lemma ex: "A ∧ B ⟶ B ∧ A" proof assume "A ∧ B" then obtain B and A .. then show "B ∧ A" .. qed ...
justF's user avatar
  • 133
1 vote
1 answer
169 views

I'm trying to prove time complexity of merge sort algorithm in Isabelle HOL: theory Merge_Sort_Time imports Complex_Main "HOL-ex.BigO" begin fun merge :: "'a::linorder list ⇒ 'a list ...
Denis's user avatar
  • 1,325
1 vote
1 answer
35 views

I would like to state a simple equation in Isabelle: \nabla f (x) = 0 where 0 is n dimensional and f : R^n --> R. What I have so far is: `fixes f :: "ℝ vec['n] ⇒ real" and x :: "ℝ ...
Squirtle's user avatar
  • 155
1 vote
0 answers
33 views

If I'm proving some property "P (n :: nat)", and apply some intermediate rule that changes it into "P (LENGTH(?'a))" with an additional proof obligation to show that "n = ...
Daniel Matichuk's user avatar
1 vote
1 answer
31 views

ORIGINAL POST: I'm trying to show the following: have "continuous_on {x. 0 < x} (λx. 12 * x⇧2 - 1)" And I would like to use the following lemma: thm continuous_on_diff -------------------...
Squirtle's user avatar
  • 155
0 votes
0 answers
21 views

I'm interested in simulating the effect of going to the definition of a constant (ctrl + click) in Isabelle. So given a symbol, for example AExp.plus in ~~/src/HOL/IMP/AExp, I want to recover the ...
Yousef Alhessi's user avatar
2 votes
1 answer
61 views

I have been using isabelle for some time, and although I can use isabelle to prove something, I am still not clear about the distinction between proof and proof-. The differences between the two I ...
R1n's user avatar
  • 21
2 votes
0 answers
57 views

I have a Scala development environment with Metals and a build.sbt. The theorem-prover Isabelle provides its own wrappers for Scala tools such as scalac, scala, etc. I have Isabelle added to my path ...
Anonymous Coder's user avatar
0 votes
1 answer
106 views

Just curious if there is a way to express the nth derivative of f or f^{(n)}(x) in Isabelle. Would this involve using something like "(f has_derivative f') (at x)" or would it involve DERIV ...
Squirtle's user avatar
  • 155
0 votes
1 answer
56 views

I am using a theorem prover to demonstrate the progress of programs. The semantics of a program are defined using a small-step relation, denoted as ctran, between program configurations. A program ...
Huan Sun's user avatar
  • 167
1 vote
1 answer
53 views

Isabelle's preorder class requires providing both less_eq and less: class ord = fixes less_eq :: "'a ⇒ 'a ⇒ bool" and less :: "'a ⇒ 'a ⇒ bool" class preorder = ord + ...
Mathieu Paturel's user avatar
0 votes
1 answer
42 views

I want to apply auto to all the proof goals the previous apply created, but not the other ones. I only know how to do it by putting everything in a subgoal. Is there a nicer way? lemma bar: assumes ...
Mathieu Paturel's user avatar
1 vote
1 answer
78 views

record r = a :: nat b :: nat c :: nat lemma "P (r ⦇ a := 2, b := 3 ⦈) ⟹ P (r ⦇b := 3, a := 2⦈)" apply auto ― ‹doesn't work› by (metis r.simps(5) r.simps(6) r.surjective) Why ...
Mathieu Paturel's user avatar
0 votes
1 answer
47 views

Sometimes, using XXX apply blast discharges a proof goal, but apply (blast mod: XXX) doesn't work for mod any of intro, elim or del, with or without !. What does using actually do to blast?
Mathieu Paturel's user avatar

15 30 50 per page
1
2 3 4 5
77