Proof assistants | Logic in computer science

HOL (proof assistant)

HOL (Higher Order Logic) denotes a family of interactive theorem proving systems using similar (higher-order) logics and implementation strategies. Systems in this family follow the LCF approach as they are implemented as a library which defines an abstract data type of proven theorems such that new objects of this type can only be created using the functions in the library which correspond to inference rules in higher-order logic. As long as these functions are correctly implemented, all theorems proven in the system must be valid. As such, a large system can be built on top of a small trusted kernel. Systems in the HOL family use ML or its successors. ML was originally developed along with LCF as a meta-language for theorem proving systems; in fact, the name stands for "Meta-Language". (Wikipedia).

Video thumbnail

Introduction to the Coq Proof Assistant - Andrew Appel

Introduction to the Coq Proof Assistant - Andrew Appel Princeton University December 7, 2010 A "proof assistant" is a software package comprising a validity checker for proofs in a particular logic, accompanied by semi-decision procedures called "tactics" that assist the mathematician in

From playlist Mathematics

Video thumbnail

A Proof Assistant Prototype Based on Algebraic Effects and Handlers - Andrej Bauer

Andrej Bauer University of Ljubljana, Slovenia; Member, School of Mathematics March 21, 2013 For more videos, visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Leonardo de Moura - The Lean proof assistant: introduction and challenges - IPAM at UCLA

Recorded 14 February 2023. Leonardo de Moura of Microsoft Research presents "The Lean proof assistant: introduction and challenges" at IPAM's Machine Assisted Proofs Workshop. Abstract: Lean is the proof assistant of choice for the mathematics community. It is also an efficient programming

From playlist 2023 Machine Assisted Proofs Workshop

Video thumbnail

Bohua Zhan - Verifying symbolic computation in the HolPy theorem prover - IPAM at UCLA

Recorded 16 February 2023. Bohua Zhan of the Chinese Academy of Sciences presents "Verifying symbolic computation in the HolPy theorem prover" at IPAM's Machine Assisted Proofs Workshop. Abstract: Symbolic computation appears frequently in mathematical proofs, as well as in sciences and en

From playlist 2023 Machine Assisted Proofs Workshop

Video thumbnail

4 - Kick-off afternoon : Xavier Leroy, Proof assistants in computer science research

J'ai créé cette vidéo à l'aide de l'application de montage de vidéos YouTube (http://www.youtube.com/editor).

From playlist T2-2014 : Semantics of proofs and certified mathematics

Video thumbnail

Math Talk! Dr. Andrej Bauer on proof assistants, constructive mathematics, philosophy, and more.

In this wonderful discussion with Dr. Andrej Bauer we discuss a whole host of topics centering around constructive mathematics, and proof assistants. Support Ukraine through Shtab Dobra: Instagram: https://www.instagram.com/shtab.dobra/ Facebook: https://www.facebook.com/shtab.dobra PayPa

From playlist Math Talk!

Video thumbnail

Excel - Introduction to Solver - 2036

Microsoft Excel - Solver Introduction. Solver is a free add-in for Windows versions of Excel that can find optimal solutions for problems that are more complex than something Goal Seek can solve. Solver has been a free add-in since the days of Lotus 1-2-3 Solver is a product of Visicorp f

From playlist Full Advanced Excel Course - Free

Video thumbnail

Fabian Immler : Verified numerics for ODEs in Isabelle/HOL

Abstract : This talk is about verified numerical algorithms in Isabelle/HOL, with a focus on guaranteed enclosures for solutions of ODEs. The enclosures are represented by zonotopes, arising from the use of affine arithmetic. Enclosures for solutions of ODEs are computed by set-based varia

From playlist Mathematical Aspects of Computer Science

Video thumbnail

10/25/19, Fabian Immler

Fabian Immler, Carnegie Mellon University Formal mathematics and a proof of chaos Formal proof has been successfully applied to the verification of hardware and software systems. But formal proof is also applicable to mathematics: proofs can be checked with ultimate rigor and one can bui

From playlist Fall 2019 Kolchin Seminar in Differential Algebra

Video thumbnail

Séminaire Bourbaki - 21/06/2014 - 3/4 - Thomas C. HALES

Developments in formal proofs A for mal proof is a proof that can be read and verified by computer, directly from the fundamental rules of logic and the foundational axioms of mathematics. The technology behind for mal proofs has been under development for decades and grew out of efforts i

From playlist Bourbaki - 21 juin 2014

Video thumbnail

Haniel Barbosa - Better SMT proofs for certifying compliance and correctness - IPAM at UCLA

Recorded 14 February 2023. Haniel Barbosa of Universidade Federal de Minas Gerais in Belo Horizonte presents "Better SMT proofs for certifying compliance and correctness" at IPAM's Machine Assisted Proofs Workshop. Abstract: SMT solvers can be hard to trust, since it generally means assumi

From playlist 2023 Machine Assisted Proofs Workshop

Video thumbnail

Mathematica Experts Live: Input Assistant

Ian Hojnicki walks through the features of Mathematica's Input Assistant, including auto-completion, code templates, and dynamic highlighting, in this video from Mathematica Experts Live: New in Mathematica 9. For more information about Mathematica, please visit: http://www.wolfram.com/ma

From playlist Mathematica Experts Live: New in Mathematica 9

Video thumbnail

Ergün Yalcin: Representation rings for fusion systems and dimension functions

The lecture was held within the framework of the (Junior) Hausdorff Trimester Program Topology: Workshop "Fusion systems and equivariant algebraic topology"

From playlist HIM Lectures: Junior Trimester Program "Topology"

Video thumbnail

The Holy, Wholly, Holey NO!: Midday Mindfulness: Arizona State University (ASU)

Are you looking for community and connection? ASU’s Center for Mindfulness, Compassion and Resilience is hosting online mindfulness and meditation sessions from noon to 1 p.m. (AZ time) each weekday. Today we focus on being whole. We hope these midday sessions offer you a chance to reflect

From playlist Midday Mindfulness

Video thumbnail

Q-Homology Projective Planes by Jong-Hae Keum

Algebraic Surfaces and Related Topics PROGRAM URL : http://www.icts.res.in/program/AS2015 DESCRIPTION : This is a joint program of ICTS with TIFR, Mumbai and KIAS, Seoul. The theory of surfaces has been the cradle to many powerful ideas in Algebraic Geometry. The problems in this area

From playlist Algebraic Surfaces and Related Topics

Video thumbnail

History of Science and Technology Q&A (June 1, 2022)

Stephen Wolfram hosts a live and unscripted Ask Me Anything about the history of science and technology for all ages. Find the playlist of Q&A's here: https://wolfr.am/youtube-sw-qa Originally livestreamed at: https://twitch.tv/stephen_wolfram If you missed the original livestream of

From playlist Stephen Wolfram Ask Me Anything About Science & Technology

Video thumbnail

W. Zheng - Compatible systems along the boundary

A theorem of Deligne says that compatible systems of l-adic sheaves on a smooth curve over a finite field are compatible along the boundary. I will present an extension of Deligne's theorem to schemes of finite type over the ring of integers of a local field, based on Gabber's theorem on c

From playlist Arithmetic and Algebraic Geometry: A conference in honor of Ofer Gabber on the occasion of his 60th birthday

Video thumbnail

Emmy Noether Lecture: Variations on Conservation Laws - Cathleen Morawetz [ICM 1998]

ICM Berlin Videos 27.08.1998 Emmy Noether Lecture: Variations on Conservation Laws for the Wave Equation Cathleen Morawetz https://www.mathunion.org/icm/icm-videos/icm-1998-videos-berlin-germany/icm-berlin-videos-27081998

From playlist Number Theory

Video thumbnail

OpenAI GPT 3.5 AI assistant with Langchain + Pinecone #1

I'm building an AI assistant that will *actually* be useful. Here's the outline of the idea for this AI assistant. The idea is to rely heavily on the Langchain library and use tools and services like OpenAI and Pinecone (OP stack). We're currently focusing on the AI assistant's ArXiv "res

From playlist Building an AI Assistant

Related pages

Higher-order logic | Abstract data type | Isabelle (proof assistant) | Coupling (computer programming) | Proof assistant | Semantics (computer science) | Classical logic | Theorem | Z notation | HOL Light