From LCF to Isabelle/HOL (Q2280211): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Berlekamp Zassenhaus / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CAVA LTL Modelchecker / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gabow SCC / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Kodkod / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2971627214 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1907.02836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On definitions of constants and types in HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2729065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpretation of Locales in Isabelle: Theories and Proof Contexts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locales: a module system for mathematical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The role of the Mizar mathematical library for interactive proof development in Mizar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turning Inductive into Equational Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Proof and Disproof in Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Sledgehammer with SMT solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imperative Functional Programming with Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of an executable LTL model checker with partial order reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3894958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smart Testing of Functional Programs in Isabelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The New Quickcheck for Isabelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5088165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and algorithms for the construction and analysis of systems. 14th international conference, TACAS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29--April 6, 2008. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lean Theorem Prover (System Description) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic mode inference for logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing program termination and complexity automatically with \textsf{AProVE} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four decades of {\textsc{Mizar}}. Foreword / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edinburgh LCF. A mechanized logic of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3906381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3753927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tactics for mechanized reasoning: a commentary on Milner (1984) ‘The use of machines to assist in rigorous proof’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A FORMAL PROOF OF THE KEPLER CONJECTURE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for defining logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type Classes and Filters for Mathematical Analysis in Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Refinement in Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Code Generation via Higher-Order Rewrite Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A verified compiler from Isabelle/HOL to CakeML / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming with Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unification algorithm for typed \(\overline\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive Type Classes in Isabelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Theory Specifications in Isabelle/Isar / rank
 
Normal rank
Property / cites work
 
Property / cites work: CakeML / rank
 
Normal rank
Property / cites work
 
Property / cites work: A consistent foundation for Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Data Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient verified (UN)SAT certificate checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinement to imperative HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Animating the Formalised Semantics of a Java-Like Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formally verified compiler back-end / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding univariate polynomial problems using untrusted certificates in Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uppaal in a nutshell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalizing network flow algorithms: a refinement approach in Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Licensing the Mizar Mathematical Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive mathematics and computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eisbach: a proof method language for Isabelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automation for interactive proof: first prototype / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order unification, polymorphism, and subsorts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concrete Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Decision Procedures Based on Congruence Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking Conservativity of Overloaded Definitions in Higher-Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing in systems described by equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of hyper-resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural deduction as higher-order resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The foundation of a generic theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle. A generic theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle⁄zf / rank
 
Normal rank
Property / cites work
 
Property / cites work: Organizing numerical theories using axiomatic type classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational logic: its origins and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining partial-order reductions with on-the-fly model-checking. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing set theory. Cardinal arithmetic and the axiom of choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundational Property-Based Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Source-Level Proof Reconstruction for Interactive Theorem Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Brief Overview of HOL4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kodkod: A Relational Model Finder / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certification of Termination Proofs Using CeTA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected papers from the workshops on disproving and the second international workshop on pragmatics of decision procedures (PDPAR 2004), Cork, Ireland, 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle as Document-Oriented Proof Assistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shared-Memory Multiprocessing for Interactive Theorem Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous User Interaction and Tool Integration in Isabelle/PIDE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interaction with formal mathematical documents in Isabelle/PIDE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verified model checking of timed automata / rank
 
Normal rank

Latest revision as of 07:38, 21 July 2024

scientific article
Language Label Description Also known as
English
From LCF to Isabelle/HOL
scientific article

    Statements

    From LCF to Isabelle/HOL (English)
    0 references
    0 references
    0 references
    18 December 2019
    0 references
    0 references
    LCF
    0 references
    HOL
    0 references
    Isabelle
    0 references
    interactive theorem proving
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references