logical verificationexercises 2 Exercise 1. This exercise is concerned with dependent types. We use the following definition in Coq: Inductive natlist_dep : nat -> Set := | nil_dep : natlist_dep 0

Source URL: www.cs.ru.nl

• Logic
• Mathematical logic
• Mathematics
• Type theory
• Propositional calculus
• Syntax
• Predicate logic
• CurryHoward correspondence
• Dependent type
• Lambda calculus
• First-order logic
• Proposition

Shallow embedding of a logic in Coq Jérôme Vouillon Universite Paris Diderot - Paris 7, CNRS Motivation Hoare-style assertions

Source URL: www.cis.upenn.edu

• Logic
• Logic in computer science
• Theoretical computer science
• Mathematical logic
• Separation logic
• Assertion
• Rule of inference

Formal Proofs for Taylor Models in Coq Ioana Paşca LIP, ENS Lyon joint work with Nicolas Brisebarre, Mioara Joldeş, Erik Martin-Dorel, Micaela Mayero, Jean-Michel Muller, Laurence Rideau & Laurent Théry

Source URL: raim2012.u-bourgogne.fr

• Mathematical analysis
• Mathematics
• Numerical analysis
• Algebra
• Polynomial
• Taylor series
• Interval arithmetic

FoCaLiZe! Programming and Proving! A Bit Under the Hood François Pessaux - ENSTA ParisTech (U2IS)

Source URL: www.cri.ensmp.fr

• Software engineering
• Computer programming
• Programming language theory
• Functional languages
• Functional programming
• Procedural programming languages
• Mathematical proof
• Coq
• OCaml
• Natural deduction
• Mathematical logic
• ALGOL 68

Event: A.Le Coq 59. Muhu Väina regatt Organizing authority: ESS Kalev Jahtklubi,

Source URL: www.muhuvain.ee

Proof-Carrying Code from Certied Abstract Interpretation and Fixpoint Compression Frédéric Besson and Thomas Jensen and David Pichardie Irisa, Campus de Beaulieu, FRennes, France Abstract

Source URL: people.rennes.inria.fr

• Formal methods
• Type theory
• Dependently typed programming
• Theoretical computer science
• Logic in computer science
• Coq
• Abstract interpretation
• CurryHoward correspondence
• Predicate transformer semantics
• Proof-carrying code
• Correctness
• Lines of Action

Local optimality in algebraic path problems (with help from Coq and Ssreflect) Timothy G. Griffin Computer Laboratory University of Cambridge, UK

Source URL: www.monmeetings.org

• Operations research
• Edsger W. Dijkstra
• Network theory
• Shortest path problem
• Mathematical optimization
• Routing algorithms
• Systems engineering
• Dynamic programming

propositional logic logical verification week

Source URL: www.cs.ru.nl

• Type theory
• Automated theorem proving
• Logic in computer science
• Formal methods
• Proof assistants
• Coq
• CurryHoward correspondence
• Lambda calculus
• Propositional calculus
• First-order logic

Polytypic Properties and Proofs in Coq Wendy Verbruggen ∗ Edsko de Vries † Arthur Hughes

Source URL: www.edsko.net

• Type theory
• Generic programming
• Polytypic
• NP
• Polymorphism
• Functor
• Dependent type
• Map

A Taste of Sound Reasoning in Faust Emilio Jesús Gallego Arias, Olivier Hermant, Pierre Jouvelot MINES ParisTech, PSL Research University, France {emilio.gallego_arias, olivier.hermant, pierre.jouvelot}@mines-paristech.

Source URL: lac.linuxaudio.org

• Type theory
• Functional languages
• FAUST
• Eval
• Dependent type
• Coq
• NyquistShannon sampling theorem
• Mathematical proof
• FeitThompson theorem
• Functional programming